article

Free access

An algebraic description of programs with assertions, verification and simulation

Author:

Rod M. BurstallAuthors Info & Claims

ACM SIGPLAN Notices, Volume 7, Issue 1

Pages 7 - 14

https://doi.org/10.1145/942578.807068

Published: 01 January 1972 Publication History

PDF eReader

Abstract

A program in flow diagram form is described by a function from a free category to the category of sets and relations. Attaching assertions to it is described as a natural transformation and so is simulation of one program by another with the same shape of flow diagram. These notions are used to prove the theorems justifying Floyd's method of proving correctness by verification and Milner's method of proving simulation, restricted to programs of similar form. The treatment is novel but the results are not new, except that non-deterministic programs are dealt with throughout.

References

[1]

Cohn, P.M. (1965) Universal Algebra. New York and London: Harper Row.

Google Scholar

[2]

Cooper, D.C. (1971) Programs for mechanical program verification. Machine Intelligence 6 (eds. B. Meltzer and D. Michie) Edinburgh: Edinburgh University Press, pp. 43-59.

Google Scholar

[3]

Floyd, R. W. (1967) Assigning meanings to programs. Proceedings of Symposia in Applied Mathematics. American Mathematical Society, Vol. 19, 19-32.

Crossref

Google Scholar

[4]

Karp, R.M. (1959) Some applications of logical syntax to digital computer programming. Harvard University Thesis.

Google Scholar

[5]

Landin, P. J. (1969) A program machine symmetric automata theory. Machine Intelligence 5 (eds. B. Meltzer and D. Michie) Edinburgh: Edinburgh University Press, pp. 99-120.

Google Scholar

[6]

Maclane, S. and Birkhoff, G. (1967) Algebra. New York: MacMillan.

Google Scholar

[7]

Manna, Z. (1970) The correctness of nondeterministic programs. Artificial Intelligence, Vol. 1, 1-26.

Digital Library

Google Scholar

[8]

Manna, Z. (1970) Termination of programs represented as interpreted graphs. Spring Joint Computer Conf. pp. 83-89.

Digital Library

Google Scholar

[9]

Milner, R. (1970) A formal notion of simulation between programs. Memo 14, Computer and Logic Research Group, University College of Swansea, U.K.

Google Scholar

[10]

Milner, R. (1971) An algebraic definition of simulation between programs. Stanford Artificial Intelligence Project Memo AIM-142. Computer Science Department, Stanford University. (Also in Proc. I.J.C.A.I. Conference, London, September, 1971.)

Digital Library

Google Scholar

[11]

Scott, D. (1971) The lattice of flow diagrams. Semantics of Algorithmic Languages (ed. E. Engeler) Springer Lecture Notes in Mathematics, Vol. 188, pp. 311-366.

Google Scholar

Cited By

View all

Maurer W(2008)SurveyComputer Science Review10.1016/j.cosrev.2008.02.0032:1(1-28)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1016/j.cosrev.2008.02.003
Worytkiewicz K(2002)Concrete Process CategoriesElectronic Notes in Theoretical Computer Science10.1016/S1571-0661(04)80501-268:1(70-85)Online publication date: Nov-2002
https://doi.org/10.1016/S1571-0661(04)80501-2
RYDEHEARD DSANNELLA D(2002)A Collection of Papers and Memoirs Celebrating the Contribution of Rod Burstall to Advances in Computer ScienceFormal Aspects of Computing10.1007/s00165020000613:3-5(187-193)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.1007/s001650200006
Show More Cited By

Index Terms

An algebraic description of programs with assertions, verification and simulation
1. Software and its engineering
  1. Software creation and management
    1. Software development techniques
      1. Flowcharts
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Assertions

Recommendations

An algebraic description of programs with assertions, verification and simulation
Proceedings of ACM conference on Proving assertions about programs

A program in flow diagram form is described by a function from a free category to the category of sets and relations. Attaching assertions to it is described as a natural transformation and so is simulation of one program by another with the same shape ...
An algebraic description of programs with assertions, verification and simulation
Proceedings of ACM conference on Proving assertions about programs

A program in flow diagram form is described by a function from a free category to the category of sets and relations. Attaching assertions to it is described as a natural transformation and so is simulation of one program by another with the same shape ...
Efficient Verification of Sequential and Concurrent C Programs

There has been considerable progress in the domain of software verification over the last few years. This advancement has been driven, to a large extent, by the emergence of powerful yet automated abstraction techniques such as predicate abstraction. ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 7, Issue 1

Proceedings of ACM conference on Proving assertions about programs

January 1972

211 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/942578

Issue’s Table of Contents

Proceedings of ACM conference on Proving assertions about programs
January 1972
215 pages
ISBN:9781450378918
DOI:10.1145/800235

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1972

Published in SIGPLAN Volume 7, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
498
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)30

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maurer W(2008)SurveyComputer Science Review10.1016/j.cosrev.2008.02.0032:1(1-28)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1016/j.cosrev.2008.02.003
Worytkiewicz K(2002)Concrete Process CategoriesElectronic Notes in Theoretical Computer Science10.1016/S1571-0661(04)80501-268:1(70-85)Online publication date: Nov-2002
https://doi.org/10.1016/S1571-0661(04)80501-2
RYDEHEARD DSANNELLA D(2002)A Collection of Papers and Memoirs Celebrating the Contribution of Rod Burstall to Advances in Computer ScienceFormal Aspects of Computing10.1007/s00165020000613:3-5(187-193)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.1007/s001650200006
Schmidt G(1981)Programs as partial graphs I: Flow equivalence and correctnessTheoretical Computer Science10.1016/0304-3975(81)90060-815:1(1-25)Online publication date: 1981
https://doi.org/10.1016/0304-3975(81)90060-8
Lynch NBlum E(1981)Relative complexity of algebrasMathematical Systems Theory10.1007/BF0175239614:1(193-214)Online publication date: Dec-1981
https://doi.org/10.1007/BF01752396
Wulf W(1979)A case against the GOTOClassics in software engineering10.5555/1241515.1241523(83-98)Online publication date: 1-Jan-1979
https://dl.acm.org/doi/10.5555/1241515.1241523
Schmeck H(1976)Ein Algebraischer Ansatz für KompilerkorrektheitsbeweiseProgrammiersprachen10.1007/978-3-642-66319-2_4(33-42)Online publication date: 1976
https://doi.org/10.1007/978-3-642-66319-2_4
Pettorossi A(2020)A Historical Account of My Early Research InterestsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.320.1320(1-28)Online publication date: 7-Aug-2020
https://doi.org/10.4204/EPTCS.320.1
Goguen J(2009)A categorical manifestoMathematical Structures in Computer Science10.1017/S09601295000000501:01(49)Online publication date: 4-Mar-2009
https://doi.org/10.1017/S0960129500000050
Maurer W(2008)SurveyComputer Science Review10.1016/j.cosrev.2008.02.0032:1(1-28)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1016/j.cosrev.2008.02.003
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