Affiliation:
1. Microsoft Research, Cambridge, UK
2. ETH Zurich, Zurich, Switzerland
Abstract
Abstract
We survey the well-known algebraic laws of sequential programming, and extend them with some less familiar laws for concurrent programming. We give an algebraic definition of the Hoare triple, and algebraic proofs of all the relevant laws for concurrent separation logic. We give the provable concurrency laws for Milner transitions, for the Back/Morgan refinement calculus, and for Dijkstra’s weakest preconditions. We end with a section in praise of algebra, of which Carroll Morgan is such a master.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Reference22 articles.
1. Back R-J (1978) On the correctness of refinement steps in program development. PhD thesis A^bo Akademi Department of Computer Science. Helsinki Finland. Report A-1978-4
2. Back R-J (1979) On the notion of correct refinement of programs. In: 5th Scandinavian logic symposium Aalborg Denmark. Aalborg University Press Denmark
3. Proving total correctness of nondeterministic programs in infinitary logic
4. Böhme S Nipkow T (2010) Sledgehammer: judgement day. In: Proceedings of the 5th international conference on automated reasoning IJCAR’10. Springer Berlin pp 107–121
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Timed Calculus with Mobility for Wireless Networks;Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things;2023-05-26
2. UTP semantics for the MCA ARMv8 architecture;Journal of Systems Architecture;2022-04
3. List of Tony Hoare’s Publications;Theories of Programming;2021-10-02
4. Trimming the Hedges: An Algebra to Tame Concurrency;Theories of Programming;2021-10-02
5. A process calculus BigrTiMo of mobile systemsand its formal semantics;Formal Aspects of Computing;2021-03