Sciweavers

CAV
2000
Springer
187views Hardware» more  CAV 2000»
15 years 7 months ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
130
Voted
CAV
2000
Springer
138views Hardware» more  CAV 2000»
15 years 7 months ago
Counterexample-Guided Abstraction Refinement
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan ...
109
Voted
CAV
2000
Springer
108views Hardware» more  CAV 2000»
15 years 7 months ago
Boolean Satisfiability with Transitivity Constraints
Randal E. Bryant, Miroslav N. Velev
139
Voted
CAV
2000
Springer
125views Hardware» more  CAV 2000»
15 years 7 months ago
Efficient Reachability Analysis of Hierarchical Reactive Machines
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
Rajeev Alur, Radu Grosu, Michael McDougall
CASES
2000
ACM
15 years 7 months ago
Flexible instruction processors
This paper introduces the notion of a Flexible Instruction Processor (FIP) for systematic customisation of instruction processor design and implementation. The features of our app...
Shay Ping Seng, Wayne Luk, Peter Y. K. Cheung