V. Rusu. Verifying that Invariants are Context-Inductive. In Theorem Proving in Higher-Order Logics (TPHOLs'01),, Category B paper, University of Edinburgh research Report EDI-INF-RR-0046, Pages 337-351, 2001.
Download paper:
Gziped Postscript
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 study the deductive verification of infinite-state systems modeled by extended automata. Typically, this process requires proving many invariants, and automatically discharging these proof obligations would save the user a significant amount of effort. To accomplish this we present techniques for automatically verifying that invariants are inductive in a given context, and identify a class of systems and a logic for expressing invariants and contexts for which the problem is decidable
Vlad Rusu http://www.irisa.fr/vertecs/Equipe/Rusu/vlad-rusu.html
@InProceedings{r01a,
Author = {Rusu, V.},
Title = {Verifying that Invariants are Context-Inductive},
BookTitle = {Theorem Proving in Higher-Order Logics (TPHOLs'01),, Category B paper, University of Edinburgh research Report EDI-INF-RR-0046},
Pages = {337--351},
Year = {2001}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |