Conference item
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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Springer Publisher's website
- Journal:
- Lecture Notes in Computer Science: Journal website
- Volume:
- 2517
- Pages:
- 1-18
- Host title:
- Lecture Notes in Computer Science: Formal Methods in Computer-Aided Design
- Publication date:
- 2002-11-05
- Acceptance date:
- 2002-06-01
- Event location:
- Portland, Oregon, USA
- DOI:
- ISSN:
-
0302-9743
- Source identifiers:
-
908696
- ISBN:
- 9783540001164
Item Description
- Keywords:
- Pubs id:
-
pubs:908696
- UUID:
-
uuid:43379d17-2ac8-465e-bda7-1b4944e29439
- Local pid:
- pubs:908696
- Deposit date:
- 2018-08-17
Terms of use
- Copyright holder:
- Springer-Verlag Berlin Heidelberg
- Copyright date:
- 2002
- Notes:
- © Springer-Verlag Berlin Heidelberg 2002
If you are the owner of this record, you can report an update to it here: Report update to this record