Inductive Proof Outlines for Exceptions in Multithreaded Java
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient weakest preconditions
Information Processing Letters
Behavioral interface specification languages
ACM Computing Surveys (CSUR)
Verification rules for exception handling in eiffel
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
| Hi-index | 0.00 |
The design of programs which are both correct and robust is investigated. It is argued that the notion of an exception is a valuable tool for structuring the specification, design, verification, and modification of such programs. The syntax and semantics of a language with procedures and exception handling are presented. A deductive system is proposed for proving total correctness and robustness properties of programs written in this language. The system is both sound and complete. It supports proof modularization, in that it allows one to reason separately about fault-free and fault-tolerant system properties. Since the programming languages considered closely resembles CLU or Ada, the presented deductive system is easily adaptable for verifying total correctness and robustness properties of programs written in these, or similar, languages.