Skip to main content

Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study

  • Conference paper
  • 135 Accesses

Part of the book series: NATO ASI Series ((NATO ASI F,volume 165))

Abstract

One can argue that writing proofs might be better than writing programs, for the following simple reason: There is no algorithm that can check whether a program meets its specification, but it is easy to check whether a given proof is correct.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Joseph L. Bates and Robert L. Constable. Proofs as programs.ACM Transactions on Programming Languages and Systems7(1):113–136, January 1985.

    Article  MATH  Google Scholar 

  2. Ulrich Berger and Helmut Schwichtenberg. Program extraction from classical proofs. In D. Leivant, editorLogic and Computational Complexity International Workshop LCC ‘84 Indianapolis IN USA October 1994 volume 960 of Lecture Notes in Computer Science pages 77–97. Springer Verlag, Berlin, Heidelberg, New York, 1995.

    Google Scholar 

  3. Ulrich Berger and Helmut Schwichtenberg. The greatest common divisor: a case study for program extraction from classical proofs. In S. Berardi and M. Coppo, editorsTypes for Proofs and Programs. International Workshop TYPES ‘85 Torino Italy June 199,5. Selected Papersvolume 1158 of Lecture Notes in Computer Sciencepages 36–46. Springer Verlag, Berlin, Heidelberg, New York, 1996.

    Google Scholar 

  4. Christopher Alan Goad.Computational uses of the manipulation of formal proofs.PhD thesis, Stanford University, August 1980. Stanford Department of Computer Science Report No. STAN-CS-80–819.

    Google Scholar 

  5. Helmut Schwichtenberg. Programmentwicklung durch Beweistransformation: Das Maximalsegmentproblem.Sitzungsber. d. Bayer. Akad. d. Wiss. Math.-Nat. Kl.pages 8*-12*, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benl, H., Schwichtenberg, H. (1999). Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study. In: Berger, U., Schwichtenberg, H. (eds) Computational Logic. NATO ASI Series, vol 165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58622-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58622-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63670-7

  • Online ISBN: 978-3-642-58622-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics