Temporal Induction by Incremental SAT Solving

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.

BMC'2003, First International Workshop on Bounded Model Checking, Boulder, 13 July 2003

Länka till denna publikation

Dela på webben

Skapa referens, olika format (klipp och klistra)

BibTeX @article{Een2003,author={Een, Niklas and Sörensson, Niklas},title={Temporal Induction by Incremental SAT Solving},journal={Electronical Notes in Theoretical Computer Science},issn={1571-0661},volume={89},issue={4},pages={543-560},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.},year={2003},}

RefWorks RT Journal ArticleSR ElectronicID 74330A1 Een, NiklasA1 Sörensson, NiklasT1 Temporal Induction by Incremental SAT SolvingYR 2003JF Electronical Notes in Theoretical Computer ScienceSN 1571-0661VO 89IS 4SP 543OP 560AB 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.LA engDO 10.1016/S1571-0661(05)82542-3LK http://dx.doi.org/10.1016/S1571-0661(05)82542-3OL 30