R. Amadio and M. Dam. Reasoning about higher-order processes. In Proceedings of CAAP'95, Lecture Notes in Computer Science, Volume 915, pp. 202--217, Springer Verlag, Berlin, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....The factorisation theorem will be used to transform any process into a triggered agent. Recently, a number of works which use bisimulations similar to context bisimulation have appeared. Amadio [Ama93] uses a similar notion to study the encoding of Plain CHOCS into calculus. Amadio and Dams [AD95] propose an extension of Hennessy and Milner s modal logics which characterises this behavioural equivalence (for the strong case) Hansen and Kleist [HK94] analyse a form of asynchronous higher order calculus and show that late, early and open (this terminology is borrowed from the calculus ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Mosses P. et al. editor, Proceedings of TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, pages 202--216. Springer Verlag, 1995.

....every agent into a triggered agent. Related work. Very recently, a few studies of bisimulations similar to context bisimulation has been conducted. Amadio [Ama93] who has proposed it independently from us uses it to study the encoding of Plain CHOCS into calculus; Amadio and Dams [AD95] propose an extension of Hennessy and Milner s modal logics which characterises this behavioural equivalence; Hansen and Kleist [HK94] have analysed a form of asynchronous higher order calculus and showed that late, early and open (this terminology is borrowed from the calculus literature) ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proceedings of TAPSOFT '95, volume 715 of Lecture Notes in Computer Science. Springer Verlag, 1995. To appear.

....because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second order processes. We show how the logic permits compositional reasoning. In comparison to previous work by Amadio and Dam [2] on the strong case, our modal logic supports derived operators through a complete duality and thus constitutes an appealing extension of Hennessy Milner logic. 1 Introduction First order process calculi like CCS have long been known as a tractable tool for the description of concurrent ....

