default search action
Symposium on Semantics of Algorithmic Languages 1971
- Erwin Engeler:
Symposium on Semantics of Algorithmic Languages. Lecture Notes in Mathematics 188, Springer 1991, ISBN 978-3-540-05377-4 - J. W. de Bakker:
Axiom systems for simple assignment statements. 1-22 - J. W. de Bakker:
A property of linear conditionals. 23-27 - Hans Bekic, Kurt Walk:
Formalization of storage properties. 28-61 - D. C. Cooper:
Program schemes, programs and logic. 62-70 - Calvin C. Elgot:
Algebraic theories and program schemes. 71-88 - Erwin Engeler:
Structure and meaning of elementary programs. 89-101 - C. A. R. Hoare:
Procedures and parameters: An axiomatic approach. 102-116 - Shigeru Igarashi:
Semantics of algol-like statements. 117-177 - Cliff B. Jones, P. Lucas:
Proving correctness of implementation techniques. 178-211 - Donald E. Knuth:
Examples of formal semantics. 212-235 - Ralph L. London:
Experience with inductive assertions for proving programs correct. 236-251 - Zohar Manna:
Mathematical theory of partial correctness. 252-269 - Zohar Manna, Richard J. Waldinger:
Towards automatic program synthesis. 270-310 - Dana S. Scott:
The lattice of flow diagrams. 311-366
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.