Proving Assertions About Programs

Keyphrases

Publications

1972

Proceedings of ACM Conference on Proving Assertions About Programs, Las Cruces, New Mexico, USA, January 6-7, 1972 Proving Assertions About Programs (1972)
Michel Sintzoff
Calculating properties of programs by valuations on specific models. Proving Assertions About Programs (1972)
Cliff B. Jones
Formal development of correct algorithms: An example based on earley's recogniser. Proving Assertions About Programs (1972)
Robin Milner
Implementation and applications of Scott's logic for computable functions. Proving Assertions About Programs (1972)
Clement L. McGowan
The "most recent" error: Its causes and correction. Proving Assertions About Programs (1972)
Peter Wegner
Operational semantics of programming languages. Proving Assertions About Programs (1972)
Clement McGowan
The Contour Model Lambda Calculus Machine. Proving Assertions About Programs (1972)
Zohar Manna, Stephen Nes, Jean Vuillemin
Inductive methods for proving properties of programs. Proving Assertions About Programs (1972)
Daniel M. Berry
The equivalence of models of tasking. Proving Assertions About Programs (1972)
J. M. Cadiou, Zohar Manna
Recursive definitions of partial functions and their computations. Proving Assertions About Programs (1972)
Michael J. Fischer
Lambda calculus schemata. Proving Assertions About Programs (1972)
Stephen J. Garland, David C. Luckham
Translating recursion schemes into program schemes. Proving Assertions About Programs (1972)
John A. N. Lee
The definition and validation of the radix sorting technique. Proving Assertions About Programs (1972)
C. David Allen
Derivation of axiomatic definitions of programming languages from algorithmic definitions. Proving Assertions About Programs (1972)
Edward A. Ashcroft
Program correctness methods and language definition. Proving Assertions About Programs (1972)
Michael S. Paterson
Decision problems in computational models. Proving Assertions About Programs (1972)
Raymond E. Miller
A boundary between decidability and undecidability for parallel program schemata (Extended Abstract). Proving Assertions About Programs (1972)
Thomas E. Hull, Wayne H. Enright, Arthur E. Sedgwick
The correctness of numerical algorithms. Proving Assertions About Programs (1972)
Ralph L. London
Correctness of a compiler for a Lisp subset. Proving Assertions About Programs (1972)
Thomas E. Cheatham Jr., Ben Wegbreit
On a laboratory for the study of automating programming. Proving Assertions About Programs (1972)
H. Raymond Strong, S. A. Walker
Properties preserved under recursion removal. Proving Assertions About Programs (1972)
Rod M. Burstall
An algebraic description of programs with assertions, verification and simulation. Proving Assertions About Programs (1972)