....Should a dynamic or static scoping discipline be adopted Despite these open questions, certain higher order calculi have received continued attention. One of them is Thomsen s Plain CHOCS [17] which features a static treatment of the restriction operator and a bisimulation based semantics. In [2], Amadio and Dam address the lack of specification formalisms for Plain CHOCS and propose a modal logic which extends Hennessy Milner logic and characterizes strong context bisimulation (called CHOCS bisimulation in [2] Moreover, they present a sound and complete infinitary proof system for the ....

[Article contains additional citation context not shown here]

R.M. Amadio and M. Dam. Reasoning about Higher--order Processes. In P.D. Mosses, M. Nielsens, and M.I. Schwartzbach, editors, Theory and Practice of Software Development, LNCS 915, pages 202--216. Springer, 1995. Proceedings TAPSOFT. 12

....for a Chocs sub calculus not including restriction. We present two completeness results: one for the full specification language using an infinitary system, and one for a special class of so called well described specifications using a finitary system. The results of this work are reported in [1]. What is coordination and what has to do with integration Paolo Ciancarini Dept. of Computer Science, Univ. of Bologna Pza. di Porta S.Donato, 5 40127 Bologna Italy tel. 39 51 354506 fax. 39 51 354510 e mail: cianca cs.unibo.it WWW Home page: http: www.cs.unibo.it cianca index.html ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP 95, Aarhus, 1995.

....because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second order processes. We show how the logic permits compositional reasoning. In comparison to previous work by Amadio and Dam [2] on the strong case, our modal logic supports derived operators through a complete duality and thus constitutes an appealing extension of Hennessy Milner logic. 1 Introduction First order process calculi like CCS have long been known as a tractable tool for the description of concurrent ....

....Not surprisingly, this additional expressive power complicates the theory significantly. Certain higher order calculi have received continued attention. One of them is Thomsen s Plain CHOCS [15] which features a static treatment of the restriction operator and a bisimulation based semantics. In [2], Amadio and Dam address the lack of specification formalisms for Plain CHOCS and propose a modal logic which extends Hennessy Milner logic and characterizes strong context bisimulation (called CHOCS bisimulation in [2] Moreover, they present a sound and complete infinitary proof system for the ....

[Article contains additional citation context not shown here]

R.M. Amadio and M. Dam. Reasoning about Higher--order Processes. In P.D. Mosses, M. Nielsens, and M.I. Schwartzbach, editors, Theory and Practice of Software Development, LNCS 915, pages 202--216. Springer, 1995. Proceedings TAPSOFT.

No context found.

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proceedings of CAAP'95, Lecture Notes in Computer Science, Volume 915, pp. 202--217, Springer Verlag, Berlin, 1995.

....of value passing processes, though only addressing modal properties (no temporal connectives) was obtained by Hennessy and Liu [9] Later work includes [2] that addresses both global and compositional approaches to verification. Higher order communication has also begun to receive attention [1]. Sites currently active in these and related areas include besides SICS, Sussex, INRIA, CMU, and Univ. Victoria (Canada) The modal calculus provides one line of answers to what could constitute a good notion of type for concurrent or distributed programming languages. Indeed if we for a moment ....

....recursive and r.e. languages. Can richer languages than L be found which remains useful, e.g. for the purpose of model checking, or compositional proof Another line of inquiry concerns extensions of L to first order and higher. We have already started this investigation, in the papers [6, 1, 2]. Many issues, however, needs investigation before we can truly claim that we know what the good ways of introducing value passing or more general message passing into temporal logic. Modularisation and interoperability Key to our approach is the use of (1st or higher order) temporal logic as a ....

[Article contains additional citation context not shown here]

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP, Lecture Notes in Computer Science, 915:202--217, 1995. Preliminary version as SICS RR:94--18.

....correctness properties like secrecy and authenticity. Specifically we suggest using a fragment of the modal calculus extended with first order features for names and name generation, and two arrows to account for process input and output. The logic follows quite closely ideas put forward in [4], using a function arrow OE for input dependency, and a second order arrow (OE ) fl for contextual output dependency. The idea is the following: A process waiting to input a parameter x to continue acting as P is written as a lambda abstraction x:P . Dually, a process wanting to output ....

....case that Q 1 has the property OE only if fQ 1 =xgP has the property . The output arrow expresses dependy upon receiving context: The process concretion a: Q 1 ]Q 2 will have the property (OE ) fl just in case x:P has the property OE only if a:fQ 1 =xgP j Q 2 has the property fl. In [4] we showed how this setting could be used to achieve an appropriate level of discriminary power when measured against a strong version of bisimulation equivalence (cf. 9] and we began investigating proof principles for these connectives. Handling contravariant recursion Attempting to write ....

[Article contains additional citation context not shown here]

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202--217, 1995.

....the assertion language. We address, in a game based manner, the semantical basis of this approach, as it applies to the entailment subproblem. Soundness and completeness results are obtained, and examples are shown illustrating some of the concepts. 1 Introduction In a number of recent papers [1, 2, 4, 5, 9] proof theoretical frameworks for compositional verification have been put forward based on Gentzen style sequents of the shape Gamma Delta, where the components of Gamma and Delta are correctness assertions P : OE. Several programming or modelling languages have been considered, including ....

....compositional verification have been put forward based on Gentzen style sequents of the shape Gamma Delta, where the components of Gamma and Delta are correctness assertions P : OE. Several programming or modelling languages have been considered, including CCS [4] the calculus [2] CHOCS [1], general GSOS definable languages [9] and even a significant core fragment of a real programming language, Erlang [5] An important precursor to the above papers is [10] which used ternary sequents to build compositional proof systems for CCS and SCCS vs. Hennessy Milner logic [7] A key idea ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202--217, 1995.

....in Gamma ) this provides a very general and powerful setting for program verification which accomodates both model checking like verification based on global state space exploration, and compositional reasoning. This sort of approach has been examined in a number of recent papers, including [1 4, 7], and traces back to work by Stirling [8] and Winskel [12] Several programming or modelling languages have been considered, including CCS [3] the calculus [2] CHOCS [1] general GSOS definable languages [7] and a core fragment of the distributed functional programming language Erlang [4] ....

