F. Bellegarde

Most-cited papers

Type-driven defunctionalization
J. Bell, F. Bellegarde, J. Hook
1997ACM SIGPLAN International Conference on Functional Programming64 citations Open access
Semantic Scholar
Substitution: A Formal Methods Case Study Using Monads and Transformations
F. Bellegarde, J. Hook
1994Science of Computer Programming56 citations Open access
Semantic Scholar
Software design for reliability and reuse: a proof-of-concept demonstration
J. Bell, F. Bellegarde, J. Hook, R. Kieburtz +8 more
1994TRI-Ada49 citations Open access
Semantic Scholar
Transformation Ordering
F. Bellegarde, P. Lescanne
1987TAPSOFT, Vol.148 citations Open access
Semantic Scholar
Ready-Simulation Is Not Ready to Express a Modular Refinement Relation
F. Bellegarde, J. Julliand, O. Kouchnarenko
2000Fundamental Approaches to Software Engineering36 citations
Semantic Scholar
Rewriting systems on FP expressions that reduce the number of sequences they yield
F. Bellegarde
1984LFP '8428 citations Open access
Semantic Scholar
Program Transformation and Rewriting
F. Bellegarde
1991International Conference on Rewriting Techniques and Applications22 citations
Semantic Scholar
Calculating Software Generators from Solution Specifications
R. Kieburtz, F. Bellegarde, J. Bell, J. Hook +5 more
1995Theory and Practice of Software Development21 citations
Semantic Scholar
Rewriting Systems on FP Expressions to Reduce the Number of Sequences Yielded
F. Bellegarde
1986Science of Computer Programming19 citations Open access
Semantic Scholar
Synchronized Parallel Composition of Event Systems in B
F. Bellegarde, J. Julliand, O. Kouchnarenko
2002ZB17 citations
Semantic Scholar
Reformulation: A Way to Combine Dynamic Properties and B Refinement
F. Bellegarde, Christophe Darlot, J. Julliand, O. Kouchnarenko
2001FME17 citations
Semantic Scholar
Termination by completion
F. Bellegarde, P. Lescanne
1990Applicable Algebra in Engineering, Communication and Computing16 citations
Semantic Scholar
Verification of Liveness Properties with JML
F. Bellegarde, J. Groslambert, M. Huisman, J. Julliand +1 more
200413 citations
Semantic Scholar
Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions
F. Bellegarde, Samir Chouali, J. Julliand
2002ZB13 citations
Semantic Scholar
Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants
F. Bellegarde, Christophe Darlot, J. Julliand, O. Kouchnarenko
2000ZB13 citations
Semantic Scholar
ASTRE: Towards a Fully Automated Program Transformation System
F. Bellegarde
1995International Conference on Rewriting Techniques and Applications12 citations
Semantic Scholar
On the Contribution of a τ-simulation in the Incremental Modeling of Timed Systems
F. Bellegarde, J. Julliand, H. Mountassir, Emilie Oudot
20069 citations Open access
Semantic Scholar
PLTL-partitioned model checking for reactive systems under fairness assumptions
Samir Chouali, J. Julliand, P. Masson, F. Bellegarde
2005TECS9 citations Open access
Semantic Scholar
A Transformation System Combining Partial Evaluation with Term Rewriting
F. Bellegarde
1993Higher-Order Algebra, Logic and Term Rewriting9 citations
Semantic Scholar
Automating Synthesis by Completion
F. Bellegarde
19945 citations
Semantic Scholar
Convergent term rewriting systems can be used for program transformation
F. Bellegarde
1985Programs as Data Objects5 citations
Semantic Scholar
Experiments in the use of τ-simulations for the components-verification of real-time systems
F. Bellegarde, J. Julliand, H. Mountassir, Emilie Oudot
2006SAVCBS '064 citations
Semantic Scholar
Using Acceleration to Compute Parameterized System Refinement
F. Bellegarde, Celina Charlet, O. Kouchnarenko
20034 citations
Semantic Scholar
Raffiner pour vérifier des systèmes paramétrés
F. Bellegarde, Celina Charlet, Olga Kouchnarenko
2002Techniques et sciences informatiques4 citations
Semantic Scholar
Termination Issues in Automated Syntheses
F. Bellegarde
19943 citations
Semantic Scholar
How to compute the refinement relation for parameterized systems
F. Bellegarde, Celina Charlet, O. Kouchnarenko
2003First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.2 citations
Semantic Scholar
Notes for pipelines of transformations for ML
F. Bellegarde
19952 citations
Semantic Scholar
Monads, Indexes and Transformations
F. Bellegarde, J. Hook
1993Theory and Practice of Software Development2 citations
Semantic Scholar
Induction and Synthesis for Automatic Program Transformation
F. Bellegarde
19941 citations
Semantic Scholar
Experiments in the use of tau-simulations for the components-verification of real-time systems
F. Bellegarde, J. Julliand, H. Mountassir, Emilie Oudot
20180 citations
Semantic Scholar
ASTRE : a transformation system using completion
F. Bellegarde
20170 citations
Semantic Scholar
Refinemant verification of fair transition systems can contribute to PLTL model checking
F. Bellegarde, Samir Chouali, J. Julliand
2005Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.0 citations
Semantic Scholar
On the Contribution of a tau
F. Bellegarde, J. Julliand, H. Mountassir, Emilie Oudot
2005International Workshop on Formal Aspects of Component Software0 citations Open access
Semantic Scholar
Combining approaches for the security of infinite state systems
M. Rusinowitch, F. Bellegarde, S. Drouot, A. Prévost +29 more
20050 citations
Semantic Scholar
New Results - Reachability analysis
Jean-François Couchot, D. Déharbe, Alain Giorgetti, S. Ranise +14 more
20030 citations
Semantic Scholar
Notes for pipelines of transformations for MLF
F. Bellegarde
19950 citations
Semantic Scholar
Automatic Trasformation by Rewriting Techniques
F. Bellegarde
19940 citations
Semantic Scholar
A Matching Process Modulo a Theory of Categorical Products
F. Bellegarde
1990International Conference on Algebraic and Logic Programming0 citations
Semantic Scholar