Verification of a multiplier: 64 Bits and beyond

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

Volumn 697 LNCS, Issue , 1993, Pages 166-179

  Kurshan, R P ^a   Lamport, Leslie ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; MODEL CHECKING;

COMPUTATIONAL CONSTRAINTS; FINITE STATE; FIXED-POINT ALGORITHMS; INDUCTION PRINCIPLES; LOCAL PROPERTY; MODEL CHECKING ALGORITHM; TEMPORAL LOGIC OF ACTIONS; THEOREM PROVERS;

THEOREM PROVING;

EID: 85029415288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_14     Document Type: Conference Paper

References (13)

1. Martin Abadi and Leslie Lamport. Open systems. To appear in 1993 as a SRC Research Report.
2. Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions On Computers, C-35(8):677-691, August 1986.
3. Shiu-Kai Chin. Verified functions for generating signed-binary arithmetic hardware. IEEE Transactions on Computer-Aided Design, 11(12):1529-1558, December 1992.
4. Urban Engberg, Peter Grønning, and Leslie Lamport. Mechanical verification of concurrent systems with TLA. In Computer-Aided Verification, Lecture Notes in Computer Science, Berlin, Heidelberg, New York, June 1992. Springer-Verlag. Proceedings of the Fourth International Conference, CAV’92.
5. Z. Har’El and R. P. Kurshan. Software for analytical development of communication protocols. AT&T Technical Journal, 69(1):44-59, 1990.
6. J. Katzenelson and R. P. Kurshan. S/R: A language for specifying protocols and other coordinating processes. In Proceedings of the 5th Annual International Phoenix Conference on Computer Communications, pages 286-292, Scottsdale, Arizona, 1986. IEEE Computer Society.
7. Israel Koren. Computer Arithmetic Algorithms. Prentice Hall, Englewood Cliffs, New Jersey, 1993.
8. R. P. Kurshan. Reducibility in analysis of coordination. In P. Varaiya and A.B. Kurzhanski, editors, Discrete Event Systems: Models and Applications, volume 103 of Lecture Notes in Control and Information Sciences, pages 19-39, Berlin, 1987. Springer-Verlag.
9. R. P. Kurshan. Analysis of discrete event coordination. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science, pages 414-453. Springer-Verlag, May/June 1989.
10. R. P. Kurshan and K. McMillan. A structural induction theorem for processes. In Proceedings of the 8th annual ACM Symposium on Principles of Distributed Computing, pages 239-247. ACM Press, 1989.
11. Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657-668, Paris, September 1983. IFIP, North-Holland.
12. Leslie Lamport. The temporal logic of actions. Research Report 79, Digital Equipment Corporation, Systems Research Center, December 1991.
13. +. In Hans Rischel and Anders P. Ravn, editors, Hybrid Systems, Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag. Proceedings of a Workshop on Hybrid Systems, to appear.