Reasoning about procedures as parameters in the language L4
From MaRDI portal
(Redirected from Reasoning about procedures as parameters in the language L4)
Recommendations
Cites work
- A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs
- Correctness of programs with Pascal-like procedures without global variables
- Effective Axiomatizations of Hoare Logics
- scientific article; zbMATH DE number 3858385 (Why is no real title available?)
- scientific article; zbMATH DE number 3890703 (Why is no real title available?)
- scientific article; zbMATH DE number 3900131 (Why is no real title available?)
- scientific article; zbMATH DE number 3980461 (Why is no real title available?)
- scientific article; zbMATH DE number 4022609 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- On relative completeness of Hoare logics
- On termination problems for finitely interpreted ALGOL-like programs
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
- Soundness and Completeness of an Axiom System for Program Verification
- Ten Years of Hoare's Logic: A Survey—Part I
- The characterization problem for Hoare logics
Cited in
(8)- Procedures, parameters, and abstraction: Separate concerns
- Semantics and reasoning with free procedures
- Fifty years of Hoare's logic
- Horn clause solvers for program verification
- scientific article; zbMATH DE number 3858385 (Why is no real title available?)
- scientific article; zbMATH DE number 3868598 (Why is no real title available?)
- scientific article; zbMATH DE number 3872652 (Why is no real title available?)
- Complexity of proving program correctness
This page was built for publication: Reasoning about procedures as parameters in the language L4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583874)