Jard-Jeron-CAV91

C. Jard, T. Jéron. Bounded Memory Algorithms for Verification On the fly. In CAV'91: Symposium on Computer Aided Verification, Aalborg, Denmark, LNCS, Volume 575, Pages 192-202, June 1991.

Download [help]

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

Abstract

One of the main limitations of today's verification tools is the size of the memory needed to exhaustively build the state graphs of the programs. But for numerous properties, it is not necessary to explicitely build this graph and an exhaustive depth-first traversal is often sufficient. In order to avoid retraversing states, we must then store some already visited states in memory. But since the memory size is bounded, visited states must be randomly replaced. In most cases this depth-first traversal with replacement can push back the limits of verification tools

Contact

Thierry Jéron http://www.irisa.fr/prive/jeron

BibTex Reference

@InProceedings{Jard-Jeron-CAV91,
   Author = {Jard, C. and Jéron, T.},
   Title = {Bounded Memory Algorithms for Verification On the fly},
   BookTitle = {CAV'91: Symposium on Computer Aided Verification, Aalborg, Denmark},
   Volume = {575},
   Pages = {192--202},
   Series = {LNCS},
   Publisher = {Springer Verlag},
   Month = {June},
   Year = {1991}
}

EndNote Reference [help]

Get EndNote Reference (.ref)