Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4100.pdf (263.2 Ko) Télécharger le fichier

Dates and versions

inria-00072531 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072531 , version 1

Cite

Vlad Rusu. Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols. [Research Report] RR-4100, INRIA. 2001. ⟨inria-00072531⟩
45 View
182 Download

Share

Gmail Facebook Twitter LinkedIn More