9 citations · 16 across the 4 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2014
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…
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…