A modular verifiable exception handling mechanism
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Side effects and aliasing can have simple axiomatic descriptions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ada exception handling: an axiomatic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Exception handling: issues and a proposed notation
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
An Aximatic Treatment of Algol 68 Routines
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
An axiomatic semantic definition of algol 68.
An axiomatic semantic definition of algol 68.
Program structures for exceptional condition handling.
Program structures for exceptional condition handling.
The replacement model for modular verifiable exception handling
The replacement model for modular verifiable exception handling
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
An exception handling model for parallel programming and its verification
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Exception Handlers in Functional Programming Languages
IEEE Transactions on Software Engineering
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
| Hi-index | 0.00 |
An axiomatic semantic definition is given of the replacement model of exception handling in an expression-oriented language. These semantics require only two new proof rules for the most general case. An example is given of a program fragment using this model of exception handling, and these rules are used to verify the consistency of the fragment and its specification.