Sciweavers

1018 search results - page 10 / 204
» Abstraction and Refinement in Model Checking
Sort
View
DAC
2004
ACM
14 years 8 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
ICSE
1999
IEEE-ACM
13 years 11 months ago
A Practical Method for Verifying Event-Driven Software
Formal verification methods are used only sparingly in software development. The most successful methods to date are based on the use of model checking tools. To use such he user ...
Gerard J. Holzmann, Margaret H. Smith
IJCIS
2006
75views more  IJCIS 2006»
13 years 7 months ago
Model-Driven Design, Refinement and Transformation of Abstract Interactions
João Paulo A. Almeida, Remco M. Dijkman, Lu...