Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking

Abstract

Interpolant-based model checking has been shown to be effective on large verification instances, as it efficiently combines automated abstraction and reachability fixed-point checks. On the other hand, methods based on variable quantification have proved their ability to remove free inputs, thus projecting the search space over state variables. In this… (More)
DOI: 10.1109/TCAD.2010.2041847

9 Figures and Tables

Topics

  • Presentations referencing similar topics