Using an induction prover for verifying arithmetic circuits

International Journal on Software Tools for Technology Transfer

Volumn 3, Issue 1, 2000, Pages 32-65

  Kapur, Deepak ^a   Subramaniam, Mahadevan ^b  

^a University of New Mexico   (United States)

^b FUJITSU LABORATORIES LTD   (Japan)

Author keywords

Arithmetic circuits; Automated reasoning; Decision procedures; Hardware verification; Induction; Rewriting

Indexed keywords

ARITHMETIC CIRCUIT; AUTOMATED REASONING; DECISION PROCEDURE; HARDWARE VERIFICATION; INDUCTION; REWRITING;

DIGITAL ARITHMETIC; HARDWARE; INTEGRATING CIRCUITS; LOGIC CIRCUITS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

ADDERS;

EID: 84896692972     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/PL00010808     Document Type: Article

References (54)

1. Angelo C. M., Claesen L., De Man H.: A Methodology for proving correctness of parameterized hardware modules in HOL. In: Borrione, D., W axman, R. (eds.): CHDL'91, Amsterdam: Elsevier Science (North-Holland), 1991
2. Basin D., Walsh T.: Difference Matching. In: Kapur, D. (ed.): Proc. CADE 11. LNAI 607. Berlin, H eidelberg, New York: Springer-Verlag, 1992
3. Boyer R. S., Moore, J S.: A Computational Logic. ACM Monogr Comput Sci, 1979
4. Boyer R.S., Moore J.S.: Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic. Mach Intell 11: 83-157, 1988
5. Boyer R. S., Moore, J S.: A Computational Logic Handbook. New York: Academic Press, 1988
6. Boyer R. S., Moore J S., Kaufmann M.: Functional Instantiation in Nqthm. CLI Tech Rep
7. Brock, B.C., Hunt, W. A., Kaufmann, M.: The FM9001 Microprocessor Proof. CLI Tech Rep 86, Dec 1994
8. Bryant, R. E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput C-35(8), 1986
9. Bryant R.E., Chen Y.-A.: Verification of arithmetic functions with binary moment diagrams. Tech Rep CMU-CS-94-160, June 1994
10. Bryant, R. E.: Bit-level analysis of an SRT divider circuit. Tech Rep CMU-CS-95-140, Car negie Mellon University, April 1995
11. th ACM/IEEE Design Autom Conf, 1990
12. Camilleri, A.J., Gordon, M.J.C., Melham, T.F.: Hardware verification using higher-order logic. In: Borrione, D. (ed.): HDL Descriptions to Guaranteed Correct Circuit Designs. Amsterdam: North Holland, pp. 43-67, 1987
13. th Int Conf CAV'96, New Brunswick, Jul y/August 1996. LNCS 1102. Berlin, H eidelberg, New York: Springer-Verlag, pp. 111-122, 1996
14. Cyrluk, D., Rajan, S., Shankar, N., Srivas, M.K.: Effective theorem proving for hardware verification. In: Kumar, R., Kropf, T. (eds.): Proc. 2nd Conf Theorem Provers in Circuit Design, Sept 1994
15. Dadda, L.: Some schemes for parallel multipliers. In: Swartzlander, E. E., Jr. (ed.): Computer Arithmetic I, IEEE Comput Soc Press, 1990
16. Dershowitz, N.: Termination of rewriting. J Symb Comput 3: 69-116
17. Ercegovac, M.D., Lang, T.: Division and Square Root: Digit Recurrence Algorithms and Implementations. Boston, M A: Kluwer, 1994
18. Ercegovac, M.D., Lang, T.: Radix-4 square root without initial PLA. IEEE Trans Comput 39(8), 1990
19. German, S.: Towards Automatic Verification of Arithmetic Hardware. Lecture Notes, 1995
20. Hesketh, J. T.: Using middle out reasoning to guide inductive theorem proving. Ph.D thesis. University of Edinburgh, UK, 1991
21. Hunt, W.A., Brock, B. C.: The verification of a bit-slice ALU. Workshop on Hardware Specification, Verification and Synthesis: Mathematical Aspects. LNCS 408. Berlin, Heidelberg, New York: Springer-Verlag, 1989
22. Ireland, A., Bundy, A.: Productive Use of Failure in Inductive Proof. Edinburgh DAI Research Report No: 716
23. Ireland, A.: The use of planning critics in mechanizing inductive proofs. In: Voronkov, A. (ed.): Proc LPAŔ92. LNAI 624. Berlin, H eidelberg, New York: Springer-Verlag, 1992
24. Kapur, D.: Rewriting, decision procedures and lemma speculation for automated hardware verification. Proc 10th Int Conf Theorem Proving in Higher Order Logics. LNCS 1275. Berlin, H eidelberg, New York: Springer-Verlag, 1997
25. Kapur, D.: Shostak's congruence closure as completion. Proc Intl Conf on Rewriting Techniques and Applications, (RTA-97), Bar celona, Spain, June 1997
26. Kapur, D., Nie, X.: Reasoning about numbers in Tecton. Proc 8th Int Symp Methodol for Intelligent Systems, (ISMIS'94), Charlotte, NC, October 1994, pp. 57-70
27. Kapur, D., Subramaniam, M.: New uses of linear arithmetic in automated theorem proving for induction. J Autom Reasoning 16(1/2): 39-78, 1996
28. Kapur, D., Subramaniam, M.: Mechanically verifying a family of multiplier circuits. In: Alur, R., H enzinger, T. (eds.): Proc Comput Aided Verification (CAV'96), New Jersey. LNCS 1102. Berlin Heidelberg New York: Springer-Verlag, pp. 135-146, 1996
29. Kapur, D., Subramaniam, M.: Mechanical verification of adder circuits using powerlists. J Formal Methods in System Design 13(2): 127-158, 1998
30. Kapur, D., Subramaniam, M.: Lemma discovery in automating induction. In: McRobbie, Sl aney (eds.) Proc Int Conf on Autom Deduction, CA DE-13. LNAI 1104. New Jersey, July 1996
31. Kapur, D., Subramaniam, M.: Mechanizing reasoning about arithmetic circuits: SRT division. In: Sivakumar, G., Rames h, S. (eds.): Proc 17th FSTTCS. LNCS 1346. Berlin, Hei delberg, New York: Springer-Verlag, 1997
32. Kapur, D., Subramaniam, M.: Intermediate lemma generation from circuit descriptions. (in preparation) State University of New York, A lbany, NY, M ay 1997
33. Kapur, D., Zhang, H.: An overview of Rewrite Rule Laboratory (RRL). J Comput Math Appl 29(2): 91-114, 1995
34. Kapur, D., Subramaniam, M.: Mechanizing reasoning about large finite tables in a rewrite-based theorem prover. In: Proc. of ASIAN-8. LNCS 1538. 1998
35. Moore, J., Lynch, T., Kaufmann, M.: A Mechanically Checked Proof of the Correctness of the AMD5K86 Floating Point Division Algorithm. CLI Tech Rep, M arch 1996
36. Miner, P.S., Leathrum, J.F. Jr. Verification of IEEE compliant subtractive division algorithm. Proc FMCAD'96, Palo Alto, CA. LNCS 1166. Berlin, Heidelberg, New York: Springer-Verlag, 1996
37. Montoye, R. K., Hokenek, E., Runyon, S.L.: Design of the IBM RISC System/6000 floating-point execution unit. IBM J 34(1), 1990
38. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans Program Lang Syst 1(2): 245-257, 1979
39. Omondi, A. R.: Computer Arithmetic Systems: Algorithms, Architecture and Implementations. Englewood Cliffs, N J: Prentice Hall, 1994
40. Cormen, T. H., Lei serson, C. E., Rivest, R.L.: Introduction to Algorithms. Cambridge, M A: MIT Press, 1991
41. Robertson, J. E.: A new class of digital division methods. IRE Trans Electron Comput, pp. 218-222, 1958
42. Ruess, H.: Hierarchical verification of two-dimensional highspeed multiplication in PVS: a case study. Formal Methods in CAD. LNCS 1166. Berlin, H eidelberg, New York: Springer-Verlag, 1996
43. Ruess, H., Shankar, N., Sr ivas, M.K.: Modular verification of SRT division. In: Alur, R., H enzinger, T. (eds.): Proc Comput Aided Verif, 8th Int Conf CAV'96, New Brunswick, July/August 1996. LNCS 1102. Berlin, H eidelberg, New York: Springer-Verlag, pp. 123-134, 1996
44. Sarma, D.D., M atula, D.: Measuring the accuracy of ROM reciprocal tables. IEEE Int Symp on Comput Arith, IEEE Computer Society, 1993
45. Shostak, R. E.: Deciding combination of theories. J ACM 31(1): 1-12, 1984
46. Subramaniam, M.: Failure Analyses of Inductive Theorem Provers. Doctoral Dissertation, State University of New York, Albany 1996
47. Taylor, G. S.: Compatible hardware for division and square root. Proc 5th IEEE Symp Comput Archit, May 1981
48. Tocher, K.D.: Techniques of multiplication and division for automatic binary computers. Q J Mech Appl Math 11(3): 1958
49. Verkest, D., Claesen, L., De Man, H.: On the use of the Boyer-Moore theorem prover for correctness proofs of parameterized hardware modules. In: Claesen, L. (ed.): Formal VLSI Specification and Synthesis: VLSI Design Methods I, Elsevier Science (North-Holland), 1990
50. Wallace, C. S.: A suggestion for a fast multiplier. In: IEEE Trans Electron Comput EC-13: 14-17, 1964
51. Walsh, T.: A divergence critic. In: Bundy, A. (ed.): Proc CADE 12. LNAI 814. Berlin, H eidelberg, New York: Springer-Verlag, 1994
52. Zhang, H.: Implementing contextual rewriting. In: Remy, Rusinowitch (eds.): Proc 3rd Int Workshop on Cond Term Rewriting Syst. LNCS 656. Berlin, H eidelberg, New York: Springer-Verlag, pp. 363-377, 1992
53. Zhang, H., Kapur, D., K rishnamoorthy, M.S.: A mechanizable induction principle for equational specifications. In: Lusk, Ov erbeek (eds.): Proc 9th Int Conf Automat Deduction (CADE), Chicago. LNCS 310. Berlin, H eidelberg, New York: Springer-Verlag, pp. 250-265, 1988
54. Zurawski, J. H., Gosling, J. B.: Design of a high speed square root multiply and divide unit. IEEE Trans Comput C-36, 1987