9 citations · 16 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops
Marius Bozga, Radu Iosif, Filip Konecny
This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling t…
cs.LO2013★ 9 cited
Deciding Conditional Termination
Radu Iosif, Filip Konecny, Marius Bozga
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dua…