L. Caires and L. Monteiro. Verifiable and Executable Specifications of Concurrent Objects in L  . In C. Hankin, editor, Programming Languages and Systems: Proceedings of the 7th European Symp. on Programming (ESOP 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the extension of predicate calculus with the separation operators and the resulting extension of Hoare logic. A more precise name might be storage separation logics, since it is becoming apparent that the underlying idea can be generalized to describe the separation of other kinds of resources [3, 11, 12, 9, 10]. 2. The Programming Language The programming language we will use is the simple imperative language originally axiomatized by Hoare [16, 17] extended with new commands for the manipulation of mutable shared data structures: hcommi : j hvari : cons(hexpi; hexpi) allocation j ....

L. Caires and L. Monteiro. Verifiable and executable specifications of concurrent objects in L . In C. Hankin, editor, Programming Languages and Systems --- ESOP '98, volume 1381 of Lecture Notes in Computer Science, pages 42--56, Berlin, 1998. Springer-Verlag.

No context found.

L. Caires and L. Monteiro. Verifiable and Executable Specifications of Concurrent Objects in L  . In C. Hankin, editor, Programming Languages and Systems: Proceedings of the 7th European Symp. on Programming (ESOP 1998.

....operator. The hiding of a name in a process should correspond, logically, to a hiding quantifier that binds a private name in a formula; such a formula could then describe the use of that private name in the process. The study of such a quantifier, from a logical point of view, was started in [5, 1], and later independently in [8] Our current understanding is that it is best to decompose such a hiding quantifier into two operators: a modal version of the fresh quantifier of Gabbay and Pitts [10] and a logical operator, called revelation [8] that relates to name hiding in strong analogy to ....

....Part I. Expressing this rule in the general case of open formulas, requires introducing explicit transpositions over formulas, which entail some technical complications. Related Work A logic for a process calculus including a tensor operator and a hiding quantifier was developed by Lus Caires in [5, 1], but a satisfactory semantic treatment for the latter connective not was achieved before the contributions of [8, 2] Andy Gordon was a coauthor with Luca Cardelli of initial versions of spatial logics for the Ambient Calculus [7, 8] which also investigated connections with linear logic. The ....

L. Caires and L. Monteiro. Verifiable and Executable Specifications of Concurrent Objects in L . In C. Hankin, editor, Programming Languages and Systems: Proceedings of the 7th European Symp. on Programming (ESOP 1998), number 1381 in Lecture Notes in Computer Science, pages 42--56. Springer-Verlag, 1998.

....operator. The hiding of a name in a process should correspond, logically, to a hiding quantifier that binds a private name in a formula; such a formula could then describe the use of that private name in the process. The study of such a quantifier, from a logical point of view, was started in [5, 1], and later independently in [11] Our current understanding is that it is best to decompose such a hSi Sequents, of the form hSi u 1 : A 1 ; un : An v 1 : B 1 ; vm : Bm A i ; B i Formulas u i ; v j Indexes, members of a process algebra (the worlds) S finite set of constraints ....

....7. Expressing these rules in the general case of open formulas, requires introducing explicit transpositions over formulas, which entail some technical complications. Related Work A logic for a process calculus including a tensor operator and a hiding quantifier was developed by Lus Caires in [5, 1], but a satisfactory semantic treatment for the latter connective not was achieved before the contributions of [11, 2] Andy Gordon was a coauthor with Luca Cardelli of initial versions of spatial logics for the Ambient Calculus [10, 11] which also investigated connections with linear logic. The ....

L. Caires and L. Monteiro. Verifiable and Executable Specifications of Concurrent Objects in L  . In C. Hankin, editor, 7th European Symp. on Programming (ESOP 1998.

....model. From a technical and methodological point of view, we try to attain these general goals at a suitable level of abstraction, that is, minimising any appeal to explicit encodings of concepts like locations. The work reported here was motivated by the want of generalising some ideas laid in [3], where the declarative specification of concurrent mobile objects was addressed in the context of a concrete programming language. Overview. In the model we consider, computation takes place in a stage where a collection of objects and messages are placed in a distributed fashion. To such a ....

L. Caires and L. Monteiro. Verifiable and executable specifications of concurrent objects in L ß . In C. Hankin, editor, ESOP'98 Prog. Lang. and Systems, LNCS. Springer, 1998.

....of mobile process calculi [14] Many programming idioms and paradigms can be reconstructed as fragments of Lpi. On the other hand, Lpi can be used to support executable specification and to motivate combinations of concurrent, functional, logic and object oriented paradigms in a natural way; in [8] we discuss an application of the Lpi framework to the declarative specification of mobile concurrent objects. Lpi is a core language in which five expression forms are used to define interacting agents. It relies just on two kinds of behaviour producing entities, namely messages and commands. ....

....Reduction Semantics of Lpi Here we review the Lpi syntax and formally specify its reduction semantics, basically to provide some background reference for the themes of the next section. A more detailed study of interaction, including a revision of the labelled transition semantics presented in [8], and bisimulation based process equivalences will appear in a forthcoming publication. 3.1 Sorts, Signatures and Terms Definition 3.1 (Sorts) Given nonempty sets B of primitive basic sorts and H of primitive higher sorts, the basic sorts fi and the higher sorts oe are given by b 2 B (nat; ....

L. Caires and L. Monteiro. Verifiable and executable specifications of concurrent objects in L ß . In C. Hankin, editor, ESOP'98 Prog. Lang. and Systems, LNCS. Springer, 1998.

....work, we develop a basic framework for the logical state based specification of processes that interact over data build over expanding signatures. These expansions may be open to the environment, or just local to (part) of a system; this corresponds to adding new local signature elements. In [3] we have presented a specification and verification logic whose essential features are explicit signatures, an hiding quantifier x:A and a monoid operation Omega enabling the expression of disjoint component locations. For instance, a property Omega holds of a system with two components ....

....specification logic [12] for mobile concurrent objects. An interesting development would be, besides the further simplification of this framework, the study of the refinement process for the mobile object specification logic towards the production of executable specifications in the sense of [3]. ....

L. Caires and L. Monteiro. Verifiable and executable specifications of concurrent objects in L ß . In Proceedings of ESOP/ETAPS'98 (to appear), LNCS. Springer, 1998.

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