K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of Exceptions. In E.-R. Olderog, editor, Proceedings of the IFIP Working Conference on Programming Concepts, Methods, and Calculi, pp. 447--466. June 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....This simpli es the type of state transformers, at the expense of complicating the state space (certainly when the other forms of abrupt termination are taken into account) and makes the handling of the various cases less transparent. The axiomatic semantics of exceptions is studied in for example [5, 18, 17] (mostly via a weakest precondition calculus) involving a single possible exception, and not many forms of abrupt termination (like in Java) This paper starts with two introductory sections. First there is a brief account of the simple type theory that will be used, concentrating on labeled ....

K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of exceptions. In E.- R. Olderog, editor, Programming Concepts, Methods and Calculi, pages 447-466. North-Holland, 1994.

....termination. From: T. Maibaum (ed) Fundamental Approaches to Software Engineering (FASE 00) Springer LNCS 1783, p.284 303, 2000. The second contribution consists of a concrete and detailed elaboration and adaptation of existing approaches to programming logics with exceptions, notably from [9, 22, 21] (which are mostly in weakest precondition form) This elaboration and adaptation will be done for a real world programming language like Java. Although the basic ideas used here are the same as in [9, 22, 21] the elaboration is di erent. For example, we have many forms of abrupt termination, and ....

....and adaptation of existing approaches to programming logics with exceptions, notably from [9, 22, 21] which are mostly in weakest precondition form) This elaboration and adaptation will be done for a real world programming language like Java. Although the basic ideas used here are the same as in [9, 22, 21], the elaboration is di erent. For example, we have many forms of abrupt termination, and not just one sole exception, and we have a semantics of statements and expressions as particular functions (actually coalgebras, or maps in a Kleisli category, see [18] and not a semantics of traces. The ....

[Article contains additional citation context not shown here]

R. Leino and J. van de Snepscheut. Semantics of exceptions. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, pages 447-466. North-Holland, 1994.

....which is especially tailored to java. The proof rules that are discussed here are heavily used in the Vector case study described below. Our Hoare logic extension is a concrete and detailed elaboration and adaptation of existing approaches to programming logics with exceptions, notably from [Chr84,LvdS94,Lei95] which are mostly in weakest precondition form) Although the basic ideas used here are the same as in [Chr84,LvdS94,Lei95] the elaboration is di erent. For example, in this elaboration many forms of abrupt termination are considered, and not just one sole exception. Also, a semantics of ....

....below. Our Hoare logic extension is a concrete and detailed elaboration and adaptation of existing approaches to programming logics with exceptions, notably from [Chr84,LvdS94,Lei95] which are mostly in weakest precondition form) Although the basic ideas used here are the same as in [Chr84,LvdS94,Lei95] the elaboration is di erent. For example, in this elaboration many forms of abrupt termination are considered, and not just one sole exception. Also, a semantics of statements and expressions as particular functions is used (as described in Section 3) and not a semantics of traces. ....

K.R.M. Leino and J. van de Snepscheut. Semantics of exceptions. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, pages 447{ 466. North-Holland, 1994.

....described here is not especially focused on Java, and may apply to other languages with similar forms of abrupt termination. The second contribution consists of a concrete and detailed elaboration and adaptation of existing approaches to programming logics with exceptions, notably from [Chr84,LvdS94,Lei95] which are mostly in weakest precondition form) This elaboration and adaptation will be done for a real world programming language like Java. Although the basic ideas used here are the same as in [Chr84,LvdS94,Lei95] the elaboration is different. For example, we have many forms of abrupt ....

....existing approaches to programming logics with exceptions, notably from [Chr84,LvdS94,Lei95] which are mostly in weakest precondition form) This elaboration and adaptation will be done for a real world programming language like Java. Although the basic ideas used here are the same as in [Chr84,LvdS94,Lei95] the elaboration is different. For example, we have many forms of abrupt termination, and not just one sole exception, and we have a semantics of statements and expressions as particular functions (actually coalgebras) and not a semantics of traces. Regarding the semantics that we shall ....

[Article contains additional citation context not shown here]

K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of exceptions. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, pages 447--466. North-Holland, 1994. 21

No context found.

K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of Exceptions. In E.-R. Olderog, editor, Proceedings of the IFIP Working Conference on Programming Concepts, Methods, and Calculi, pp. 447--466. June 1994.

....contributions, collectively, are steps toward making modular programs more reliable. Part I Part II Part III Ch. 0 Ch. 1 Ch. 2 Ch. 3 Ch. 4 Ch. 5 Ch. 6 Ch. 7 Ch. 8 Ch. 9 Ch. 10 Ch. 11 Ch. 12 Ch. 13 Figure 0.0: Roadmap to dependencies between chapters 0.1. 0 Outline Compiled from sources like [17, 70, 67, 51], I kick off Part I, Control Structures, by presenting a mathematical semantics, based on weakest preconditions, of sequential imperative programming constructs for languages with exceptions (Chapter 1) Then, for the duration of a few chapters, I devote my attention to the control flow of ....

....that contain the new work presented in this thesis. The other chapters present pertinent material from the literature, composed and presented in such a way as to set the stage for the chapters containing new material. Most of Chapters 1 and 6 is a composition of well known work in semantics (cf. [17, 51, 70, 67, 2, 40, 29, 33]) Chapters 2 4 contain joint work with Jan L.A. van de Snepscheut, and are published in [51] Although the program in Chapter 5 occurs in [51] the derivation of this program and the heuristic used in that process appear first in [50] Chapter 7 is based on [40, 37, 17, 58] and the first part ....

[Article contains additional citation context not shown here]

K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of exceptions. In E.- R. Olderog, editor, Proceedings of the IFIP WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods, and Calculi, San Miniato, Italy, 6--10 June 1994, pages 447--466. Elsevier, 1994.

....composition in terms of ordinary function application. We show how these concepts can be used to define the semantics of a programming language with exceptions. In particular, we show how exceptions can be described in terms of the IF statement. This work generalizes the concepts introduced in [6]. 2. THEORY OF CONDITIONAL COMPOSITION We generalize the concept of function composition to conditional function composition. To enable us to do so, we use tagged collections (described next) which can be used to represent lists, arrays, or any other labeled collection of objects. Our proof ....

....with an additional conditional composition operator a p , where p is a predicate on U . Imposing a structure on the predicates used for the weakest precondition semantics allows us to identify the composition operators presented earlier with the composition of statements. We follow the path of [6] and [7] which first describe an operational semantics in terms of traces and then derive a weakest precondition semantics from it. 3.1. TRACE SEMANTICS We will use the semantics of statements presented in [7] and [4] We use X to denote the (non empty) state space. Variables that refer to the ....

[Article contains additional citation context not shown here]

K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of Exceptions. In E.-R. Olderog, editor, Proceedings of the IFIP Working Conference on Programming Concepts, Methods, and Calculi, pp. 447--466. June 1994.

No context found.

K.R.M. Leino and J.L.A. van de Snepscheut. Semantics of exceptions. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, pages 447--466. North-Holland, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC