Sciweavers

96 search results - page 5 / 20
» Three-valued logic in bounded model checking
Sort
View
ENTCS
2007
156views more  ENTCS 2007»
13 years 7 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
GLVLSI
2006
IEEE
95views VLSI» more  GLVLSI 2006»
14 years 1 months ago
Test generation using SAT-based bounded model checking for validation of pipelined processors
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
Heon-Mo Koo, Prabhat Mishra
CORR
2006
Springer
124views Education» more  CORR 2006»
13 years 7 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...
MFCS
2005
Springer
14 years 28 days ago
The Complexity of Model Checking Higher Order Fixpoint Logic
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Martin Lange, Rafal Somla
CSL
2006
Springer
13 years 7 months ago
Infinite State Model-Checking of Propositional Dynamic Logics
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
Stefan Göller, Markus Lohrey