Abstraction Refinement for Trace Inclusion of Infinite State Systems

21 Oct 2015 Iosif Radu Rogalewicz Adam Vojnar Tomas

A \emph{data automaton} is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automaton is an alternating sequence of alphabet symbols and values taken by the counters during an execution of the automaton... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE
  • FORMAL LANGUAGES AND AUTOMATA THEORY

Datasets


  Add Datasets introduced or used in this paper