85 citations · 262 across the 21 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.PL2012★ 7 cited
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…
cs.FL2012★ 22 cited
A Perfect Model for Bounded Verification
Javier Esparza, Pierre Ganty, Rupak Majumdar
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic…