A vindication of program verification
From MaRDI portal
Publication:2963953
Recommendations
Cites work
- A set of postulates for the foundation of logic
- A set of postulates for the foundation of logic. II
- An axiomatic basis for computer programming
- Does a rock implement every finite-state automaton?
- Finite combinatory processes—formulation
- Machines
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Operating system verification---an overview
- Rigorous software development. An introduction to program verification.
- Social processes, program verification and all that
Cited in
(11)- Verifying Whiley programs with Boogie
- The epistemology of computer-mediated proofs
- Program verification: to err is human
- Why there is no general solution to the problem of software verification
- Non-obfuscated unprovable programs \& many resultant subtleties
- Verification of programs that destructively manipulated data
- On the strength of “sometimes” and “always” in program verification
- A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness
- Lawful functions and program verification in miranda
- A mechanical analysis of program verification strategies
- Program analysis is harder than verification: a computability perspective
This page was built for publication: A vindication of program verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963953)