CAV
2000
Springer
13 years 8 months ago
2000
Springer
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...
CAV
2000
Springer
13 years 8 months ago
2000
Springer
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
CAV
2000
Springer
13 years 8 months ago
2000
Springer
CAV
2000
Springer
13 years 8 months ago
2000
Springer
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...
CAV
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
CAV
2000
Springer
13 years 8 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
CAV
2000
Springer
13 years 8 months ago
2000
Springer
CAV
2000
Springer
13 years 8 months ago
2000
Springer
CAV
2000
Springer
13 years 8 months ago
2000
Springer
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
CAV
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...