Chapter

Correct Hardware Design and Verification Methods

Volume 2860 of the series Lecture Notes in Computer Science pp 348-362

Convergence Testing in Term-Level Bounded Model Checking

  • Randal E. BryantAffiliated withSchool of Computer Science & Electrical and Computer Engineering Department, Carnegie Mellon University
  • , Shuvendu K. LahiriAffiliated withSchool of Computer Science & Electrical and Computer Engineering Department, Carnegie Mellon University
  • , Sanjit A. SeshiaAffiliated withSchool of Computer Science & Electrical and Computer Engineering Department, Carnegie Mellon University

Abstract

We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an arbitrary system, it converges for many practical examples, including pipelined processors. We give a new formal definition of convergence that generalizes previously stated criteria. We also give a sound semi-decision procedure to check this criterion based on a translation to quantified separation logic. Preliminary results on simple pipeline processor models are presented.