-
1
-
-
0026913667
-
Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams
-
R.E. Bryant. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
-
(1992)
ACM Computing Surveys
, vol.24
, Issue.3
, pp. 293-318
-
-
Bryant, R.E.1
-
2
-
-
84957633777
-
Validity Checking for Combinations of Theories with Equality
-
M. Srivas, editor, Palo Alto, CA, Springer-Verlag
-
D. Dill C. Barrett and J. Levitt. Validity Checking for Combinations of Theories with Equality. In M. Srivas, editor, FMCAD’96, volume 1166 of Lecture Notes in Computer Science, pages 187-201, Palo Alto, CA, November 1996. Springer-Verlag.
-
(1996)
FMCAD’96, Volume 1166 of Lecture Notes in Computer Science
, pp. 187-201
-
-
Barrett, D.D.C.1
Levitt, J.2
-
3
-
-
84957670988
-
On Shostak’s Decision Procedure for Combination of Theories
-
M. A. McRobbie and J. K. Slaney, editors, New Brunswick, NJ, July/August, Springer-Verlag
-
D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s Decision Procedure for Combination of Theories. In M. A. McRobbie and J. K. Slaney, editors, Proc. of CADE’96, volume 1104 of Lecture Notes in Artificial Intelligence, pages 463-477, New Brunswick, NJ, July/August 1996. Springer-Verlag.
-
(1996)
Proc. of CADE’96, Volume 1104 of Lecture Notes in Artificial Intelligence
, pp. 463-477
-
-
Cyrluk, D.1
Lincoln, P.2
Shankar, N.3
-
4
-
-
35148834082
-
-
Technical report, Universitat Ulm, D-89069 Ulm, Oberer Eselsberg, December
-
D. Cyrluk, O. Möller, and H. Rueβ. An Efficient Decision Procedure for a Theory of Fixed-Sized Bitvectors with Composition and Extraction, Technical report, Universitat Ulm, D-89069 Ulm, Oberer Eselsberg, December 1996.
-
(1996)
An Efficient Decision Procedure for a Theory of Fixed-Sized Bitvectors with Composition and Extraction
-
-
Cyrluk, D.1
M, O.2
Öllerrueβ, H.3
-
5
-
-
0029251055
-
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
-
S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, February 1995.
-
(1995)
IEEE Transactions on Software Engineering
, vol.21
, Issue.2
, pp. 107-125
-
-
Owre, S.1
Rushby, J.2
Shankar, N.3
Von Henke, F.4
-
6
-
-
84957706271
-
Hierarchical Verification of Two-Dimensional High-Speed Multiplication in PVS: A Case Study
-
M.K. Srivas and A. Camilleri, editors, Springer-Verlag, November
-
H. Ruefi. Hierarchical Verification of Two-Dimensional High-Speed Multiplication in PVS: A Case Study. In M.K. Srivas and A. Camilleri, editors. Formal Methods in Computer-Aided Design, volume 1166 of Lecture Notes in Computer Science. Springer-Verlag, November 1996.
-
(1996)
Formal Methods in Computer-Aided Design, Volume 1166 of Lecture Notes in Computer Science
-
-
Ruefi, H.1
-
7
-
-
0021125949
-
Deciding Combinations of Theories
-
R.E. Shostak. Deciding Combinations of Theories. Journal of the ACM, 31(1):1-12, January 1984.
-
(1984)
Journal of the ACM
, vol.31
, Issue.1
, pp. 1-12
-
-
Shostak, R.E.1
-
8
-
-
0342640017
-
Formal Verification of the AAMP5 Microprocessor
-
M.G. Hinchey and J.P. Bowen, editors, Prentice Hall, Hemel Hempstead, UK
-
M.K. Srivas and S.P. Miller. Formal Verification of the AAMP5 Microprocessor. In M.G. Hinchey and J.P. Bowen, editors, Applications of Formal Methods, International Series in Computer Science, chapter 7, pages 125-180. Prentice Hall, Hemel Hempstead, UK, 1995.
-
(1995)
Applications of Formal Methods, International Series in Computer Science, Chapter 7
, pp. 125-180
-
-
Srivas, M.K.1
Miller, S.P.2
|