Françoise Bellegarde-Webb
List of publications from the DBLP Bibliography Server - FAQ
2006 | ||
---|---|---|
25 | EE | Samir Chouali, Jacques Julliand, Pierre-Alain Masson, Françoise Bellegarde: PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions CoRR abs/cs/0602040: (2006) |
24 | EE | Françoise Bellegarde, Jacques Julliand, Hassan Mountassir, Emilie Oudot: On the Contribution of a tau. Electr. Notes Theor. Comput. Sci. 160: 97-111 (2006) |
2005 | ||
23 | EE | Françoise Bellegarde, Samir Chouali, Jacques Julliand: Refinemant verification of fair transition systems can contribute to PLTL model checking. MEMOCODE 2005: 166-175 |
22 | EE | Samir Chouali, Jacques Julliand, Pierre-Alain Masson, Françoise Bellegarde: PLTL-partitioned model checking for reactive systems under fairness assumptions. ACM Trans. Embedded Comput. Syst. 4(2): 267-301 (2005) |
2003 | ||
21 | EE | Françoise Bellegarde, Celina Charlet, Olga Kouchnarenko: How to Compute the Refinement Relation for Parameterized Systems. MEMOCODE 2003: 103-112 |
2002 | ||
20 | EE | Françoise Bellegarde, Jacques Julliand, Olga Kouchnarenko: Synchronized Parallel Composition of Event Systems in B. ZB 2002: 436-457 |
19 | EE | Françoise Bellegarde, Samir Chouali, Jacques Julliand: Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions. ZB 2002: 477-496 |
18 | EE | Françoise Bellegarde, Celina Charlet, Olga Kouchnarenko: Raffiner pour vérifier des systèmes paramétrés. Technique et Science Informatiques 21(8): 1121-1149 (2002) |
2001 | ||
17 | EE | Françoise Bellegarde, Christophe Darlot, Jacques Julliand, Olga Kouchnarenko: Reformulation: A Way to Combine Dynamic Properties and B Refinement. FME 2001: 2-19 |
2000 | ||
16 | EE | Françoise Bellegarde, Jacques Julliand, Olga Kouchnarenko: Ready-Simulation Is Not Ready to Express a Modular Refinement Relation. FASE 2000: 266-283 |
15 | EE | Françoise Bellegarde, Christophe Darlot, Jacques Julliand, Olga Kouchnarenko: Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants. ZB 2000: 230-249 |
1997 | ||
14 | Jeffrey M. Bell, Françoise Bellegarde, James Hook: Type-Driven Defunctionalization. ICFP 1997: 25-37 | |
1995 | ||
13 | Françoise Bellegarde: ASTRE: Towards a Fully Automated Program Transformation System. RTA 1995: 403-407 | |
12 | Richard B. Kieburtz, Françoise Bellegarde, Jeffrey M. Bell, James Hook, Jeffrey Lewis, Dino Oliva, Tim Sheard, Lisa Walton, Tong Zhou: Calculating Software Generators from Solution Specifications. TAPSOFT 1995: 546-560 | |
1994 | ||
11 | EE | Jeffrey M. Bell, Françoise Bellegarde, James Hook, Richard B. Kieburtz, Alex Kotov, Jeffrey Lewis, Laura McKinney, Dino Oliva, Tim Sheard, L. Tong, Lisa Walton, Tong Zhou: Software design for reliability and reuse: a proof-of-concept demonstration. TRI-Ada 1994: 396-404 |
10 | Françoise Bellegarde, James Hook: Subsitution: A Formal Methods Case Study Using Monads and Transformations. Sci. Comput. Program. 23(2-3): 287-311 (1994) | |
1993 | ||
9 | Françoise Bellegarde: A Transformation System Combining Partial Evaluation with Term Rewriting. HOA 1993: 40-55 | |
8 | Françoise Bellegarde, James Hook: Monads, Indexes and Transformations. TAPSOFT 1993: 314-327 | |
1991 | ||
7 | Françoise Bellegarde: Program Transformation and Rewriting. RTA 1991: 226-239 | |
1990 | ||
6 | Françoise Bellegarde: A Matching Process Modulo a Theory of Categorical Products. ALP 1990: 270-282 | |
5 | Françoise Bellegarde, Pierre Lescanne: Termination by Completion. Appl. Algebra Eng. Commun. Comput. 1: 79-96 (1990) | |
1987 | ||
4 | Françoise Bellegarde, Pierre Lescanne: Transformation Ordering. TAPSOFT, Vol.1 1987: 69-80 | |
1986 | ||
3 | Françoise Bellegarde: Rewriting Systems on FP Expressions to Reduce the Number of Sequences Yielded. Sci. Comput. Program. 6(1): 11-34 (1986) | |
1985 | ||
2 | Françoise Bellegarde: Convergent term rewriting systems can be used for program transformation. Programs as Data Objects 1985: 24-41 | |
1984 | ||
1 | Françoise Bellegarde: Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield. LISP and Functional Programming 1984: 63-73 |
1 | Jeffrey M. Bell | [11] [12] [14] |
2 | Celina Charlet | [18] [21] |
3 | Samir Chouali | [19] [22] [23] [25] |
4 | Christophe Darlot | [15] [17] |
5 | James Hook | [8] [10] [11] [12] [14] |
6 | Jacques Julliand | [15] [16] [17] [19] [20] [22] [23] [24] [25] |
7 | Richard B. Kieburtz (Dick Kieburtz) | [11] [12] |
8 | Alex Kotov | [11] |
9 | Olga Kouchnarenko | [15] [16] [17] [18] [20] [21] |
10 | Pierre Lescanne | [4] [5] |
11 | Jeffrey Lewis | [11] [12] |
12 | Pierre-Alain Masson | [22] [25] |
13 | Laura McKinney | [11] |
14 | Hassan Mountassir | [24] |
15 | Dino Oliva | [11] [12] |
16 | Emilie Oudot | [24] |
17 | Tim Sheard | [11] [12] |
18 | L. Tong | [11] |
19 | Lisa Walton | [11] [12] |
20 | Tong Zhou | [11] [12] |