A vindication of program verification
From MaRDI portal
Publication:2963953
DOI10.1080/01445340.2015.1065461zbMATH Open1359.68186OpenAlexW2227693444WikidataQ58355728 ScholiaQ58355728MaRDI QIDQ2963953FDOQ2963953
Authors: Selmer Bringsjord 
Publication date: 22 February 2017
Published in: History and Philosophy of Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01445340.2015.1065461
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in the philosophy of science (03A10)
Cites Work
- An axiomatic basis for computer programming
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Does a rock implement every finite-state automaton?
- Operating system verification---an overview
- A set of postulates for the foundation of logic. II
- Finite combinatory processes—formulation
- A set of postulates for the foundation of logic
- Rigorous software development. An introduction to program verification.
- Social processes, program verification and all that
- Machines
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
- On the strength of “sometimes” and “always” in program verification
- Verification of programs that destructively manipulated data
- A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness
- Lawful functions and program verification in miranda
- Program analysis is harder than verification: a computability perspective
- A mechanical analysis of program verification strategies
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)
