A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
The work
| Authors | Koen Claessen; Jan-Willem Roorda |
|---|---|
| Editors | |
| Type | article |
| Year | 2009 |
| Citekey | claessen2009faithful |
Where it appeared
| Published in | Logical Methods in Computer Science |
|---|---|
| Publisher | Centre pour la Communication Scientifique Directe (CCSD) |
| Volume | 5 |
| Issue | 2 |
| Article number | 1028 |
Identifiers
| arXiv | 0901.2518 |
|---|---|
| DOI | 10.2168/lmcs-5(2:1)2009 |
| ISSN | 1860-5974 |
Access
| Landing page | https://doi.org/10.2168/lmcs-5(2:1)2009 |
|---|---|
| Free full text | https://arxiv.org/pdf/0901.2518 |
Related
| Distinct from | aagaard1999are |
|---|---|
| Distinct from | bryant1990ternary |
| Distinct from | davis2013verified |
| Distinct from | fuegger2014faithful |
| Distinct from | fugger2016unfaithful |
| Distinct from | gupta2014formally |
| Distinct from | oleary1999formally |
| Distinct from | oulkaid2025modeles |
| Distinct from | seger1995formal |
From crossref.
Abstract
Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. GSTE uses abstraction, meaning that details of the circuit behaviour are removed from the circuit model. A semantics for GSTE can be used to predict and understand why certain circuit properties can or cannot be proven by GSTE. Several semantics have been described for GSTE. These semantics, however, are not faithful to the proving power of GSTE-algorithms, that is, the GSTE-algorithms are incomplete with respect to the semantics. The abstraction used in GSTE makes it hard to understand why a specific property can, or cannot, be proven by GSTE. The semantics mentioned above cannot help the user in doing so. The contribution of this paper is a faithful semantics for GSTE. That is, we give a simple formal theory that deems a property to be true if-and-only-if the property can be proven by a GSTE-model checker. We prove that the GSTE algorithm is sound and complete with respect to this semantics.
A copy is held
pdf, 349.7 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via crossref |
|---|---|
| Added | 2026-09-16 16:14 UTC |
| Approved by | a person 2026-09-16 20:49 UTC |
Cite it as
@article{claessen2009faithful,
title = {A Faithful Semantics for Generalised Symbolic Trajectory Evaluation},
author = {Koen Claessen and Jan-Willem Roorda},
year = {2009},
journal = {Logical Methods in Computer Science},
publisher = {Centre pour la Communication Scientifique Directe (CCSD)},
volume = {5},
number = {2},
issn = {1860-5974},
articleno = {1028},
eprint = {0901.2518},
doi = {10.2168/lmcs-5(2:1)2009},
}
This record lives at https://refs.drheap.org/claessen2009faithful/ and will keep doing so.