Skip to Main content Skip to Navigation
Conference papers

Construction of Abstract State Graphs with PVS

Abstract : In this paper, we propose a method for the automatic construction of an abstract state graph of an arbitrary system using the Pvs theorem prover. Given a parallel composition of sequential processes and a partition of the state space induced by predicates ϕ1, ..., g4 l 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 ¬ϕi is a postcondition of it. This allows an abstract state space exploration for arbitrary programs.
Complete list of metadata
Contributor : Susanne Graf Connect in order to contact the contributor
Submitted on : Tuesday, January 8, 2019 - 4:10:49 PM
Last modification on : Tuesday, October 19, 2021 - 1:48:11 PM


  • HAL Id : hal-01974178, version 1



Susanne Graf, Hassen Saidi. Construction of Abstract State Graphs with PVS. Computer Aided Verification, Jun 1997, Haifa, Israel. pp.72--83. ⟨hal-01974178⟩



Record views