A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Verifying Component-Based Software: Deep Mathematics or Simple Bookkeeping?
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
Anecdotal experience constructing proofs of correctness of code built from reusable software components reveals that they tend to be relatively trivial bookkeeping exercises: they rarely require a substantive mathematical deduction. A careful empirical analysis of hundreds of verification conditions (VCs) for a library of component-client code shows the level of sophistication each proof requires, and suggests how to use the results to characterize a notion of mathematical "obviousness."
doi:10.1007/978-3-642-04211-9_4
fatcat:7zex2x7a4vdunksvvw5jioz5me