Symbolic Trajectory Evaluation

  • Damir A. Jamsek
Part of the Advances in Formal Methods book series (ADFM, volume 4)

Abstract

This case study presents a formalization of Symbolic Trajectory Evaluation in the logic of ACL2. A form of model-checking, STE has an efficient implementation and has been used in industrial settings to verify hardware designs. This study presents no new theoretical results in STE but formalizes the fundamental concepts so that they may be incorporated into a theorem proving environment such as ACL2. A simple example of its use is presented.

Keywords

Boolean Function Inference Rule Boolean Lattice Deductive Proof Circuit Evaluation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Damir A. Jamsek
    • 1
  1. 1.IBM Austin Research LaboratoryAustinUSA

Personalised recommendations