Sciweavers

4 search results - page 1 / 1
» New Techniques for Efficient Verification with Implicitly Co...
Sort
View
DAC
1994
ACM
13 years 8 months ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill
FMICS
2008
Springer
13 years 6 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
DAC
1998
ACM
14 years 5 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 4 months ago
Sawja: Static Analysis Workshop for Java
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
Laurent Hubert, Nicolas Barré, Fréd&...