rusu01

V. Rusu. Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols. Research Report INRIA, No 4100, 2001.

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

We study a class of extended automata defined by guarded commands over Presburger arithmetic with uninterpreted functions. On the theoretical side, we show that the bounded reachability problem is decidable in this model. On the practical side, the class is useful for modeling programs with potentially infinite data structures, and the reachability procedure can be used for symbolic simulation, testing, and verification

Contact

Vlad Rusu http://www.irisa.fr/vertecs/Equipe/Rusu/vlad-rusu.html

BibTex Reference

@TechReport{rusu01,
   Author = {Rusu, V.},
   Title = {Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols},
   Number = {4100},
   Institution = {INRIA},
   Year = {2001}
}

EndNote Reference [help]

Get EndNote Reference (.ref)