Verification Rules for Exception Handling in Eiffel. Sekerinski, E. & Zhang, T. In Gheyi, R. & Naumann, D., editors, Formal Methods: Foundations and Applications, volume 7498, of Lecture Notes in Computer Science, pages 179–193, September, 2012. Springer. doi abstract bibtex 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.
@inproceedings{SekerinskiZhang12ExceptionHandlingEiffel,
series = {Lecture {Notes} in {Computer} {Science}},
title = {Verification {Rules} for {Exception} {Handling} in {Eiffel}},
volume = {7498},
isbn = {978-3-642-33295-1},
doi = {10.1007/978-3-642-33296-8_14},
abstract = {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.},
booktitle = {Formal {Methods}: {Foundations} and {Applications}},
publisher = {Springer},
author = {Sekerinski, Emil and Zhang, Tian},
editor = {Gheyi, Rohit and Naumann, David},
month = sep,
year = {2012},
pages = {179--193},
}
Downloads: 0
{"_id":"KxDevuTv4zbtWbgTR","bibbaseid":"sekerinski-zhang-verificationrulesforexceptionhandlingineiffel-2012","author_short":["Sekerinski, E.","Zhang, T."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","series":"Lecture Notes in Computer Science","title":"Verification Rules for Exception Handling in Eiffel","volume":"7498","isbn":"978-3-642-33295-1","doi":"10.1007/978-3-642-33296-8_14","abstract":"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.","booktitle":"Formal Methods: Foundations and Applications","publisher":"Springer","author":[{"propositions":[],"lastnames":["Sekerinski"],"firstnames":["Emil"],"suffixes":[]},{"propositions":[],"lastnames":["Zhang"],"firstnames":["Tian"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Gheyi"],"firstnames":["Rohit"],"suffixes":[]},{"propositions":[],"lastnames":["Naumann"],"firstnames":["David"],"suffixes":[]}],"month":"September","year":"2012","pages":"179–193","bibtex":"@inproceedings{SekerinskiZhang12ExceptionHandlingEiffel,\n\tseries = {Lecture {Notes} in {Computer} {Science}},\n\ttitle = {Verification {Rules} for {Exception} {Handling} in {Eiffel}},\n\tvolume = {7498},\n\tisbn = {978-3-642-33295-1},\n\tdoi = {10.1007/978-3-642-33296-8_14},\n\tabstract = {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.},\n\tbooktitle = {Formal {Methods}: {Foundations} and {Applications}},\n\tpublisher = {Springer},\n\tauthor = {Sekerinski, Emil and Zhang, Tian},\n\teditor = {Gheyi, Rohit and Naumann, David},\n\tmonth = sep,\n\tyear = {2012},\n\tpages = {179--193},\n}\n\n","author_short":["Sekerinski, E.","Zhang, T."],"editor_short":["Gheyi, R.","Naumann, D."],"key":"SekerinskiZhang12ExceptionHandlingEiffel","id":"SekerinskiZhang12ExceptionHandlingEiffel","bibbaseid":"sekerinski-zhang-verificationrulesforexceptionhandlingineiffel-2012","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://api.krunk.cn/emil/bib.php","dataSources":["HEdahWqKBpmSGmDwq","MF5eGzpJnqf6bSAoG","ienufKdnmJs49AsjR","So4gmSWFmbQRNEuFs","ezsmw4w22u9JFLNYJ","CvQYP6Tmpapx74Mgr","RWydLHbBJqgdeh5jr"],"keywords":[],"search_terms":["verification","rules","exception","handling","eiffel","sekerinski","zhang"],"title":"Verification Rules for Exception Handling in Eiffel","year":2012}