9 citations · 16 across the 4 of their papers we have counts for
4 papers
PTIME Computation of Transitive Closures of Octagonal Relations
Filip Konecny
Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we study difference bounds and octagonal relations a…
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…
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…
Underapproximation of Procedure Summaries for Integer Programs
Pierre Ganty, Radu Iosif, Filip Konecny
We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approac…