9 citations · 36 across the 34 of their papers we have counts for
Showing 2013Show all
3 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…
cs.LO2013★ 4 cited
The Tree Width of Separation Logic with Recursive Definitions
Radu Iosif, Adam Rogalewicz, Jiri Simacek
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of…