Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Roorda, J. W., & Claessen, K. (2006). Explaining symbolic trajectory evaluation by giving it a faithful semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3967 LNCS, pp. 555–566). Springer Verlag. https://doi.org/10.1007/11753728_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
