Mechanizing reasoning about large finite tables in a rewrite based theorem prover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1538, Issue , 1998, Pages 22-42

  Kapur, Deepak ^a   Subramaniam, M ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; NUMBER THEORY; TABLE LOOKUP;

ABSTRACTION MECHANISM; ARITHMETIC FUNCTIONS; CORRECTNESS PROOFS; DOMAIN INFORMATIONS; EQUATIONAL REASONING; HARDWARE CIRCUITS; MULTIPLE LOOKUP TABLES; THEOREM PROVERS;

THEOREM PROVING;

EID: 84947943679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49366-2_3     Document Type: Conference Paper

References (20)

1. E.M. Clarke, S.M. German and X. Zhao, “Verifying the SRT division algorithm using theorem proving techniques," Proc. Computer Aided Verification, 8th Intl. Conf. Brunswick, August 1996, Springer LNCS 1102, 111-122.
2. Proc. of the IEEE International Symposium on Computer Arithmetic,, IEEE Computer Society 1995.
3. Proc. of the IEEE International Symposium on Computer Arithmetic,, IEEE Computer Society 1997.
4. M.P. Heimdahl and N. Leveson, “Consistency and completeness analyses of state based requirements," 17th Intl. Conf. on Software Eng., IEEE, 1995.
5. C. Heitmeyer, A. Bull, C. Gasarch, B. Labaw, “SCR*: A toolset for specifying and analyzing requirements," In Proc. of COMPASS'95, IEEE 1995.
6. D.N. Hoover and Z. Chen, “Tablewise, a decision table tool", In Proc. of COM- PASS'95, IEEE 1995.
7. P.S. Miner and J.F. Leathrum Jr., “Verification of IEEE compliant subtractive division algorithm," Proc. FMCAD'96, LNCS 1166, Palo Alto, CA, 1996.
8. D. Kapur, “Rewriting, decision procedures and lemma speculation for automated hardware verification," Proc. 10th Intl. Conf. Theorem Proving in Higher Order Logics, LNCS 1275, 1997.
9. D. Kapur and X. Nie, “Reasoning about numbers in Tecton," Proc. 8th Intl. Symp. Methodologies for Intelligent Systems, (ISMIS'94), October 1994.
10. D. Kapur, M. Subramaniam “Mechanizing Reasoning About Arithmetic Circuits: SRT Division," In Proc. of 17th FSTTCS, LNCS (eds. Sivakumar and Ramesh), 1997.
11. A.R. Omondi, Computer Arithmetic Systems: Algorithms, Architecture and Implementations, Prentice Hall 1994.
12. K.D. Tocher, “Techniques of multiplication and division for automatic binary computers," Quarterly Journal of Mechanics and Applied Mathematics, 11(3), 1958.
13. G.S. Taylor, “Compatible hardware for division and square root," Proc. 5th IEEE Symp. on Computer Architecture, May 1981.
14. S. Owre, J.R. Rushby, N. Shankar, “Integration in PVS: Tables, Types, and Model Checking," Proc. of TACAS,, LNCS 1217, Springer Verlag, April 1997.
15. M.D. Ercegovac, T. Lang, “Radix-4 Square Root Without Initial PLA," IEEE Trans. on Computers, Vol. 39. No. 8, Aug. 1990.
16. J.H. Zurawski, J.B. Gosling, “Design of a high speed square root multiply and divide unit", IEEE Trans. on Computers, vol. C-36, 1987.
17. D.D. Sarma and D. Matula, “Measuring the Accuracy of ROM Reciprocal Tables", IEEE Int. Symp. on Comput. Arithmetic, IEEE Computer Society, 1993.
18. H. Ruess, N. Shankar and M.K. Srivas, “Modular verification of SRT division," Proc. Computer Aided Verification, 8th Intl. Conf. - CAV'96, New Brunswick, 1996, Springer LNCS 1102 (eds. Alur and Henzinger).
19. J.E. Robertson, “A new class of digital division methods," IRE Trans. on Electronic Computers, 1958, 218-222.
20. H. Zhang, D. Kapur, and M.S. Krishnamoorthy, “A mechanizable induction principle for equational specifications," Proc. 9th (CADE), Springer LNCS 310, 1988.