Temporal Induction by Incremental SAT Solving
Artikel i vetenskaplig tidskrift, 2003

We show how a very modest modification to a typical modern SAT-solver enables it to solve a series of related SAT-instances efficiently. We apply this idea to checking safety properties by means of temporal induction, a technique strongly related to bounded model checking. We further give a more efficient way of constraining the extended induction hypothesis to so called loop-free paths. We have also performed the first comprehensive experimental evaluation of induction methods for safety-checking.

Författare

Niklas Een

Chalmers, Institutionen för datavetenskap

Niklas Sörensson

Göteborgs universitet

Electronic Notes in Theoretical Computer Science

1571-0661 (ISSN)

Vol. 89 4 543-560

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1016/S1571-0661(05)82542-3