Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

Download [help]

Download paper Gziped Postscript (.ps.gz)

Copyright noticeThis 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.

Abstract

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.

Contact

Vlad Rusu
Vlad.Rusu@irisa.fr

BibTex Reference

@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}
}

EndNote Reference [help]

Get EndNote Reference (.ref)