Sciweavers

115 search results - page 2 / 23
» A Compact Linear Translation for Bounded Model Checking
Sort
View
ENTCS
2007
141views more  ENTCS 2007»
13 years 5 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere
VMCAI
2005
Springer
13 years 11 months ago
Optimizing Bounded Model Checking for Linear Hybrid Systems
Bounded model checking (BMC) is an automatic verification method that is based on a finite unfolding of the system’s transition relation. BMC has been successfully applied, in ...
Erika Ábrahám, Bernd Becker, Felix K...
CORR
2006
Springer
124views Education» more  CORR 2006»
13 years 5 months ago
Linear Encodings of Bounded LTL Model Checking
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Ti...