An axiomatic basis for computer programming

Authors:
C. A. R. Hoare
Affiliations:
Queen's Univ. of Belfast, Belfast, Northern Ireland
Venue:
Communications of the ACM - Special 25th Anniversary Issue
Year:
1983

Citing 1
Cited 12

Sets and other types

ALGOL Bulletin

Functional programming, and where you can put it

ACM SIGPLAN Notices
Action systems in incremental and aspect-oriented modeling

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration

IEEE Transactions on Parallel and Distributed Systems
Optimizing slicing of formal specifications by deductive verification

Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Addressing concurrency in object-oriented software development

CASCON '06 Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research
Toward a design methodology for DBMS: a software engineering approach

VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
Certifying low-level programs with hardware interrupts and preemptive threads

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Formal Modeling of a Generic Middleware to Ensure Invariant Properties

FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Certifying Low-Level Programs with Hardware Interrupts and Preemptive Threads

Journal of Automated Reasoning
Certify Once, Trust Anywhere: Modular Certification of Bytecode Programs for Certified Virtual Machine

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Dynamic contract layers

Proceedings of the 2010 ACM Symposium on Applied Computing
Axiom based architecture

ACM SIGARCH Computer Architecture News

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper an attempt is made to explore the logical foundations 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 involves 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 practical, may follow from a pursuance of these topics.