....and compositional reasoning. This sort of approach has been examined in a number of recent papers, including [1 4, 7] and traces back to work by Stirling [8] and Winskel [12] Several programming or modelling languages have been considered, including CCS [3] the calculus [2] CHOCS [1], general GSOS definable languages [7] and a core fragment of the distributed functional programming language Erlang [4] including features such as data types, a fairly rich sequential structure, asynchronous buffered communication, and dynamic process creation. The key idea is that the general ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202--217, 1995.

....in part, by the use of explicit fixed point ordinal approximations, and in part by a complete separation, following an approach by Simpson, of rules concerning the logic from the rules encoding the operational semantics of the process language. 1 Introduction In a number of recent papers [1 4, 9] proof theoretical frameworks for compositional verification have been put forward based on Gentzen style sequents of the shape Gamma Delta, where the components of Gamma and Delta are correctness assertions P : OE. Several programming or modelling languages have been considered, including ....

....compositional verification have been put forward based on Gentzen style sequents of the shape Gamma Delta, where the components of Gamma and Delta are correctness assertions P : OE. Several programming or modelling languages have been considered, including CCS [3] the calculus [2] CHOCS [1], general GSOS definable languages [9] and even a significant core fragment of a real programming language, Erlang [4] An important precursor to the above papers is [10] which used ternary sequents to build compositional proof systems for CCS and SCCS vs. Hennessy Milner logic [6] A key idea is ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202--217, 1995.

....limited properties that depend only on a finite part of an otherwise infinite state space (as the compositional model checker of [ASW94] To overcome this problem we embark on a study of compositional proof systems that are not a priori restricted to FR processes. Following work presented in [AD95, Dam95, Sti87] we define a proof system operating on judgments Gamma s p : OE where Gamma is a sequence of the form x 1 : OE 1 ; x n : OE n and s is a finite set of channel names. Such a judgment states properties OE of the process p relative to properties OE i of its components, x i , under a ....

....process p is specified by a system of parametric process equations using prefix and sum, then it is possible to build a system of parametric formula equations having a comparable size. 5 Proof system We develop a proof system supporting the compositional proof of process properties. Following [AD95, Dam95] basic judgments of such a proof system take the form Gamma p : OE where Gamma is a sequence of the form x 1 : OE 1 ; x n : OE n . Such a judgment states properties OE of p relative to properties OE i of its components, x i . In the case of the calculus a main issue is how to cater ....

[Article contains additional citation context not shown here]

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP 95, Aarhus. SLNCS 915, 1995. Preliminary version appeared as SICS RR 94-18, available at http://wwwi3s.unice.fr/¸amadio/.

....a proof system for proving judgments of the form Gamma A : OE where Gamma is a sequence of the form x 1 : OE 1 ; x n : OE n stating assumptions governing the agent variables x i . The proof system follows earlier work on compositional proof systems for CCS [8] higher order processes [1], and the calculus, 2] A delicate issue is how to cater for private names, name generation and scope extrusion. In general one will wish to verify properties of an agent a:A(x) relative to a property of x. Since will in general depend on a a mechanism is required to freeze a to extend ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'94, Lecture Notes in Computer Science, 915:202--217, 1995.

....correctness properties like secrecy and authenticity. Specifically we suggest using a fragment of the modal calculus extended with first order features for names and name generation, and two arrows to account for process input and output. The logic follows quite closely ideas put forward in [3], using a function arrow OE for input dependency, and a second order arrow (OE ) fl for contextual output dependency. The idea is the following: A process waiting to input a parameter x to continue acting as P is written as a lambda abstraction x:P . A process wanting to output to some ....

....that Q 1 has the property OE only if fQ 1 =xgP has the property . The output arrow expresses dependency upon receiving context: The process concretion a: Q 1 ]Q 2 will have the property (OE ) fl just in case x:P has the property OE only if a:fQ 1 =xgP j Q 2 has the property fl. In [3] we showed how this setting could be used to achieve an appropriate level of discriminatory power when measured against a strong version of bisimulation equivalence, and we began investigating proof principles for these connectives. Handling Contravariant Recursion Unfortunately contravariant ....

[Article contains additional citation context not shown here]

