论文信息 - A New SAT-Based Algorithm for Symbolic Trajectory Evaluation - 字舞流文

A New SAT-Based Algorithm for Symbolic Trajectory Evaluation

We present a new SAT-based algorithm for Symbolic Trajectory Evaluation (STE), and compare it to more established SAT-based techniques for STE.

Koen Claessen | Jan-Willem Roorda

[1] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[2] Magdy S. Abadir,et al. Formal verification of content addressable memories using symbolic trajectory evaluation , 1997, DAC.

[3] Carl-Johan H. Seger,et al. Introduction to generalized symbolic trajectory evaluation , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[4] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.

[5] Thomas Schubert,et al. High-level formal verification of next-generation microprocessors , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[6] Per Bjesse,et al. Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers , 2001, CAV.

[7] Randal E. Bryant,et al. Formal verification by symbolic evaluation of partially-ordered trajectories , 1995, Formal Methods Syst. Des..

[8] Carl-Johan H. Seger,et al. A Methodology for Large-Scale Hardware Verification , 2000, FMCAD.