Name
Abstract | ||
|---|---|---|
Symbolic trajectory evaluation (STE) is a model checking technology based on symbolic simulation over a lattice of abstract state sets. The STE algorithm operates over families of these abstractions encoded by Boolean formulas, enabling verification with many different abstraction cases in a single modelchecking run. This provides a flexible way to achieve partitioned data abstraction. It is usually called "symbolic indexing' and is widely used in memory verification, but has seen relatively limited adoption elsewhere, primarily because users typically have to create the right indexed family of abstractions manually. This work provides the first known algorithm that automatically computes these partitioned abstractions given a reference-model specification. Our experimental results show that this approach not only simplifies memory verification, but also enables handling completely different designs fully automatically. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/FMCAD.2007.10 | FMCAD |
Keywords | Field | DocType |
lattices,design automation,symbolic trajectory evaluation,boolean functions,encoding,indexing,data structures,computational modeling,reference model,indexation,model checking | Boolean function,Symbolic simulation,Data structure,Programming language,Model checking,Computer science,Indexed family,Search engine indexing,Theoretical computer science,Symbolic trajectory evaluation,Encoding (memory) | Conference |
ISBN | Citations | PageRank |
0-7695-3023-0 | 8 | 0.67 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sara Adams | 1 | 13 | 1.13 |
| Magnus Björk | 2 | 8 | 1.01 |
| Thomas F. Melham | 3 | 384 | 35.63 |
| Carl-Johan H. Seger | 4 | 750 | 90.27 |