Koen Claessen ; Jan-Willem Roorda - A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

lmcs:1028 - Logical Methods in Computer Science, April 8, 2009, Volume 5, Issue 2 - https://doi.org/10.2168/LMCS-5(2:1)2009
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Authors: Koen Claessen ; Jan-Willem Roorda

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.

Volume: Volume 5, Issue 2
Published on: April 8, 2009
Accepted on: June 25, 2015
Submitted on: June 7, 2007
Keywords: Computer Science - Logic in Computer Science,B.6.3,F.3.2,F.4.3


Consultation statistics

This page has been seen 251 times.
This article's PDF has been downloaded 159 times.