V. Rusu, E. Zinovieva, D. Clarke. Verifying Invariants More Automatically. In Verification and Computatoiional Logic, VCL'02, 2002.
Download paper: (link)
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
We present an algorithm that, given a transition system S and a set of auxiliary invariants A already proved on S, checks if a predicate I is inductive on S in the context of the auxiliary invariants. The answer is either yes, in which case I is an invariant of S, or don't know. The algorithm accepts infinite-state systems with unbounded counters and parametric-size arrays, and predicates with quantifiers over unbounded domains. As an example we verify a component of an electronic purse system. By using our algorithm together with the PVS theorem prover the verification is more automatic than that performed using PVS alone
Vlad Rusu http://www.irisa.fr/vertecs/Equipe/Rusu/vlad-rusu.html
Elena Zinovieva http://www.irisa.fr/prive/lenaz
@InProceedings{rzc02,
Author = {Rusu, V. and Zinovieva, E. and Clarke, D.},
Title = {Verifying Invariants More Automatically},
BookTitle = {Verification and Computatoiional Logic, VCL'02},
Year = {2002}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |