CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Temporal Induction by Incremental SAT Solving

Niklas Een (Institutionen för datavetenskap) ; Niklas Sörensson
Electronical Notes in Theoretical Computer Science (1571-0661). Vol. 89 (2003), 4, p. 543-560.
[Artikel, refereegranskad vetenskaplig]

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

Denna post skapades 2008-09-24. Senast ändrad 2013-03-13.
CPL Pubid: 74330


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap (2002-2004)
Institutionen för data- och informationsteknik, datavetenskap (GU) (GU)


Datavetenskap (datalogi)

Chalmers infrastruktur