Sciweavers

171 search results - page 3 / 35
» Checking Safety Properties Using Induction and a SAT-Solver
Sort
View
SPIN
2007
Springer
14 years 10 days ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
DAC
2004
ACM
14 years 7 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 12 days 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
HVC
2005
Springer
160views Hardware» more  HVC 2005»
13 years 11 months ago
Simultaneous SAT-Based Model Checking of Safety Properties
We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
Zurab Khasidashvili, Alexander Nadel, Amit Palti, ...
DATE
2008
IEEE
122views Hardware» more  DATE 2008»
14 years 20 days ago
Simulation-Directed Invariant Mining for Software Verification
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
Xueqi Cheng, Michael S. Hsiao