Download:
|
by Sergey Berezin, Edmund M. Clarke
http://www.dcc.ufmg.br/~scampos/english/../cursos/verificacao/download/compos.ps.gz
Add To MetaCart
Abstract:
Abstract. This is our abstract. And this is the Brayton's paper reference:
Citations
|
2410
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
217
|
Symbolic model checking for sequential circuit verification
– Burch, Clarke, et al.
- 1994
|
|
210
|
Model checking and modular verification
– Grumberg, Long
- 1991
|
|
152
|
Jean-Christophe Madre. Verification of Synchronous Sequential Machines Based on Symbolic Execution
– Coudert, Berthet
- 1989
|
|
146
|
Symbolic model checking with partitioned transition relations
– Burch, Clarke, et al.
- 1991
|
|
134
|
Proofs of networks of processes
– Misra, Chandy
- 1981
|
|
128
|
Implicit state enumeration of finite state machines using BDD’s
– Touati, Savoj, et al.
- 1990
|
|
87
|
Verification of the Futurebus+ cache coherence protocol
– Clarke, Grumberg, et al.
- 1995
|
|
44
|
Computing quantitative characteristics of finite-state real-time systems
– Campos, Clarke, et al.
- 1994
|
|
32
|
Verus: A tool for quantitative analysis of finitestate real-time systems
– Campos, Clarke, et al.
- 1995
|
|
30
|
Partial Model Checking (extended abstract
– Andersen
- 1995
|
|
26
|
Verifying the performance of the PCI local bus using symbolic techniques
– Campos, Clarke, et al.
- 1995
|
|
24
|
A Quantitative Approach to the Formal Verification of RealTime Systems
– Campos
- 1996
|
|
16
|
Compositional proof systems for model checking infinite state processes
– Dam
- 1995
|
|
13
|
Three efficient algorithms based on partition refinement
– Paige, Tarjan
- 1987
|
|
10
|
transition for global to modular temporal reasoning about programs
– Pnueli
- 1984
|
