Susanne Graf, Hassen Saidi  Home/Search
Context
Related
| gaspard.imag.fr/PEO...GrafSaidi97.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: gaspard.imag.fr/PEOPL...bibliosg (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we propose a method for the automatic construction of an abstract state graph of an infinite state system using the Pvs theorem prover. Given a system and a partition of the state space induced by predicates ' 1 ; :::; ' ` on the program variables which defines an abstract state space, we construct an abstract state graph, starting in the abstract initial state. The possible successors of a state are computed using the Pvs theorem prover by verifying for each index i if ' i or... (Update)
Similar documents (at the sentence level):
36.5%: Construction of state graphs with PVS - Graf, Saidi (Correct)
Active bibliography (related documents): More All
1.2: Construction of abstract state graphs with PVS - Graf, Saidi (1997) (Correct)
0.5: Abstraction as the Key for Invariant Verification - Bensalem, Graf, Lakhnech (Correct)
0.3: An Overview of SAL - Bensalem, Ganesh, Lakhnech.. (2000) (Correct)
Similar documents based on text: More All
0.5: Automatic Verification of Parameterized Networks of.. - Lesens, Saïdi (1997) (Correct)
0.4: Abstraction of Parameterized Networks - Lesens, Saïdi (1997) (Correct)
0.2: The Invariant Checker: Automated Deductive Verification of.. - Saidi (1997) (Correct)
BibTeX entry: (Update)
@misc{ graf-construction,
author = "Susanne Graf and Hassen Saidi",
title = "Construction of state graphs of infinite systems with PVS",
url = "citeseer.ist.psu.edu/114197.html" }
Citations (may not include all citations):815 Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
267 Computer-Aided Verification of Coordinating processes (context) - Kurshan - 1994
195 Parallel Program Design (context) - Chandy, Misra - 1988
155 The tool KRONOS - Daws, Olivero et al. - 1996
155 ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
96 Property preserving abstractions for the verification of con.. - Loiseaux, Graf et al. - 1995
92 Experiments in theorem proving and model checking for protoc.. - Havelund, Shankar - 1996
75 Verification of linear hybrid systems by means of convex app.. - Halbwachs, Proy et al. - 1994
72 Hytech: the cornell hybrid technology tool - Henzinger, Ho - 1995
57 Proof-checking a data link protocol - Helmink, Sellink et al. - 1994
54 A bounded retransmission protocol for large data packets - Groote, Pol - 1993
47 Generation of reduced models for checking fragments of CTL (context) - Dams, Grumberg et al. - 1993
47 Abstract interpretation and partition refinement for model c.. (context) - Dams - 1996
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
30 Step: Deductive-algorithmic verification of reactive and rea.. (context) - Bjorner, Browne et al. - 1996
24 Invest : A tool for the verification of invariants - Bensalem, Lakhnech et al. - 1998
24 Verifying invariants using theorem proving - Graf, Saidi - 1996
19 A Tutorial on Specification and Verification using PVS - Shankar, Owre et al. - 1993
18 A unified approach for studying the properties of transition.. (context) - Sifakis - 1982
15 Automatic generation of invariants (context) - Bensalem, Lakhnech - 1998
14 What if model checking must be truly symbolic - Hungar, Grumberg et al. - 1995
13 Characterization of a sequentially consistent memory and ver.. - Graf - 1995
8 The invariant checker: automated deductive verification of r.. - Saidi - 1997
5 Computing abstractions of infinite state systems automatical.. (context) - Bensalem, Lakhnech et al. - 1998
3 Efficient symbolic model-checking for the full ¯- calculus u.. (context) - Kelb, Dams et al. - 1995
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