default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançoise Bellegarde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c20]Françoise Bellegarde, Jacques Julliand, Hassan Mountassir, Emilie Oudot:
Experiments in the use of τ-simulations for the components-verification of real-time systems. SAVCBS@FSE 2006: 33-40- [i1]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) - 2005
- [j5]Samir Chouali, Jacques Julliand, Pierre-Alain Masson, Françoise Bellegarde:
PLTL-partitioned model checking for reactive systems under fairness assumptions. ACM Trans. Embed. Comput. Syst. 4(2): 267-301 (2005) - [c19]Françoise Bellegarde, Samir Chouali, Jacques Julliand:
Refinemant verification of fair transition systems can contribute to PLTL model checking. MEMOCODE 2005: 166-175 - [c18]Françoise Bellegarde, Jacques Julliand, Hassan Mountassir, Emilie Oudot:
On the Contribution of a tau. FACS 2005: 97-111 - 2003
- [c17]Françoise Bellegarde, Celina Charlet, Olga Kouchnarenko
:
How to Compute the Refinement Relation for Parameterized Systems. MEMOCODE 2003: 103-112 - 2002
- [j4]Françoise Bellegarde, Celina Charlet, Olga Kouchnarenko:
Raffiner pour vérifier des systèmes paramétrés. Tech. Sci. Informatiques 21(8): 1121-1149 (2002) - [c16]Françoise Bellegarde, Jacques Julliand, Olga Kouchnarenko:
Synchronized Parallel Composition of Event Systems in B. ZB 2002: 436-457 - [c15]Françoise Bellegarde, Samir Chouali, Jacques Julliand:
Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions. ZB 2002: 477-496 - 2001
- [c14]Françoise Bellegarde, Christophe Darlot, Jacques Julliand, Olga Kouchnarenko:
Reformulation: A Way to Combine Dynamic Properties and B Refinement. FME 2001: 2-19 - 2000
- [c13]Françoise Bellegarde, Jacques Julliand, Olga Kouchnarenko:
Ready-Simulation Is Not Ready to Express a Modular Refinement Relation. FASE 2000: 266-283 - [c12]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
1990 – 1999
- 1997
- [c11]Jeffrey M. Bell, Françoise Bellegarde, James Hook:
Type-Driven Defunctionalization. ICFP 1997: 25-37 - 1995
- [c10]Françoise Bellegarde:
ASTRE: Towards a Fully Automated Program Transformation System. RTA 1995: 403-407 - [c9]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
- [j3]Françoise Bellegarde, James Hook:
Substitution: A Formal Methods Case Study Using Monads and Transformations. Sci. Comput. Program. 23(2-3): 287-311 (1994) - [c8]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 - 1993
- [c7]Françoise Bellegarde:
A Transformation System Combining Partial Evaluation with Term Rewriting. HOA 1993: 40-55 - [c6]Françoise Bellegarde, James Hook:
Monads, Indexes and Transformations. TAPSOFT 1993: 314-327 - 1991
- [c5]Françoise Bellegarde:
Program Transformation and Rewriting. RTA 1991: 226-239 - 1990
- [j2]Françoise Bellegarde, Pierre Lescanne:
Termination by Completion. Appl. Algebra Eng. Commun. Comput. 1: 79-96 (1990) - [c4]Françoise Bellegarde:
A Matching Process Modulo a Theory of Categorical Products. ALP 1990: 270-282
1980 – 1989
- 1987
- [c3]Françoise Bellegarde, Pierre Lescanne:
Transformation Ordering. TAPSOFT, Vol.1 1987: 69-80 - 1986
- [j1]Françoise Bellegarde:
Rewriting Systems on FP Expressions to Reduce the Number of Sequences Yielded. Sci. Comput. Program. 6(1): 11-34 (1986) - 1985
- [c2]Françoise Bellegarde:
Convergent term rewriting systems can be used for program transformation. Programs as Data Objects 1985: 24-41 - 1984
- [c1]Françoise Bellegarde:
Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield. LISP and Functional Programming 1984: 63-73
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
