Construction of Abstract State Graphs with PVS - Archive ouverte HAL Access content directly
Conference Papers Year : 1997

Construction of Abstract State Graphs with PVS

Susanne Graf
Hassen Saidi
  • Function : Author
  • PersonId : 1041331

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.
No file

Dates and versions

hal-01974178 , version 1 (08-01-2019)

Identifiers

  • HAL Id : hal-01974178 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More