Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics [chapter]

Jan-Willem Roorda, Koen Claessen
2006 Lecture Notes in Computer Science  
Symbolic Trajectory Evaluation (STE) is a formal verification technique for hardware. The current STE semantics is not faithful to the proving power of existing STE tools, which obscures the STE theory unnecessarily. In this paper, we present a new closure semantics for STE which does match the proving power of STE model-checkers, and makes STE easier to understand.
doi:10.1007/11753728_56 fatcat:yghox4uutba67gxm2l727v4way