See this document in CiteSeerX!

Abstraction as the Key for Invariant Verification  (Make Corrections)  
Saddek Bensalem, Susanne Graf, Yassine Lakhnech



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
verimag.imag.fr/~g...mGrafLakhnech03.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  verimag.imag.fr/~g...biblioabstr (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a methodology for constructing abstractions and refining them by analyzing counter-examples. We also present a uniform verification method that combines abstraction, model-checking and deductive verification. In particular, it shows how to use the abstract system in a deductive proof even when the abstract model does not satisfy the specification and when it simulates the concrete system with respect to a weaker notion of simulation than Milner's. (Update)

Similar documents (at the sentence level):
9.1%:   Computing Abstractions of Infinite State Systems.. - Bensalem, Lakhnech, Owre (1998)   (Correct)
6.7%:   Incremental Verification by Abstraction - Lakhnech, Bensalem, Berezin, Owre (2001)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Construction of abstract state graphs with PVS - Graf, Saidi (1997)   (Correct)
0.5:   Construction of state graphs of infinite systems with PVS - Graf, Saidi   (Correct)
0.5:   Verifying Universal Properties of Parameterized Networks - Baukus, Lakhnech, Stahl (2000)   (Correct)

Similar documents based on text:   More   All
0.8:   Abstracting WS1S Systems to Verify Parameterized Networks - Baukus, Bensalem.. (2000)   (Correct)
0.4:   Verification of Infinite-State Systems by.. - Abdulla..   (Correct)
0.4:   InVeSt: A Tool for the Verification of Invariants - Bensalem, Lakhnech, Owre (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ bensalem-abstraction,
  author = "Saddek Bensalem and Susanne Graf and Yassine Lakhnech",
  title = "Abstraction as the Key for Invariant Verification",
  url = "citeseer.ist.psu.edu/592152.html" }
Citations (may not include all citations):
1180   The temporal Logic of reactive and concurrent systems (context) - Manna, Pnueli - 1995  ACM
815   Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
502   Concurrency and automata on infinite sequences (context) - Park - 1981  ACM   DBLP
312   Systematic design of program analysis framework (context) - Cousot, Cousot - 1979
270   Bandera: Extracting finitestate models from java source code - Corbett, Dwyer et al. - 2000
267   Computer-Aided Verification of Coordinating processes (context) - Kurshan - 1994  ACM
200   Construction of abstract state graphs with pvs - Graf, Saidi - 1997  ACM   DBLP
155   ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
106   An algebraic definition of simulation between programs (context) - Milner - 1971
96   Property preserving abstractions for the verification of con.. - Loiseaux, Graf et al. - 1995  ACM   DBLP
94   Counterexampleguided abstraction refinement - Clarke, Grumberg et al. - 2000
92   Experiments in theorem proving and model checking for protoc.. - Havelund, Shankar - 1996  ACM   DBLP
78   Experience with predicate abstraction - Das, Dill et al.
75   Verification of linear hybrid systems by means of convex app.. - Halbwachs, Proy et al. - 1994  DBLP
75   Analysis of discrete event coordination (context) - Kurshan - 1989  ACM   DBLP
65   Computing simulations on finite and infinite graphs - Henzinger, Henzinger et al. - 1995  ACM   DBLP
60   Property preserving simulations (context) - Bouajjani, Bensalem et al. - 1992  ACM   DBLP
58   Online minimization of transition systems (context) - Lee, Yannakakis - 1992
55   Minimal model generation (context) - Bouajjani, Cl et al. - 1990  ACM   DBLP
49   ACM Transactions in Programming Languages and Systems (context) - Dams, Gerth et al. - 1997
47   Abstract interpretation and partition refinement for model c.. (context) - Dams - 1996
47   Generation of reduced models for checking fragments of CTL (context) - Dams, Grumberg et al. - 1993  ACM   DBLP
46   Modal specifications (context) - Larsen - 1989  ACM   DBLP
43   Syntactic program transformations for automatic abstraction - Namjoshi, Kurshan - 2000  ACM   DBLP
42   An iterative approach to language containment (context) - Balarin, Sangivanni-Vincentelli - 1993
40   A tool for symbolic program verification and abstraction - Graf, Loiseaux - 1993
39   Model checking for infinite state systems using data abstrac.. - Dingel, Filkorn - 1995
33   Verification of a distributed cache memory by using abstract.. (context) - Graf - 1994  ACM   DBLP
31   Handling Global Conditions in Parameterized System Verificat.. - Abdulla, Bouajjani et al. - 1999  ACM   DBLP
31   Deductive model checking - Sipma, Uribe et al. - 1996  ACM   DBLP
31   A calculus of communication systems (context) - Milner - 1980
26   Generating finite-state abstractions of reactive systems usi.. - Colon, Uribe - 1998
25   Abstracting WS1S Systems to Verify Parameterized Networks - Baukus, Bensalem et al. - 2000  ACM   DBLP
24   Invest: A tool for the verification of invariants - Bensalem, Lakhnech et al. - 1998  DBLP
16   proof checking and model-checking (context) - Owre, Rushby et al.
15   Automatic generation of invariants (context) - Bensalem, Lakhnech - 1999
15   Automatic generation of invariants (context) - Bensalem, Lakhnech et al. - 1996
13   Characterization of a sequentially consistent memory and ver.. - Graf - 1995  DBLP
13   Model checking for extended timed temporal logics - Bouajjani, Lakhnech et al. - 1996
12   Automatic generation of invariants and intermediate assertio.. (context) - Bjrner, Browne et al. - 1997  ACM   DBLP
12   Program verification using compositional abstraction (context) - Graf, Loiseaux - 1993
12   Incremental verification by abstraction - Lakhnech, Bensalem et al. - 2001  ACM   DBLP
11   Dynamic partitioning in analyses of numericalproperties - Jeannet, Halbwachs et al. - 1999
9   Automatic generation of invariants (context) - Su, Dill et al. - 1996  ACM   DBLP
9   Verification of parameterized programs - Manna, Pnueli - 1995
5   Staging static analyses using abstraction-based program spec.. - Hatcliff, Dwyer et al. - 1998  ACM   DBLP
5   Automatic verification of parameterized networks of processe.. - Lesens, idi - 1997
5   Computing abstractions of infinite state systems automatical.. (context) - Bensalem, Lakhnech et al. - 1998
4   Combining model checking and deduction for I/O-automata (context) - Muller, Nipkow - 1995  ACM   DBLP
2   Mathematical Theory of Program Cortrectness (context) - de Bakker - 1980
1   A constraint oriented proof methodology (context) - Larsen, Steffen et al. - 1995
1   Analyzing fair parametric extended automata - Annichini, Bouajjani et al. - 2001  ACM   DBLP
1   Verification of parameterized networks (context) - Baukus, Lakhnech et al. - 2001
1   Constructing program invariance proof methods (context) - Cousot, Cousot - 1980

Documents on the same site (http://www-verimag.imag.fr/~graf/biblio-abstr.html):   More
Characterization of a Sequentially Consistent Memory and.. - Graf (1995)   (Correct)
Verifying Invariants Using Theorem Proving - Graf, Saidi (1996)   (Correct)
Safety for Branching Time Semantics - Bouajjani, Fernandez, Graf.. (1991)   (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