{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:48:19Z","timestamp":1693864099388},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1007\/bf02983373","type":"journal-article","created":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T13:35:20Z","timestamp":1225892120000},"page":"7-41","source":"Crossref","is-referenced-by-count":5,"title":["Proof theory for exception handling in a tasking environment"],"prefix":"10.1007","volume":"28","author":[{"given":"K.","family":"Lodaya","sequence":"first","affiliation":[]},{"given":"R. K.","family":"Shyamasundar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02983373_CR1","series-title":"Lect. Notes Comput. Sci.","volume-title":"The programming language Ada Reference Manual, ANSI\/MIL-STD-1815A","author":"American National Standards Institute","year":"1983","unstructured":"[Ada83] American National Standards Institute: The programming language Ada Reference Manual, ANSI\/MIL-STD-1815A. (Lect. Notes Comput. Sci. vol. 155) Berlin Heidelberg New York: Springer 1983"},{"issue":"3","key":"BF02983373_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K.R. Apt","year":"1980","unstructured":"[AFD80] Apt, K.R., Francez, N., DeRoever, W.P.: A proof system for communicating sequential processes. ACM Trans. Prog. Lang. Syst.2 (3), 359\u2013385 (1980) [Also Moitra, A.: Letter,5 (3), 500\u2013501 (1983)]","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"1","key":"BF02983373_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/322358.322372","volume":"30","author":"K.R. Apt","year":"1983","unstructured":"[Apt83] Apt, K.R.: Formal justification of a proof system for communicating sequential processes. JACM30 (1), 197\u2013216 (1983)","journal-title":"JACM"},{"key":"BF02983373_CR4","series-title":"NATO ASI Series F","first-page":"441","volume-title":"Control flow and data flow: concepts of distributed programming","author":"K.R. Apt","year":"1985","unstructured":"[Apt85] Apt, K.R.: Proving correctness of CSP programs \u2014 a tutorial. In: Broy, M. (ed.) Control flow and data flow: concepts of distributed programming. NATO ASI Series F, 14, pp. 441\u2013474. Berlin Heidelberg New York: Springer 1985"},{"key":"BF02983373_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00264021","volume":"11","author":"M.A. Arbib","year":"1978","unstructured":"[AA78] Arbib, M.A., Alagic, S.: Proof rules for gotos. Acta Informatica11, 139\u2013148 (1978)","journal-title":"Acta Informatica"},{"key":"BF02983373_CR6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BF00288686","volume":"1","author":"M. Clint","year":"1972","unstructured":"[CH72] Clint, M., Hoare, C.A.R.: Program proving: jumps and functions. Acta Informatica1, 214\u2013224 (1972)","journal-title":"Acta Informatica"},{"issue":"2","key":"BF02983373_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/TSE.1984.5010218","volume":"10","author":"F. Cristian","year":"1984","unstructured":"[Cri84] Cristian, F.: Correct and robust programs. IEEE Trans. Softw. Eng.SE-10 (2), 163\u2013174 (1984)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"BF02983373_CR8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF00264536","volume":"15","author":"A. DeBruin","year":"1981","unstructured":"[DBr81] DeBruin, A.: Goto statements: semantics and deduction systems. Acta Informatica15, 385\u2013424 (1981)","journal-title":"Acta Informatica"},{"key":"BF02983373_CR9","series-title":"Tech. Rep.","volume-title":"An approach to modeling database activity","author":"R.S. Flint","year":"1984","unstructured":"[Fli84] Flint, R.S.: An approach to modeling database activity, Ph.D. Thesis. Tech. Rep. 239. University of California, Irvine (1984)"},{"key":"BF02983373_CR10","volume-title":"Ada: an advanced introduction","author":"N. Gehani","year":"1984","unstructured":"[Geh84] Gehani, N.: Ada: an advanced introduction. Englewood Cliffs: Prentice-Hall 1984"},{"key":"BF02983373_CR11","series-title":"LNCS","first-page":"252","volume-title":"A sound and complete Hoare axiomatization of the Ada rendezvous","author":"R. Gerth","year":"1982","unstructured":"[Ger82] Gerth, R.: A sound and complete Hoare axiomatization of the Ada rendezvous. Proc. 9th ICALP, Aarhus, LNCS 140, pp. 252\u2013265. Berlin Heidelberg New York: Springer 1982"},{"issue":"2","key":"BF02983373_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(84)90018-2","volume":"4","author":"R. Gerth","year":"1984","unstructured":"[GD84] Gerth, R., DeRoever, W.P.: A proof system for concurrent Ada programs. Sci. Comput. Program.4 (2), 159\u2013204 (1984)","journal-title":"Sci. Comput. Program"},{"key":"BF02983373_CR13","first-page":"371","volume":"9","author":"R. Gerth","year":"1986","unstructured":"[GD86] Gerth, R., DeRoever, W.P.: Proving monitors revisited: a first step towards verifying object-oriented systems. Fund. Inform.9, 371\u2013400 (1986)","journal-title":"Fund. Inform."},{"issue":"8","key":"BF02983373_CR14","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"[Hoa78] Hoare, C.A.R.: Communicating sequential processes. Commun. ACM21 (8), 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"key":"BF02983373_CR15","first-page":"6","volume":"14","author":"J. Ichbiah","year":"1979","unstructured":"[Ich79] Ichbiah, J. et al.: Rationale for the design of the programming language Ada. ACM Sigplan Notices14, 6 (1979)","journal-title":"ACM Sigplan Notices"},{"key":"BF02983373_CR16","doi-asserted-by":"crossref","unstructured":"[Li82] Li, W.: An operational semantics for tasking and exception handling in Ada. Proc. Ada TEC82, Washington, 1982, pp. 138\u2013151","DOI":"10.1145\/3304133.3304153"},{"key":"BF02983373_CR17","unstructured":"[Lod87] Lodaya, K.: Proof theory for exception handling in distributed programs. Ph.D. Thesis, Tech. Rep. CS-87\/30. TIFR, 1987"},{"issue":"2","key":"BF02983373_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/357094.357100","volume":"2","author":"D.C. Luckham","year":"1980","unstructured":"[LP80] Luckham, D.C., Polak, W.: Ada exception handling: an axiomatic approach. ACM Trans. Prog. Lang. Syst.2 (2), 225\u2013233 (1980)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"4","key":"BF02983373_CR19","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"[MC81] Misra, J., Chandy, K.M.: Proofs of networks of processes. IEEE Trans. Softw. Eng.SE-7 (4), 417\u2013426 (1981) [Also Ossefort, M.: CorrigendumSE-8 (2), 160 (1982)]","journal-title":"IEEE Trans. Softw. Eng."},{"key":"BF02983373_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S.S. Owicki","year":"1976","unstructured":"[OG76] Owicki, S.S., Gries, D.: An axiomatic technique for parallel programs I. Acta Informatica6 319\u2013340 (1976)","journal-title":"Acta Informatica"},{"key":"BF02983373_CR21","volume-title":"Compositional Verification of Distributed Programs","author":"P.K. Pandya","year":"1988","unstructured":"[Pan88] Pandya, P.K.: Compositional Verification of Distributed Programs. Ph.D. Thesis, University of Bombay, TR-CS-88\/3. Tata Institute of Fundamental Research, Bombay, 1988"},{"key":"BF02983373_CR22","unstructured":"[Plo81] Plotkin, G.D.: A structural approach to operational semantics. DAIMI FN-19. Arhus University 1981"},{"key":"BF02983373_CR23","doi-asserted-by":"crossref","unstructured":"[Plo83] Plotkin, G.D.: An operational semantics for CSP. Proc. IFIP Conf. Formal Description of Programming Concepts II, Garmisch-Partenkirchen, 1983, pp. 199\u2013225","DOI":"10.1007\/3-540-11981-7_17"},{"key":"BF02983373_CR24","series-title":"(Lect. Notes Comput. Sci","first-page":"509","volume-title":"Compositionality and concurrent networks: soundness and completeness of a proof system","author":"J. Zwiers","year":"1885","unstructured":"[ZDB85] Zwiers, J., DeRoever, W.P., Van Emde Boas, P.: Compositionality and concurrent networks: soundness and completeness of a proof system. Proc. 12th ICALP, Nafplion. (Lect. Notes Comput. Sci, vol. 194) pp. 509\u2013519. Berlin Heidelberg New York: Springer 1885"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02983373.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02983373\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02983373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:48:26Z","timestamp":1558554506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02983373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF02983373"],"URL":"https:\/\/doi.org\/10.1007\/bf02983373","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}