• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

An axiomatic basis for computer programming (1969)

Cached

  • Download as a PDF

Download Links

  • [www.utdallas.edu]
  • [www.utdallas.edu]
  • [www4.informatik.tu-muenchen.de]
  • [www.utdallas.edu]
  • [www.utdallas.edu]
  • [www.utdallas.edu]
  • [www4.in.tum.de]
  • [www.utdallas.edu]
  • [www.cs.cornell.edu]
  • [ls14-www.cs.uni-dortmund.de]
  • [www.cs.ucsb.edu]
  • [se.inf.ethz.ch]
  • [se.ethz.ch]
  • [www.cs.umd.edu]
  • [se.inf.ethz.ch]
  • [www.cs.uga.edu]
  • [www.cs.toronto.edu]
  • [www.cs.wm.edu]
  • [www.spatial.maine.edu]
  • [se.inf.ethz.ch]
  • [www.cs.iastate.edu]
  • [www.lcc.uma.es]
  • [se.inf.ethz.ch]
  • [www.brinckerhoff.org]
  • [se.inf.ethz.ch]
  • [www.win.tue.nl]
  • [www.computing.dcu.ie]
  • [www.spatial.maine.edu]
  • [www.brinckerhoff.org]
  • [www.spatial.maine.edu]
  • [www.win.tue.nl]
  • [www.computing.dcu.ie]
  • [www.lcc.uma.es]
  • [www.cs.iastate.edu]
  • [web.cs.iastate.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by C. A. R. Hoare
Venue:COMMUNICATIONS OF THE ACM
Citations:1751 - 4 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Hoare69anaxiomatic,
    author = {C. A. R. Hoare},
    title = {An axiomatic basis for computer programming},
    journal = {COMMUNICATIONS OF THE ACM},
    year = {1969},
    volume = {12},
    number = {10},
    pages = {576--580}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In this paper an attempt is made to explore the logical founda-tions of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This in-volves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and prac-tical, may follow from a pursuance of these topics.

Keyphrases

computer programming    axiomatic basis    formal proof    simple theorem    logical founda-tions    important advantage    computer program   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University