Towards mobile processes in unifying theories

The paper presents a denotational semantics of mobile processes in Hoare & He's Unifying Theories of Programming (UTP). Process mobility is captured by the mobile assignment or communication of higher-order variables, in which both the source and the target are process-valued variables. Processes are moved around in the system by updating the target and losing the value of the source. The semantics can be used to guarantee the correctness of a set of algebraic of refinement laws for the step-wise development of mobile systems. We give an outline of this development method, present and prove some of the laws.

[1]  Matthew Hennessy A fully abstract denotational model for higher-order processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[2]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[3]  Peter H. Welch,et al.  Prioritised dynamic communicating and mobile processes , 2003, IEE Proc. Softw..

[4]  David A. Naumann,et al.  Predicate transformer semantics of a higher-order imperative language with record subtyping , 2001, Sci. Comput. Program..

[5]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[6]  Davide Sangiorgi,et al.  A Fully-Abstract Model for the (cid:25) -calculus , 2022 .

[7]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[8]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[9]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[10]  Xinbei Tang Mobile Processes in Unifying Theories , .

[11]  Matthew Hennessy A Typed Language for Distributed Mobile Processes , 1998 .

[12]  Augusto Sampaio,et al.  A Refinement Strategy for Circus , 2003, Formal Aspects of Computing.

[13]  Xinbei Tang Mobile Process in Unifying Theories , 2004 .

[14]  Matthew Hennessy A Fully Abstract Denotational Model for Higher-Order Processes , 1994, Inf. Comput..

[15]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[16]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[17]  Jim Woodcock,et al.  A Concurrent Language for Refinement , 2001, IWFM.

[18]  Jim Woodcock,et al.  The Semantics of Circus , 2002, ZB.

[19]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[20]  Davide Sangiorgi,et al.  A Fully Abstract Model for the [pi]-calculus , 1996, Inf. Comput..

[21]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[22]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[23]  David A. Naumann,et al.  Predicate Transformers and Higher-Order Programs , 1995, Theor. Comput. Sci..

[24]  Jim Woodcock,et al.  Travelling Processes , 2004, MPC.

[25]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.