Valérie Issarny
- Ada 79.Ada. Preliminary Ada reference manual. ACM SIGPLAN notices, 14(6), June 1979. Google Scholar
Digital Library
- Apt 80.K. R. Apt, N. Francez, and W. P. de Roever. A proof system for communicating sequential processes. ACM transactions on programming languages and systems,2(3):359-385, July 1980. Google ScholarDigital Library
- Bal 89.H. Bal, J. Steiner, and A. Tanenbaum. Programming Languages for Distributed Computing Systems. ACM computing surveys, 21(3):261-322, September 1989. Google ScholarDigital Library
- Banâtre 80.J. P. Ban~tre. Contribution ~ l'~tude de m~thodes et d'outils de construction de programmed parall~les et fiables. Th~e d'~tat, Universit~de Rennes I, D~cembre 1980.Google Scholar
- Banâtre 86.J. P. Ban~tre, M. Ban~tre, and F. Ployette. The concept of Multi-functions, a General Structuring Tool for Distributed Operating System. In Proceedings of the 6th Distributed Computing Systems Conference, Cambridge,MA, May 1986.Google Scholar
- Banâtre 89.J. P. Ban~tre and M. Benveniste. Multiprocedures:Generalized Procedures for Concurrent Programming.In 3rd Workshop on Large Grain Parallelism, Software Engineering Institute, CMU, October 1989.Google Scholar
- Banâtre 90.J. P. Baniitre and V. Issarny. Exception handling in communicating sequential processes : Design, Verification and Implementation. Submitted for publication,1990.Google Scholar
- Benveniste 91.M. Benveniste and V. Issarny. ARCHE : un langage parall~le ~ objets. Research report, IRISA, 1991. To appear.Google Scholar
- Campbell 86.R. H. Campbell and B. Randell. Error recovery in asynchronous systems. IEEE transactions on software engineering, SE-12(8):811-826, August 1986. Google ScholarDigital Library
- Cocco 82.N. Cocco and S. Dully. A mechanism for exception handling and its verification rules. Computer language,7:43-49, March 1982.Google ScholarDigital Library
- Cristian 82.F. Cristian. Robust data types. Acts Informatica,7(9):365-397, October 1982.Google Scholar
- Cristian 84.F. Cristian. Correct and robust programs.IEEE transactions on software engineering, SE- 10(2);163-174, March 1984.Google Scholar
- Cristian 87.F. Cristian. Exception Handling. Research report RJ 5724, IBM Almaden Research Center, 1987.Google Scholar
- Francez 86.N. Francez, B. Hailpern, and G. Taubenfeld. SCRIPT : a communication abstraction mechanism and its verification. science of Computer Programming, 6:35 88, 1986. Google ScholarDigital Library
- Francez 89.N. Francez. Cooperating proofs for distributed programs with multiparty interactions. Information Processing Letters, 32(5):235-242, September 1989. Corrigenda in Information Processing Letters vol. 35, February 1990, pp. 57. Google ScholarDigital Library
- Hoare 78.C. A. R. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666-674, August 1978. Google ScholarDigital Library
- Huang 90.D. T. Huang and R. A. Olsson. An exception handling mechanism for SR. Computer language, 15(3):163-176, 1990. Google ScholarDigital Library
- Jalote 86.P. Jalote and R. H. Campbell. Atomic Actions for Fault Tolerance Using CSP. IEEE transactions on software engineering, SE-12(1):59-68, January 1986. Google ScholarDigital Library
- Knudsen 87.J. L. Knudsen. Better exception handling in block structured systems. IEEE Software, 17(2):40-49, May 1987.Google ScholarDigital Library
- Lee 90.P. A. Lee and T. Anderson. Fault Tolerance, Principles and practice. Second revised edition, volume 3 of Dependable Computing and Fault-Tolerant Systems. Springer-Verlag, 1990. Google ScholarDigital Library
- Levin 77.R. Levin. Program structures for exceptional condition handling. PhD thesis, Carnegie-Mellon University, June 1977. Google ScholarDigital Library
- Liskov 79.B. H. Liskov and A. Snyder. Exception handling in CLU. IEEE transactions on software engineering, SE- 5(6):546-558, November 1979.Google Scholar
- Lodaya 90.K. Lodaya and R. K. Shyamasundar. Proof theory for exception handling in a tasking environment. Acts Informatica, 28:365-397, 1990. Google ScholarDigital Library
- Luckham 80.D. C. Luckham and W. Polak. Ada exception handling: an axiomatic approach, ACM transactions on programming languages and systems, 2(2):225-233, April 1980. Google ScholarDigital Library
- Szalas 85.A. Szalas and D. Szczepanska. Exception handling in parallel computations. ACM SIGPLAN notices, 20(10):95-104, October 1985. Google ScholarDigital Library
- Szczepanska 91.D. Szczepanska. A Hoare-like verification system for a language with an exception handling mechanism. Theorical computer science, 80:319-335, 1991. Google ScholarDigital Library
- Taylor 86.D. J. Taylor. Concurrency and Forward Error Recovery in Atomic Actions. IEEE transactions on software engineering, SE-12(1):69-78, January 1986. Google ScholarDigital Library
- Yemini 87.S. Yemini and D. M. Berry. An axiomatic treatment of exception handling in an expression oriented language.ACM transactions on programming languages and systems, 9(3):390-407, July 1987. Google ScholarDigital Library
Index Terms
- An exception handling model for parallel programming and its verification
Recommendations
Efficient Java exception handling in just-in-time compilation
Research ArticlesJava uses exceptions to provide elegant error handling capabilities during program execution. However, the presence of exception handlers complicates the job of the just-in-time (JIT) compiler, while exceptions are rarely used in most programs. This ...
Verification rules for exception handling in eiffel
SBMF'12: Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applicationsThe 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 ...
Provably live exception handling
FTfJP '15: Proceedings of the 17th Workshop on Formal Techniques for Java-like ProgramsWriting concurrent Java programs that provably terminate, i.e. that terminate in all executions allowed by the language specification, is difficult, because of the combination of two language "features": firstly, the virtual machine is allowed to throw ...
Comments