A modular verifiable exception handling mechanism
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
Object-oriented software construction (2nd ed.)
Object-oriented software construction (2nd ed.)
Advanced Exception Handling Mechanisms
IEEE Transactions on Software Engineering
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Program Development in Java: Abstraction, Specification, and Object-Oriented Design
Program Development in Java: Abstraction, Specification, and Object-Oriented Design
A Formalisation of Java's Exception Mechanism
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Preliminary design of JML: a behavioral interface specification language for java
ACM SIGSOFT Software Engineering Notes
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
The Eiffel exception mechanism supports two methodological aspects. First, a method specification by a pre- and postcondition also determines when the method exits exceptionally, namely when the stated postcondition cannot be satisfied. Secondly, the rescue and retry statements combine catching an exception with a loop structure, thus requiring a dedicated form of correctness reasoning. We present verification rules for total correctness that take these two aspects into account. The rules handle normal loops and retry loop structures in an analogous manner. They also allow the Eiffel's mechanism to be slightly generalized. The verification rules are derived from a definition of statements by higher-order predicate transformers and have been checked with a theorem prover.