Sciweavers

447 search results - page 5 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
ENTCS
2006
99views more  ENTCS 2006»
13 years 7 months ago
Termination Criteria for Bounded Model Checking: Extensions and Comparison
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
Mohammad Awedh, Fabio Somenzi
KBSE
2009
IEEE
14 years 2 months ago
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
Lucas Cordeiro, Bernd Fischer, João Marques...
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 7 months ago
Automatic Verification of Parametric Specifications with Complex Topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 1 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
CADE
2007
Springer
14 years 8 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez