Sciweavers

493 search results - page 51 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
ERSHOV
2006
Springer
13 years 9 months ago
Well-Structured Model Checking of Multiagent Systems
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
Nikolay V. Shilov, Natalya Olegovna Garanina
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
14 years 1 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
PPOPP
2005
ACM
14 years 1 months ago
Scaling model checking of dataraces using dynamic information
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
Ohad Shacham, Mooly Sagiv, Assaf Schuster
HVC
2005
Springer
160views Hardware» more  HVC 2005»
14 years 1 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, ...
SEFM
2007
IEEE
14 years 2 months ago
Hardness for Explicit State Software Model Checking Benchmarks
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
Neha Rungta, Eric G. Mercer