| R. De Nicola and M. Loreti. A modal logic for Klaim. In T. Rus, editor, Proc. of Algebraic Methodology and Software Technology, 8th Int. Conf. AMAST 2000. |
....Process identi ers are used in recursive process de nitions. It is assumed that each process identi er A has a single de ning equation A( e X; e u; e x) def = P , where all free variables in P are contained in f e X; e u; e xg. A Klaim labeled operational semantics has been presented in [10, 11]. In this semantics labels carry information about the action performed in the net. The formal syntax of labels is de ned as follows: a : o(s 1 ; et; s 2 ) i(s 1 ; et; s 2 ) r(s 1 ; et; s 2 ) e(s 1 ; P; s 2 ) n(s 1 ; s 2 ) A label represents the intended operation and has the form x(s 1 ....
R. De Nicola and M. Loreti. A Modal Logic for Klaim. In T. Rus, editor, Proc of Algebraic Methodology and Software Technology, 8th Int. Conf. AMAST
....applications, mobile agents, and, more in general, mobile code. An interesting spin o of 12 Bettini, De Nicola, Pugliese our approach is that since it is based upon the Klaim formal model, some properties of systems can be formally established. Indeed, a modal logic for Klaim is being studied [17] and a system to automatically prove Klaim system properties is under development. A number of extensions have been made to the original Klaim model of computation. In [15,16] Klaim is extended with a capability based type system that provides direct support for expressing and for using policies ....
De Nicola, R. and M. Loreti, A Modal Logic for Klaim, in: T. Rus, editor, Proc of Algebraic Methodology and Software Technology, 8th Int. Conf. AMAST
....supplies means to move processes and all the code they will need for execution on remote sites. An interesting spin o of our approach is that since Klava is based upon Klaim formal model, some properties of systems could be formally established. Indeed, a modal logic for Klaim is being studied [21] and a system to automatically prove Klaim system properties is under development. Klava is also used as the run time system for X Klaim [7] a programming language obtained by extending the kernel language Klaim with a few high level programming constructs such as variable declarations, ....
R. De Nicola and M. Loreti. A Modal Logic for Klaim. In T. Rus, editor, Proc of Algebraic Methodology and Software Technology, 8th Int. Conf. AMAST
....Proc for the set of KLAIM processes and Act for the set of KLAIM actions. 2.1 Operational Semantics In this section, we present a labeled operational semantics for KLAIM. The original operational semantics was unlabeled [8] A labeled one, based on structural congruence, has been introduced in [9]. The semantics proposed here is labeled and does not rely on structural congruence. This simplifies its use as a model for the logic. The semantics of KLAIM is given in two steps. The first one captures availability of resources and the resources requests put forward by processes. The second one ....
Rocco De Nicola and Michele Loreti. A modal logic for KLAIM. In T. Rus, editor, AMAST: 8th International Conference on Algebraic Methodology and Software Technology, volume 1816 of LNCS, pages 339--354, 2000.
No context found.
R. De Nicola and M. Loreti. A modal logic for Klaim. In T. Rus, editor, Proc. of Algebraic Methodology and Software Technology, 8th Int. Conf. AMAST 2000.
No context found.
R. De Nicola and M. Loreti. A modal logic for Klaim. In T. Rus, editor, Proc. of Algebraic Methodology and Software Technology, 8th Int. Conf. AMAST 2000.
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