Ada exception handling: an axiomatic approach
- 1 April 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 2 (2) , 225-233
- https://doi.org/10.1145/357094.357100
Abstract
A method of documenting exception propagation and handling in Ada programs is proposed. Exception propagation declarations are introduced as a new component of Ada specifications, permitting documentation of those exceptions that can be propagated by a subprogram. Exception handlers are documented by entry assertions. Axioms and proof rules for Ada exceptions given. These rules are simple extensions of previous rules for Pascal and define an axiomatic semantics of Ada exceptions. As a result, Ada programs specified according to the method can be analyzed by formal proof techniques for consistency with their specifications, even if they employ exception propagation and handling to achieve required results (i.e., nonerror situations). Example verifications are given.Keywords
This publication has 4 references indexed in Scilit:
- Preliminary Ada reference manualACM SIGPLAN Notices, 1979
- Automatic program verification I: A logical basis and its implementationActa Informatica, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- An axiomatic definition of the programming language PASCALActa Informatica, 1973