Laws of programming-Reference-Cited by-同舟云学术

Laws of programming

Published:1987-08 Issue:8 Volume:30 Page:672-686
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Hoare C. A. R.¹,Hayes I. J.²,Jifeng He³,Morgan C. C.³,Roscoe A. W.³,Sanders J. W.³,Sorensen I. H.³,Spivey J. M.³,Sufrin B. A.³

Affiliation:

1. Univ. of Texas, Austin

2. Univ. of Queensland, Australia

3. Oxford Univ., Oxford, UK

Abstract

A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to deriving programs from their specifications.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/27651.27653

Reference13 articles.

1. Can programming be liberated from the von Neumann style?

Cited by 270 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Laws of Timed State Machines;The Computer Journal;2023-12-22

2. Translating and verifying Cyber–Physical systems with shared-variable concurrency in SpaceEx;Internet of Things;2023-10

3. A process calculus SMrCaIT for IoT;Journal of Software: Evolution and Process;2023-07-19

4. The odyssey to next-generation computers: cognitive computers (κC) inspired by the brain and powered by intelligent mathematics;Frontiers in Computer Science;2023-05-19

5. An Algebra of Alignment for Relational Verification;Proceedings of the ACM on Programming Languages;2023-01-09