Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield. - Françoise Bellegarde (LISP and Functional Programming, 1984)

Convergent term rewriting systems can be used for program transformation. - Françoise Bellegarde (Programs as Data Objects, 1985)

Rewriting Systems on FP Expressions to Reduce the Number of Sequences Yielded. - Françoise Bellegarde (Sci. Comput. Program., 1986)

Transformation Ordering. - Françoise Bellegarde; Pierre Lescanne (TAPSOFT, Vol.1, 1987)

A Matching Process Modulo a Theory of Categorical Products. - Françoise Bellegarde (ALP, 1990)

Termination by Completion. - Françoise Bellegarde; Pierre Lescanne (Appl. Algebra Eng. Commun. Comput., 1990)

Program Transformation and Rewriting. - Françoise Bellegarde (RTA, 1991)

A Transformation System Combining Partial Evaluation with Term Rewriting. - Françoise Bellegarde (HOA, 1993)

Monads, Indexes and Transformations. - Françoise Bellegarde; James Hook (TAPSOFT, 1993)

Software design for reliability and reuse: a proof-of-concept demonstration. - 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 (TRI-Ada, 1994)

Substitution: A Formal Methods Case Study Using Monads and Transformations. - Françoise Bellegarde; James Hook (Sci. Comput. Program., 1994)

ASTRE: Towards a Fully Automated Program Transformation System. - Françoise Bellegarde (RTA, 1995)

Calculating Software Generators from Solution Specifications. - Richard B. Kieburtz; Françoise Bellegarde; Jeffrey M. Bell; James Hook; Jeffrey Lewis; Dino Oliva; Tim Sheard; Lisa Walton; Tong Zhou (TAPSOFT, 1995)

Type-Driven Defunctionalization. - Jeffrey M. Bell; Françoise Bellegarde; James Hook (ICFP, 1997)

Ready-Simulation Is Not Ready to Express a Modular Refinement Relation. - Françoise Bellegarde; Jacques Julliand; Olga Kouchnarenko (FASE, 2000)

Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants. - Françoise Bellegarde; Christophe Darlot; Jacques Julliand; Olga Kouchnarenko (ZB, 2000)

Reformulation: A Way to Combine Dynamic Properties and B Refinement. - Françoise Bellegarde; Christophe Darlot; Jacques Julliand; Olga Kouchnarenko (FME, 2001)

Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions. - Françoise Bellegarde; Samir Chouali; Jacques Julliand (ZB, 2002)

Synchronized Parallel Composition of Event Systems in B. - Françoise Bellegarde; Jacques Julliand; Olga Kouchnarenko (ZB, 2002)

Raffiner pour vérifier des systèmes paramétrés. - Françoise Bellegarde; Celina Charlet; Olga Kouchnarenko (Tech. Sci. Informatiques, 2002)

How to Compute the Refinement Relation for Parameterized Systems. - Françoise Bellegarde; Celina Charlet; Olga Kouchnarenko (MEMOCODE, 2003)

Refinemant verification of fair transition systems can contribute to PLTL model checking. - Françoise Bellegarde; Samir Chouali; Jacques Julliand (MEMOCODE, 2005)

On the Contribution of a tau. - Françoise Bellegarde; Jacques Julliand; Hassan Mountassir; Emilie Oudot (FACS, 2005)

PLTL-partitioned model checking for reactive systems under fairness assumptions. - Samir Chouali; Jacques Julliand; Pierre-Alain Masson; Françoise Bellegarde (ACM Trans. Embed. Comput. Syst., 2005)

Experiments in the use of τ-simulations for the components-verification of real-time systems. - Françoise Bellegarde; Jacques Julliand; Hassan Mountassir; Emilie Oudot (SAVCBS@FSE, 2006)