Computer Science – Logic in Computer Science
Scientific paper
2009-01-16
LMCS 5 (2:1) 2009
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-5(2:1)2009
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.
Claessen Koen
Roorda Jan-Willem
No associations
LandOfFree
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Faithful Semantics for Generalised Symbolic Trajectory Evaluation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Faithful Semantics for Generalised Symbolic Trajectory Evaluation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-127702