Skip to main content

The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV

  • Chapter
Automated Deduction — A Basis for Applications

Part of the book series: Applied Logic Series ((APLS,volume 10))

Abstract

This chapter describes the first half of the formal, machine-supported verification of a Prolog compiler with the KIV system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ahrendt, W. (1995). Von PROLOG zur WAM — Verifikation der Prozedurübersetzung mit KIV. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe. (in German).

    Google Scholar 

  • Aït-Kaci, H. (1991). Warren’s Abstract Machine. A Tutorial Reconstruction. MIT Press.

    Google Scholar 

  • Börger, E. and Rosenzweig, D. (1995). The WAM—definition and compiler correctness. In Beierle, C. and Plumer, L., editors, Logic Programming: Formal Methods and Practical Applications, volume 11 of Studies in Computer Science and Artificial Intelligence. North-Holland, Amsterdam.

    Google Scholar 

  • Goldblatt, R. (1982). Axiomatising the Logic of Computer Programming Springer LNCS 130.

    Google Scholar 

  • Gurevich, M. (1995). Evolving algebras 1993: Lipari guide. In Borger, E., editor, Specification and Validation Methods. Oxford University Press.

    Google Scholar 

  • Harel, D. (1984). Dynamic logic. In Gabbay, D. and Guenther, F., editors, Handbook of Philosophical Logic,volume 2, pages 496–604. Reidel.

    Google Scholar 

  • Moore, J. (1988). PITON: A Verified Assembly Level Language. Technical report 22, Computational Logic Inc. available at the URL: http://www.cli.com.

    Google Scholar 

  • Pusch, C. (1996). Verification of Compiler Correctness for the WAM. In Proc. of the 1996Int. Conf. on Theorem Proving in Higher Order Logics, LNCS 1125.

    Google Scholar 

  • Reif, W. (1995). The KIV-approach to Software Verification. In Broy, M. and Jähnichen, S., editors, KORSO: Methods, Languages, and Tools for the Construction of Correct Software–Final Report. Springer LNCS 1009.

    Google Scholar 

  • Reif, W., Schellhorn, G., and Stenzel, K. (1995). Interactive Correctness Proofs for Software Modules Using MV. In Tenth Annual Conference on Computer Assurance,IEEE press. NIST, Gaithersburg (MD), USA.

    Google Scholar 

  • Reif, W., Schellhorn, G., and Stenzel, K. (1997). Proving System Correctness with KIV 3.0. In 14th International Conference on Automated Deduction. Proceedings, pages 69–72. Townsville, Australia, Springer LNCS 1249.

    Google Scholar 

  • Reif, W., Schellhorn, G., Stenzel, K., and Balser, M. (1998). Structured Specification and Interactive Proofs with KIV. In Bibel, W. and Schmitt, P., editors, Automated

    Google Scholar 

  • Deduction —A Basis for Applications,volume I, 3. Kluwer. to appear.

    Google Scholar 

  • Reif, W. and Stenzel, K. (1995). Reuse of Proofs in Software Verification. In Köhler, J., editor, Workshop on Formal Approaches to the Reuse of Plans, Proofs, and Programs. Montreal, Quebec.

    Google Scholar 

  • Schellhorn, G. (1998). A general proof technique for ASM refinements. to appear as a Technical Report of the University of Ulm.

    Google Scholar 

  • Schellhorn, G. and Ahrendt, W. (1997). Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science (J.UCS). available at the URL: http://hyperg.iicm.tu-graz.ac.at/jucs/.

    Google Scholar 

  • Schmitt, P. H. (1994). Proving WAM compiler correctness. Interner Bericht 33/94, Universität Karlsruhe, Fakultät fur Informatik.

    Google Scholar 

  • Sterling, L. and Shapiro, E. (1986). The Art of Prolog MIT Press.

    Google Scholar 

  • Young, W. D. (1988). A Verified Code Generator for a Subset of Gypsy. Technical report 33, Computational Logic Inc. available at the URL: http://www.cli.com.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Schellhorn, G., Ahrendt, W. (1998). The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV. In: Bibel, W., Schmitt, P.H. (eds) Automated Deduction — A Basis for Applications. Applied Logic Series, vol 10. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0437-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0437-3_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5052-6

  • Online ISBN: 978-94-017-0437-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics