Abstract
If a program's proof of correctness can be reused, higher quality may be achieved with reasonable cost. Unfortunately, reusing proofs of program correctness is difficult. The approach being taken toward this problem in the ENCOMPASS project is explored. Specifically, the author presents examples of three types of proof reuse: instantiating (reusing) a parameterized component and its proof, reusing a development step with its proof, and reusing a provably correct program schema. The author believes that, although program verification will, in general, remain expensive, the reuse of verified components may become practical through the use of such methods.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
