BibTeX
@MISC{Barrett13witnessruns,
author = {Clark Barrett and Stéphane Demri and Morgan Deters},
title = {Witness Runs for Counter Machines},
year = {2013}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we present recent results about the verification of counter machines by using decision procedures for Presburger arithmetic. We recall several known classes of counter machines for which the reachability sets are Presburger-definable as well as temporal logics with arithmetical constraints. We discuss issues related to flat counter machines, path schema enumeration, and the use of SMT solvers.
