(Enter summary)
Abstract: We give the description of a verification tool taking boolean programs of guarded commands
as input; internal representation of programs are sets of Binary Decision Diagrams
(BDD) (one for each guarded command). It allows to construct an abstract program of the
same form obtained using an abstraction relation given by a boolean expression on "concrete"
and "abstract" variables. The tool allows the verification of CTL formulas on programs. We
illustrate its possibilities on an example.
1... (Update)
Context of citations to this paper: More
...and each state can be mapped back to the progenitor by reverse execution of the reversible rules. Compared to conventional abstraction [7], our method does not require the user to provide a suitable abstract domain and does not produce false negative results as one often found...
...by a predicate on C[A, where A are the variables defining the abstract domain. The basic idea underlying the methods of [CGL94,GL93b,DGG93,Dam96] for computing abstractions of finite state systems is based on abstract interpretation of individual operators or individual...
Cited by: More
From Discrete Duration Calculus to Symbolic Automata - Gonnord, Halbwachs, Raymond (2004)
(Correct)
Pattern and Approximate-Pattern Matching for Program Compaction - Johnson, Mycroft
(Correct)
A Verification Environment for I/O Automata - Müller (1998)
(Correct)
Active bibliography (related documents): More All
0.8: Property Preserving Abstractions for the Verification of.. - Loiseaux, Graf, al. (1995)
(Correct)
0.3: Verifying Systems with Replicated Components in Murφ - Ip, Dill (1997)
(Correct)
0.2: Program Verification Using Abstraction Compositionally - Graf, Loiseaux (1993)
(Correct)
Similar documents based on text: More All
0.2: Construction of abstract state graphs with PVS - Graf, Saidi (1997)
(Correct)
0.2: Verification Experiments on the MASCARA Protocol - Jia, Graf (2001)
(Correct)
0.2: Characterization of a Sequentially Consistent Memory and.. - Graf (1995)
(Correct)
Related documents from co-citation: More All
18: Model Checking and Abstraction
- Clarke, Grumberg et al. - 1992
17: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
13: Property preserving abstractions for the verification of concurrent systems
- Loiseaux, Graf et al. - 1995
BibTeX entry: (Update)
S. Graf and C. Loiseaux. A tool for symbolic program verification and abstraction. 5th International Conference on Computer-Aided Verification, April 1993. http://citeseer.ist.psu.edu/graf93tool.html More
@inproceedings{ graf93tool,
author = "{S. Graf} and {C. Loiseaux}",
title = "{A} {T}ool for {S}ymbolic {P}rogram {V}erification and {A}bstraction",
booktitle = "{GI/{ITG}} Workshop Formale Methoden zum Entwurf korrekter Systeme",
publisher = "Universit{\"a}t Karlsruhe, Interner Bericht Nr. 10/93",
address = "Bad Herrenalb",
editor = "{T. Kropf} and {R. Kumar} and {D. Schmid}",
pages = "122--138",
year = "1993",
url = "citeseer.ist.psu.edu/graf93tool.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1984
1726
Graph based algorithms for boolean function manipulation
- Bryant - 1986
815
Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
407
Introduction to the ISO specification language LOTOS (context) - Bolognesi, Brinksma - 1988
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1992
195
Parallel Program Design (context) - Chandy, Misra - 1988
122
Application of temporal logic to specification and verificat.. (context) - Pnueli - 1986
106
An algebraic definition of simulation between programs (context) - Milner - 1971
75
Analysis of discrete event coordination (context) - Kurshan - 1989
60
Property preserving simulations (context) - Bouajjani, Bensalem et al. - 1992
55
Minimal model generation (context) - Bouajjani, Fernandez et al. - 1990
48
Generating bdds for symbolic model checking in ccs (context) - Enders, Filkorn et al. - 1991
42
Compilation and verification of Lotos specifications
- Garavel, Sifakis - 1990
40
Results on the propositional ¯-calculus (context) - Kozen - 1983
38
An implementation of an efficient algorithm for bisimulation..
- Fernandez - 1990
31
A calculus of communication systems (context) - Milner - 1980
31
Verification in X' esar of the sliding window protocol (context) - Richier, Rodriguez et al. - 1987
24
Symbolic bisimulation minimisation
- Bouali, DeSimone - 1992
24
Systems Research Center
- Lamport, logic et al. - 1991
15
Property preserving homomorphisms of transition systems (context) - Sifakis - 1983
12
Program verification using compositional abstraction (context) - Graf, Loiseaux - 1993
9
Specification and validation of a simple overtaking protocol.. (context) - Ernberg, Fredlund et al. - 1990
8
A Language for Specifying Protocols and other Coordinating P.. (context) - Katzelson, Kurshan - 1986
5
eme lesar. Thesis, Universit (context) - Ratel, r'ealisation et al. - 1992
3
A calculus for Synchrony and Asynchrony (context) - Milner - 1983
3
Property preserving abstractions for the verification of con.. (context) - Bouajjani, Bensalem et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://gaspard.imag.fr/PEOPLE/Susanne.Graf/biblio-sg.html): More
Safety for Branching Time Semantics - Bouajjani, Fernandez, Graf.. (1991)
(Correct)
An Algebra of Boolean Processes - Courcoubetis, Graf, Sifakis
(Correct)
Characterization of a Sequentially Consistent Memory and.. - Graf (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC