DMCA
Construction of abstract state graphs with PVS (1997)
| Citations: | 742 - 10 self |
BibTeX
@INPROCEEDINGS{Graf97constructionof,
author = {Susanne Graf and Hassen Saidi},
title = {Construction of abstract state graphs with PVS},
booktitle = {},
year = {1997},
pages = {72--83},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonable price. We consider a particular set of abstract states: the set of the monomials on a set of state predicates ' 1 ; :::; ' ` . The successor of an abstract state m for a transition ø of the program is the least monomial satisfied by all successors via ø of concrete states satisfying m. This successor m 0 can be determined exactly if for each predicate ' i it can be determined if ' i or :' i is a postcondition of m for ø . In order to do this, we use the Pvs theorem prover [SOR93] and our Pvs-interface defined in [GS96]. If the tactic used for the proof of the verification conditions is not powerful enough, only an upper approximation of the abstract successor m is constructed. This a...
