Paper Info
Title
Abstraction by Symbolic Indexing Transformations
Abstract
Symbolic indexing is a data abstraction technique that exploits the partially-ordered state space of symbolic trajectory evaluation (STE). Use of this technique has been somewhat limited in practice because of its complexity. We present logical machinery and efficient algorithms that provide a much simpler interface to symbolic indexing for the STE user. Our logical machinery also allows correctness assertions proved by symbolic indexing to be composed into larger properties, something previously not possible.
Year
DOI
Venue
2002
10.1007/3-540-36126-X_1
FMCAD
Keywords
Field
DocType
larger property,simpler interface,correctness assertion,ste user,symbolic trajectory evaluation,data abstraction technique,symbolic indexing,partially-ordered state space,logical machinery,symbolic indexing transformations,efficient algorithm,partial order,indexation,state space
Model checking,Computer science,Correctness,Search engine indexing,Symbolic computation,Theoretical computer science,Symbolic data analysis,Boolean data type,Formal verification,Symbolic trajectory evaluation
Conference
Volume
ISSN
ISBN
2517
0302-9743
3-540-00116-6
Citations 
PageRank 
References 
8
0.63
11
Authors
2
Name
Order
Citations
PageRank
Thomas F. Melham138435.63
Robert B. Jones243439.17