R. Amadio and M. Dam. Reasoning about higherorder processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202--217, 1995.

....are created to show the abstractions correct (to show p : q : and that x k y : whenever x : and y : The di culty is dealing in an adequate way with temporal properties. The work has been extended to the calculus (c.f. 2, 31] and, at least partially, to higher order processes [1]. However, much work remains to be done before we can truly claim that veri cation of open, dynamic, and higher order process networks is feasible, theoretically as well as practically. It is certainly clear that both automated and interactive techniques must be brought to bear if this goal is to ....

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'94, Lecture Notes in Computer Science, 915:202-217, 1995.

....scopes are not subject to dynamic change. authenticity. Specifically we suggest using a fragment of the modal calculus extended with first order features for names and name generation, and two arrows to account for process input and output. The logic follows quite closely ideas put forward in [4], using a function arrow OE for input dependency, and a second order arrow (OE ) fl for contextual output dependency. The idea is the following: A process waiting to input a parameter x to continue acting as P is written as a lambda abstraction x:P . Dually, a process wanting to output ....

....that Q 1 has the property OE only if fQ 1 =xgP has the property . The output arrow expresses dependency upon receiving context: The process concretion a: Q 1 ]Q 2 will have the property (OE ) fl just in case x:P has the property OE only if a:fQ 1 =xgP j Q 2 has the property fl. In [4] we showed how this setting could be used to achieve an appropriate level of discriminatory power when measured against a strong version of bisimulation equivalence (cf. 11] and we began investigating proof principles for these connectives. Handling contravariant recursion Attempting to write ....

[Article contains additional citation context not shown here]

R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202--217, 1995.

....use of the global rules. Termination is needed for greatest fixed points only, and the side conditions concerning activity and indexing can be eliminated altogether in favour of the much simpler side condition for Cut that OE is a closed formula. 9 Conclusion A precursor of the present work is [1] where a proof system for a process passing calculus is presented, though recursive specifications are not addressed. The main issues left for future work are analyses of the proof power of the general proof system, and of its practical usefulness. The latter is best evaluated through ....

....the technicalities concerning indexing and activity can in fact be hidden. The only completeness criterion we have considered here is weak completeness for finite state processes. Stronger completeness results are needed, maybe along the lines of the so called well described formulas explored in [1]. In this case rules which are not needed for weak completeness such as distribution (x : OE ( fl) x : OE ) OE fl) and monotonicity under the modal operators (e.g. x : OE x : implies x : hffiOE x : hffi ) must be added. For unguarded recursive process terms our proof system is ....

R. Amadio and M. Dam. Reasoning about higher-order processes. SICS Research report RR:94--18, 1994. To appear in Proc. CAAP'95.

....use of the global rules. Termination is needed for greatest fixed points only, and the side conditions concerning activity and indexing can be eliminated altogether in favour of the much simpler side condition for Cut that OE is a closed formula. 9 Conclusion A precursor of the present work is (Amadio and Dam, 1995) where a proof system for a process passing calculus is presented, though recursive specifications are not addressed. The main issues left for future work are analyses of the proof power of the general proof system, and of its practical usefulness. The latter is best evaluated through ....

....constraining the way fixed point unfoldings can be allowed to interfere. The only completeness criterion we have considered here is weak completeness for finite state processes. Stronger completeness results are needed, maybe along the lines of the so called well described formulas explored in (Amadio and Dam, 1995). In this case rules which are not needed for weak completeness such as distribution (x : OE ( fl) x : OE ) OE fl) and monotonicity under the modal operators (e.g. x : OE x : implies x : hffiOE x : hffi ) must be added. For unguarded recursive process terms our proof system is ....

Amadio, R., and Dam., M. (1995) Reasoning about higher-order processes.

No context found.

Roberto Amadio and Mads Dam. Reasoning about higher-order processes. Technical Report R94-18, Swedish Institute of Computer Science, November 20, 1994.

No context found.

Amadio, Roberto M., Dam, Mads. 1994. Reasoning about Higher-Order Processes. Research Report R94--18. Swedish Institute of Computer Science (SICS).

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