A Simple Theorem Prover Based on Symbolic Trajectory Evaluation and BDD's

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 14, Issue 4, 1995, Pages 413-422

  Hazelhurst, Scott ^a   Seger, Carl Johan H ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATION; BOOLEAN ALGEBRA; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SYSTEMS; DATA REDUCTION; FINITE AUTOMATA; INTEGRATED CIRCUIT LAYOUT; MATHEMATICAL MODELS; VLSI CIRCUITS;

BINARY DECISION DIAGRAMS; COHERENT SYSTEM; NEXT STATE FUNCTION; SYMBOLIC TRAJECTORY EVALUATION;

THEOREM PROVING;

EID: 0029291994     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.372367     Document Type: Article

References (19)

1. M. C. McFarland, “Formal verification of sequential hardware: A tutorial,” IEEE Trans. Computer-Aided Design, vol. 12, no. 5, pp. 633–654, May 1993.
2. M. J. C. Gordon, Ed., Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge, England: Cambridge University, 1993.
3. E. M. Clarke, E. A. Emerson, and A. P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach,” in Proc. 10th ACM Symp. Principles Programming Languages, New York, 1983, ACM, pp. 117–126.
4. O. Coudert, J. C. Madre, and C. Berthet, “Verifying temporal properties of sequential machines without building their state diagram”, in CAV '90: Proc. 2nd Int. Workshop Computer-Aided Verification, June 1990, Lecture Notes in Computer Science 531.
5. R. E. Bryant, “Symbolic boolean manipulation with ordered binary-decision diagrams,” ACM Computing Surveys, vol. 24, no. 3, pp. 293–318, Sept. 1992.
6. J. R. Burch, E. M. Clarke, and K. L. McMillan, “Symbolic model checking: 1020 states and beyond,” Inform. Computation, vol. 98, no. 2, pp. 142–170, June 1992.
7. R. E. Bryant, “On the complexity of vlsi implementations and graph representations of boolean functions with application to integer multiplication,” IEEE Trans. Comput., vol. 20, no. 2, pp. 205–213, Feb. 1991.
8. J. J. Joyce and C.-J. H. Seger, “Linking BDD-based symbolic evaluation to interactive theorem-proving,” in Proc. 30th Design Automation Conf. June 1993, pp. 469–474.
9. R. P. Kurshan and L. Lamport, “Verification of a multiplier: 64 bits and beyond,” in Proc. 5th Int. Conf. Computer-Aided Verification, July 1993, pp. 166–179.
10. H. Hungar, “Combining model checking and theorem proving to verify parallel processes,” in Proc. 5th Int. Conf. on Computer-Aided Verification, July 1993, pp. 154-165.
11. D. Beatty, R. E. Bryant, and C.-J. Seger, “Formal hardware verification by symbolic ternary trajectory evaluation,” in Proc. 1991 IEEE/ACM Design Automation Conf., June 1991, pp. 397–402.
12. C.-J. H. Seger and R. E. Bryant, “Formal verification by symbolic evaluation of partially-ordered trajectories,” to be published in J. Formal Methods in Syst. Design, vol. 6, pp. 147–189, Mar. 1995.
13. C.-J. H. Seger, “Voss—A formal hardware verification system user's guide,” Dep. of Comp. Sci., Univ. of British Columbia, Tech. Report 93-45. Available by anonymous ftp as
14. D. L. Beatty, A methodology for formal hardware verification with application to microprocessors, Ph.D. dissertation, School of Comp. Sci., Carnegie Mellon Univ., PA, 1993.
15. M. Darwish, “Formal verification of a 32-bit pipelined RISC processor”, M.A.Sc. thesis, Dep. of Elect. Eng., Univ. of British Columbia, 1994.
16. S. Hazelhurst and C.-J. H. Seger, “A simple theorem prover based on symbolic trajectory evaluation and OBDDs,” Dep. of Comp. Sci., Univ. of British Columbia, Tech. Rep. 93-41, Nov. 1993.
17. Z. Zhu, J. Joyce, and C Seger, “The completeness of a hardware inference system,” in CAV '94: Proc. Sixth Int. Conf. on Computer Aided Verification, June 1994, pp. 286–298.
18. E. M. Clarke, D. E. Long, and K. L. McMillan, “Compositional Model Checking,” in IEEE Fourth Annual Symp. Logic in Computer Sci., 1989, pp. 353–362.
19. J. F. Groote and F. Moller, “Verification of parallel systems via decomposition,” in CONCUR '92: Proc. Third Int. Conf. Concurrency Theory, 1992, pp. 62-76.