This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bledsoe, W.W., “The Sup-inf method in Presburger arithmetic”, Memo ATP-18, Mathematics Dept., Univ. of Texas, Austin, Texas, Dec. 1974.
Boyer, R., J Moore, “A computational logic”, Academic Press, 1979.
Burstall, R., J. Goguen, “Putting theories together to make specifications”, Proc. IJCAI, August 1977.
Elspas, B., et al. “A Jovial Verifier”, SRI International, June, 1979.
Ferro, A., E. Omodeo, J. Schwartz, “Decision procedures for some fragments of set theory”, 5th Conf on Automated Deduction, July 1980.
Good, D., R. M. Cohen, J. Keeton-Williams, “Principles of proving concurrent programs in Gypsy”, Proc 6th POPL, 1979.
King, J., “A program verifier”, Ph.D. thesis, CMU, 1969.
Levitt, K., R. Waldinger, “Reasoning about programs”, AI Journal 5, 1974.
Levitt, K., L. Robinson, B. Silverberg, “The HDM handbook”, SRI International, 1979.
Luckham, D., N. Suzuki, “Verification of array, record, and pointer operations in Pascal”, TOPLAS, Oct, 1979.
Melliar-Smith, P. M., R. L. Schwartz, “Formal specification and mechanical verification of SIFT: a fault-tolerant flight control system”, IEEE Transactions on Computers, July 1982.
Milner, R., “An algebraic definition of simulation between programs, CS 205, Stanford, 1971.
Milner, R., “LCF: a way of doing proofs with a machine”, Proc 8th MFCS Symp, 1979.
Musser, D., “Abstract data type specification in the Affirm system”, IEEE TSE, Jan. 1980.
Nakajima, R., M. Honda, H. Nakahara, “Describing and verifying programs with abstract data types”, Formal Description of Programming Concepts, North Holland, 1977.
Oppen, D., G. Nelson, “A simplifier based on efficient decision algorithms”, Proceedings of Fifth POPL, Tucson, Arizona, Jan. 1978.
Parnas, D., “A technique for software module specification with examples”, CACM, May 1972.
Robinson, L., K. Levitt, “Proof techniques for hierarchically structured programs”, CACM, April 1977.
Schorre, V., J. Stein, “The interactive theorem prover (ITP) user manual”, TM-6889/000/01, SDC, 1980.
Shostak, R., “A practical decision procedure for arithmetic with function symbols”, JACM, April 1979.
Shostak, R., “Deciding Combinations of Theories”, Proceedings of the Sixth Conference on Automated Deduction, June 1982.
Suzuki, N., “Verifying programs by algebraic and logical reduction”, Proc. Int. Conf. on Reliable Software, Los Angeles, 1975.
Wensley, J., et al., “SIFT: Design and Analysis of a Fault-tolerant Computer for Aircraft Control”, Proc IEEE, Vol. 68, No. 10, Oct. 1978.
Weyhrauch, R., “Prolegamena to a theory of mechanized formal reasoning”, AI Journal, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shostak, R.E., Schwartz, R., Melliar-Smith, P.M. (1982). STP: A mechanized logic for specification and verification. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000050
Download citation
DOI: https://doi.org/10.1007/BFb0000050
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11558-8
Online ISBN: 978-3-540-39240-8
eBook Packages: Springer Book Archive