Proving programs correct: Some techniques and examples

DOI10.1007/BF01936865MaRDI QIDQ5606282zbMATH OpenFDO

Authors Ralph L. London

Publication date 1970

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01936865

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites work

• A constructive approach to the problem of program correctness
• A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form
• Computer Interval Arithmetic: Definition and Proof of Correct Implementation
• scientific article; zbMATH DE number 3291623 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3342646 (Why is no real title available?)
• The structure of the “THE”-multiprogramming system

Cited in

(4)

• The validity of return address schemes
• A survey of state vectors
• Studying a Range Proof Technique — Exception and Optimisation
• From programming-by-example to proving-by-example

This page was built for publication: Proving programs correct: Some techniques and examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5606282)