Name
Abstract | ||
|---|---|---|
Symbolic trajectory evaluation (STE) is a model checking technique that has been successfully used to verify industrial designs. Existing implementations of STE, however, reason at the level of bits, allowing signals to take values in {0, 1, X}. This limits the amount of abstraction that can be achieved, and presents inherent limitations to scaling. The main contribution of this paper is to show how much more abstract lattices can be derived automatically from RTL descriptions, and how a model checker for the general theory of STE instantiated with such abstract lattices can be implemented in practice. This gives us the first practical word-level STE engine, called STEWord. Experiments on a set of designs similar to those used in industry show that STEWord scales better than word-level BMC and also bit-level STE. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-21668-3_8 | COMPUTER AIDED VERIFICATION, CAV 2015, PT II |
Field | DocType | Volume |
Abstraction,Model checking,Lattice (order),Computer science,Algorithm,Theoretical computer science,Implementation,Scaling,Symbolic trajectory evaluation | Journal | 9207 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
7 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Supratik Chakraborty | 1 | 300 | 29.51 |
| Zurab Khasidashvili | 2 | 307 | 25.40 |
| Carl-Johan H. Seger | 3 | 750 | 90.27 |
| Rajkumar Gajavelly | 4 | 2 | 0.71 |
| Tanmay Haldankar | 5 | 2 | 0.71 |
| Dinesh Chhatani | 6 | 2 | 0.71 |
| Rakesh Mistry | 7 | 14 | 1.22 |