11 citations · 38 across the 7 of their papers we have counts for
3 papers · 1 filter
Program Analysis with Local Policy Iteration
George Karpenkov, David Monniaux, Philipp Wendler
We present a new algorithm for deriving numerical invariants that combines the precision of max-policy iteration with the flexibility and scalability of conventional Kleene iterati…
Combining k-Induction with Continuously-Refined Invariants
Dirk Beyer, Matthias Dangl, Philipp Wendler
Bounded model checking (BMC) is a well-known and successful technique for finding bugs in software. k-induction is an approach to extend BMC-based approaches from falsification to…
Domain-Type-Guided Refinement Selection Based on Sliced Path Prefixes
Dirk Beyer, Stefan Löwe, Philipp Wendler
Abstraction is a successful technique in software verification, and interpolation on infeasible error paths is a successful approach to automatically detect the right level of abst…