Matrix Code.
Saved in:
| Title: | Matrix Code. |
|---|---|
| Authors: | van Emden, M.H.1 vanemden@cs.uvic.ca |
| Source: | Science of Computer Programming. May2014, Vol. 84, p3-21. 19p. |
| Subjects: | Two-dimensional bar codes, Imperative programming, Denotational semantics, Logic programming, Heuristic algorithms, Mathematical transformations |
| Abstract: | 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. The abstract machine for Matrix Code is the dual-state machine, which we present as a variant of the classical finite-state machine. [Copyright &y& Elsevier] |
| Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
