Françoise Bellegarde - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2006

On the Contribution of a tauFrançoise Bellegarde, Jacques Julliand, Hassan Mountassir, Emilie Oudot. ENTCS, 160:97-111, 2006. [doi]

Experiments in the use of τ-simulations for the components-verification of real-time systemsFrançoise Bellegarde, Jacques Julliand, Hassan Mountassir, Emilie Oudot. FSE 2006: 33-40 [doi]

2005

Refinemant verification of fair transition systems can contribute to PLTL model checkingFrançoise Bellegarde, Samir Chouali, Jacques Julliand. memocode 2005: 166-175 [doi]

PLTL-partitioned model checking for reactive systems under fairness assumptionsSamir Chouali, Jacques Julliand, Pierre-Alain Masson, Françoise Bellegarde. tecs, 4(2):267-301, 2005. [doi]

2003

How to Compute the Refinement Relation for Parameterized SystemsFrançoise Bellegarde, Celina Charlet, Olga Kouchnarenko. memocode 2003: 103-112 [doi]

2002

Synchronized Parallel Composition of Event Systems in BFrançoise Bellegarde, Jacques Julliand, Olga Kouchnarenko. zum 2002: 436-457 [doi]

Raffiner pour vérifier des systèmes paramétrésFrançoise Bellegarde, Celina Charlet, Olga Kouchnarenko. tsi, 21(8):1121-1149, 2002. [doi]

Verification of Dynamic Constraints for B Event Systems under Fairness AssumptionsFrançoise Bellegarde, Samir Chouali, Jacques Julliand. zum 2002: 477-496 [doi]

2001

Reformulation: A Way to Combine Dynamic Properties and B RefinementFrançoise Bellegarde, Christophe Darlot, Jacques Julliand, Olga Kouchnarenko. FM 2001: 2-19 [doi]

2000

Ready-Simulation Is Not Ready to Express a Modular Refinement RelationFrançoise Bellegarde, Jacques Julliand, Olga Kouchnarenko. FASE 2000: 266-283 [doi]

Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop InvariantsFrançoise Bellegarde, Christophe Darlot, Jacques Julliand, Olga Kouchnarenko. zum 2000: 230-249 [doi]

1997

Type-Driven DefunctionalizationJeffrey M. Bell, Françoise Bellegarde, James Hook. ICFP 1997: 25-37

1995

ASTRE: Towards a Fully Automated Program Transformation SystemFrançoise Bellegarde. RTA 1995: 403-407

Calculating Software Generators from Solution SpecificationsRichard B. Kieburtz, Françoise Bellegarde, Jeffrey M. Bell, James Hook, Jeffrey Lewis, Dino Oliva, Tim Sheard, Lisa Walton, Tong Zhou. tapsoft 1995: 546-560

1994

Software design for reliability and reuse: a proof-of-concept demonstrationJeffrey 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. sigada 1994: 396-404 [doi]

Substitution: A Formal Methods Case Study Using Monads and TransformationsFrançoise Bellegarde, James Hook. SCP, 23(2-3):287-311, 1994.

1993

Monads, Indexes and TransformationsFrançoise Bellegarde, James Hook. tapsoft 1993: 314-327

A Transformation System Combining Partial Evaluation with Term RewritingFrançoise Bellegarde. hoa 1994: 40-55

1991

Program Transformation and RewritingFrançoise Bellegarde. RTA 1991: 226-239

1990

A Matching Process Modulo a Theory of Categorical ProductsFrançoise Bellegarde. icalp 1990: 270-282

Termination by CompletionFrançoise Bellegarde, Pierre Lescanne. aaecc, 1:79-96, 1990.

1987

Transformation OrderingFrançoise Bellegarde, Pierre Lescanne. tapsoft 1987: 69-80

1986

Rewriting Systems on FP Expressions to Reduce the Number of Sequences YieldedFrançoise Bellegarde. SCP, 6(1):11-34, 1986.

1985

Convergent term rewriting systems can be used for program transformationFrançoise Bellegarde. pdo 1986: 24-41

1984

Rewriting Systems on FP Expressions that Reduce the Number of Sequences They YieldFrançoise Bellegarde. lfp 1984: 63-73

Sign in or sign up to see more results.

runs on WebDSL