skip to main content
10.1145/2370776.2370780acmotherconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
research-article

Matrix code

Published: 19 September 2012 Publication History

Abstract

Matrix Code gives imperative programming a mathematical semantics and heuristic power comparable in quality to functional and logic programming. A program in matrix code is developed incrementally from a specification in pre/post-condition form. The computations of a code matrix are characterized by powers of the matrix when it is interpreted as a transformation in a space of vectors of logical conditions. Correctness of a code matrix is expressed in terms of a fixpoint of the transformation.

References

[1]
K. R. Apt and A. Schaerf. Search and imperative programming. POPL'97, pages 67--79.
[2]
C. Baier and J.P. Katoen. Principles of Model Checking. MIT Press, 2008.
[3]
Keith L. Clark and M.H. van Emden. Consequence Verification of Flowcharts. IEEE Transactions on Software Engineering, SE-7:52--60, January 1981.
[4]
E.W. Dijkstra. A constructive approach to the problem of program correctness. BIT, 8:174--186, 1968.
[5]
EdsgerW. Dijkstra. Concern for correctness as a guiding principle for program composition. In J.S.J. Hugo, editor, The Fourth Generation, pages 359--367. Infotech, Ltd, 1971.
[6]
Edsger W. Dijkstra. Notes on structured programming. In O.-J. Dahl, E.W. Dijkstra, and C.A.R. Hoare, editors, Structured Programming, pages 1--72. Academic Press, 1972.
[7]
E.W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
[8]
Robert W. Floyd. Assigning meanings to programs. In J.T. Schwartz, editor, Proceedings Symposium in Applied Mathematics, pages 19--32. American Mathematical Society, 1967.
[9]
H.H. Goldstine and J. von Neumann. Planning and coding of problems for an electronic computing instrument. Part II, volume 1, 1946. Reprinted in: John von Neumann: Collected Works, Pages 80--151, volume V. A.H. Taub, editor. Pergamon Press, 1963.
[10]
C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576--583, 1969.
[11]
R.A. Kowalski. Algorithm = Logic + Control. Comm. ACM, 22:424--436, 1979.
[12]
D. Stott Parker. Partial order programming. Technical Report CSD-870067, Computer Science Department, University of California at Los Angeles, 1987.
[13]
Dana Scott. Some definitional suggestions for automata theory. Journal of Computer and Systems Sciences, 1:187--212, 1967.
[14]
M. H. van Emden. Programming with verification conditions. IEEE Transactions on Software Engineering, vol. 3(1979), pp 148--159.
[15]
W.A. Woods. Transition network grammars. Comm. ACM, 13:591--606, 1970.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
PPDP '12: Proceedings of the 14th symposium on Principles and practice of declarative programming
September 2012
226 pages
ISBN:9781450315227
DOI:10.1145/2370776
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]

Sponsors

  • Kuleuven Belgium: Kuleuven Belgium

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 September 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. floyd assertions
  2. hoare logic
  3. verification-driven programming

Qualifiers

  • Research-article

Conference

PPDP'12
Sponsor:
  • Kuleuven Belgium

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 57
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media