Françoise Bellegarde

According to our database1, Françoise Bellegarde authored at least 25 papers between 1984 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2006
Experiments in the use of τ-simulations for the components-verification of real-time systems.
Proceedings of the 2006 Conference on Specification and Verification of Component-Based Systems, 2006

2005
PLTL-partitioned model checking for reactive systems under fairness assumptions.
ACM Trans. Embed. Comput. Syst., 2005

On the Contribution of a tau.
Proceedings of the International Workshop on Formal Aspects of Component Software, 2005

Refinemant verification of fair transition systems can contribute to PLTL model checking.
Proceedings of the 3rd ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2005), 2005

2003
How to Compute the Refinement Relation for Parameterized Systems.
Proceedings of the 1st ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2003), 2003

2002
Raffiner pour vérifier des systèmes paramétrés.
Tech. Sci. Informatiques, 2002

Synchronized Parallel Composition of Event Systems in B.
Proceedings of the ZB 2002: Formal Specification and Development in Z and B, 2002

Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions.
Proceedings of the ZB 2002: Formal Specification and Development in Z and B, 2002

2001
Reformulation: A Way to Combine Dynamic Properties and B Refinement.
Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

2000
Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants.
Proceedings of the ZB 2000: Formal Specification and Development in Z and B, First International Conference of B and Z Users, York, UK, August 29, 2000

Ready-Simulation Is Not Ready to Express a Modular Refinement Relation.
Proceedings of the Fundamental Approaches to Software Engineering, 2000

1997
Type-Driven Defunctionalization.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

1995
Calculating Software Generators from Solution Specifications.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

ASTRE: Towards a Fully Automated Program Transformation System.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1994
Substitution: A Formal Methods Case Study Using Monads and Transformations.
Sci. Comput. Program., 1994

Software design for reliability and reuse: a proof-of-concept demonstration.
Proceedings of the 1994 Conference on TRI-Ada 1994, 1994

1993
Monads, Indexes and Transformations.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

A Transformation System Combining Partial Evaluation with Term Rewriting.
Proceedings of the Higher-Order Algebra, 1993

1991
Program Transformation and Rewriting.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Termination by Completion.
Appl. Algebra Eng. Commun. Comput., 1990

A Matching Process Modulo a Theory of Categorical Products.
Proceedings of the Algebraic and Logic Programming, 1990

1987
Transformation Ordering.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
Rewriting Systems on FP Expressions to Reduce the Number of Sequences Yielded.
Sci. Comput. Program., 1986

1985
Convergent term rewriting systems can be used for program transformation.
Proceedings of the Programs as Data Objects, 1985

1984
Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield.
Proceedings of the 1984 ACM Conference on LISP and Functional Programming, 1984


  Loading...