Work

Temporal Induction by Incremental SAT Solving

Year: 2003

Type: article

Abstract: 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.

Source: Electronic Notes in Theoretical Computer Science

DOI: 10.1016/s1571-0661(05)82542-3

Authors: Niklas Eén, Niklas Sörensson

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2046239089

FWCI: 15.4

Cites: 20

Cited by: 387

Related to: 10