Bounded model checking of infinite state systems

Abstract

Bounded model checking (BMC) is an attractive alternative to symbolic model checking, since it often allows a more efficient verification. The idea of BMC is to reduce the model checking problem to a satisfiability problem of the underlying base logic, so that sophisticated decision procedures can be utilized to check the resulting formula. We present a new… (More)
DOI: 10.1007/s10703-006-0019-9

5 Figures and Tables

Topics

  • Presentations referencing similar topics