Sciweavers

201 search results - page 27 / 41
» Using a SAT solver to generate checking sequences
Sort
View
VMCAI
2005
Springer
14 years 1 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
2004
Springer
140views Education» more  CORR 2004»
13 years 7 months ago
Checking modes of HAL programs
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...
Maria J. García de la Banda, Warwick Harvey...
CAV
2004
Springer
123views Hardware» more  CAV 2004»
14 years 28 days ago
SAL 2
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and...
Leonardo Mendonça de Moura, Sam Owre, Haral...
IPCCC
2006
IEEE
14 years 1 months ago
Automatically deducing propagation sequences that circumvent a collaborative worm defense
We present an approach to the question of evaluating worm defenses against future, yet unseen and possibly defense-aware worm behavior. Our scheme employs model checking to produc...
Linda Briesemeister, Phillip A. Porras
ISSRE
2006
IEEE
14 years 1 months ago
A Systematic Approach to Generate Inputs to Test UML Design Models
Practical model validation techniques are needed for model driven development (MDD) techniques to succeed. This paper presents an approach to generating inputs to test UML design ...
Trung T. Dinh-Trong, Sudipto Ghosh, Robert B. Fran...