article

Free access

Laws of programming

Authors:

B. A. SufrinAuthors Info & Claims

Communications of the ACM, Volume 30, Issue 8

Pages 672 - 686

https://doi.org/10.1145/27651.27653

Published: 01 August 1987 Publication History

PDF eReader

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.

References

[1]

Backhouse, R.C. Program Construction and Verification. Prentice-Hall International, London, 1968.

Digital Library

Google Scholar

[2]

Backus, J. Can programming he liberated from the van Neumann style? Commun. ACM 21, 8 (Aug. 19781, 613-641.

Digital Library

Google Scholar

[3]

de Bakker, J.W. Mathematical Theory of Program Correctness. Prentice-Hall International. London. 1980.

Digital Library

Google Scholar

[4]

Dijkstra, E.W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs. N.J., 1976.

Digital Library

Google Scholar

[5]

Gries, D. The Science of Programming. Springer-Verlag, New York, 1981.

Digital Library

Google Scholar

[6]

Hehner, E.C.R. Predicative programming parts I and II. Commun. ACM 27,2 (Feb. 1984), 134-151.

Digital Library

Google Scholar

[7]

Hoare, C.A.R., and He, J. Weakest prespecification. Tech. Monogr. PRG-44, Programming Research Group, Oxford Univ., 1985.

Google Scholar

[8]

Igarishi, S. An axiomatic approach to equivalence problems of algorithms with applications. Rep., Computer Centre, Univ. of Tokyo, 1968.

Google Scholar

[9]

Jones, C.B. Software Development: A Rigorous Approach. Prentice-Hall International, London, 1980.

Digital Library

Google Scholar

[10]

Kowalski, R.A. The relation between logic programming and logic specification. In Mathematical Logic and Programming Languages, C.A.R. Hoare and J.C. Shepherdson, Eds. Prentice-Hall International, London, 1985, pp. 11-27.

Digital Library

Google Scholar

[11]

Roscoe, A.W. Laws of Occam programming. Tech. Monogr. PRG-53, Programming Research Group, Oxford Univ., 1986.

Google Scholar

[12]

Scott, D.S. Outline of a mathematical theory of computetion. Tech. Monogr. PRCX!, Programming Research Group, Oxford Univ., 1970.

Google Scholar

[13]

Tarski, A. On the calculus of relations. J. Symbolic Logic 6 (1941), 73-89.

Crossref

Google Scholar

Cited By

View all

Barrett CCastle DHeijltjes WSobocinski PLago UEsparza J(2024)The Relational Machine CalculusProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662091(1-15)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662091
Li RZhu HBanach R(2024)An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrencyJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.100973139(100973)Online publication date: Jun-2024
https://doi.org/10.1016/j.jlamp.2024.100973
Chen NZhu H(2024)A process calculus SMrCaIT for IoTJournal of Software: Evolution and Process10.1002/smr.259536:5Online publication date: 25-Apr-2024
https://dl.acm.org/doi/10.1002/smr.2595
Show More Cited By

Index Terms

Laws of programming

Recommendations

Laws of mission-based programming
Abstract
Safety-Critical Java (SCJ) is a recent technology that changes the execution and memory model of Java in such a way that applications can be statically analysed and certified for their real-time properties and safe use of memory. Our interest is ...
Comparing novice programing environments for use in secondary education: App Inventor for Android vs. Alice

Coding is part of logical thinking and is one of the basic skills which are known as '21st-century skills'. Coding acquisition is necessary as it is used in a wide range of occupations. However, computer programing is difficult to learn and programing ...
SEMANOL (73) a metalanguage for programming the semantics of programming languages

SEMANOL is a practical programming system for writing readable formal specifications of the syntax and semantics of programming languages. SEMANOL is based on a theory of semantics which embraces algorithmic (operational) and extensional (input/output) ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 30, Issue 8

Aug. 1987

79 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/27651

Editor:
Peter J. Denning
NASA Ames Research Center, Moffett Field, CA

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1987

Published in CACM Volume 30, Issue 8

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

351
Total Citations
View Citations
1,682
Total Downloads

Downloads (Last 12 months)155
Downloads (Last 6 weeks)21

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Barrett CCastle DHeijltjes WSobocinski PLago UEsparza J(2024)The Relational Machine CalculusProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662091(1-15)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662091
Li RZhu HBanach R(2024)An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrencyJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.100973139(100973)Online publication date: Jun-2024
https://doi.org/10.1016/j.jlamp.2024.100973
Chen NZhu H(2024)A process calculus SMrCaIT for IoTJournal of Software: Evolution and Process10.1002/smr.259536:5Online publication date: 25-Apr-2024
https://dl.acm.org/doi/10.1002/smr.2595
Wang YWidrow BHoare CPedrycz WBerwick RPlataniotis KRudas ILu JKacprzyk J(2023)The odyssey to next-generation computers: cognitive computers (κC) inspired by the brain and powered by intelligent mathematicsFrontiers in Computer Science10.3389/fcomp.2023.11525925Online publication date: 19-May-2023
https://doi.org/10.3389/fcomp.2023.1152592
Antonopoulos TKoskinen ELe TNagasamudram RNaumann DNgo M(2023)An Algebra of Alignment for Relational VerificationProceedings of the ACM on Programming Languages10.1145/35712137:POPL(573-603)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571213
Cavalcanti AConserva Filho MRibeiro PSampaio A(2023)Laws of Timed State MachinesThe Computer Journal10.1093/comjnl/bxad12467:6(2066-2107)Online publication date: 22-Dec-2023
https://doi.org/10.1093/comjnl/bxad124
Li RZhu HBanach R(2023)Translating and verifying Cyber–Physical systems with shared-variable concurrency in SpaceExInternet of Things10.1016/j.iot.2023.10086423(100864)Online publication date: Oct-2023
https://doi.org/10.1016/j.iot.2023.100864
Hayes IJones CMeinicke L(2023)Specifying and Reasoning About Shared-Variable ConcurrencyTheories of Programming and Formal Methods10.1007/978-3-031-40436-8_5(110-135)Online publication date: 8-Sep-2023
https://doi.org/10.1007/978-3-031-40436-8_5
Mu RLi Q(2023)A Coq Implementation of the Program Algebra in Jifeng He’s New Roadmap for Linking Theories of ProgrammingTheories of Programming and Formal Methods10.1007/978-3-031-40436-8_15(395-412)Online publication date: 8-Sep-2023
https://doi.org/10.1007/978-3-031-40436-8_15
Bowen JZhu H(2023)Jifeng He at Oxford and Beyond: An AppreciationTheories of Programming and Formal Methods10.1007/978-3-031-40436-8_1(3-18)Online publication date: 8-Sep-2023
https://doi.org/10.1007/978-3-031-40436-8_1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Laws of mission-based programming

Comparing novice programing environments for use in secondary education: App Inventor for Android vs. Alice

SEMANOL (73) a metalanguage for programming the semantics of programming languages

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations