9 citations · 11 across the 2 of their papers we have counts for
Showing cs.SEShow all
2 papers · 1 filter
cs.SE2015★ 9 cited
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…
cs.SE2015★ 2 cited
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…