Towards mobile processes in Unifying Theories

Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004

Volumn , Issue , 2004, Pages 44-53

  Tang, Xinbei ^a   Woodcock, Jim ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT PROGRAMMING; MOBILE SYSTEMS; PROCESS MOBILITY; UNIFYING THEORIES OF PROGRAMMING (UTP);

ABSTRACTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; SYSTEMS ANALYSIS;

SEMANTICS;

EID: 16244414896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.534624     Document Type: Conference Paper

References (24)

1. F. R. M. Barnes and P. H. Welch. Prioritised dynamic communicating and mobile processes. IEE Proceedings Software, 150(2):121-136, April 2003.
2. Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proceedings of FOSSACS1998. Springer-Verlag, 1998.
3. A. L. C. Cavalcanti, A. C. A. Sampaio, and J. C. P. Woodcock. A refinement strategy for Circus. Formal Aspects of Computing, 2003(15):146-181, 2003.
4. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Engewood Cliffs, 1976.
5. M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the π-calculus. In Proceedings of LICS1996, pages 43-54. IEEE Computer Society Press.
6. Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join calculus. In Proceedings of POPL1996, pages 372-385, 1996.
7. M. Hennessy. A fully abstract denotational model for higherorder processes. In 8th IEEE Symposium On Logic in Computer Science. IEEE Computer Society Press, 1993.
8. C. A. R. Hoare. Communicating Sequential Process. Prentice Hall, 1985.
9. C. A. R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall, 1998.
10. INMOS Limited. occam2.1 reference manual. Technical report, INMOS Limited, May 1995.
11. Robin Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
12. Carrol Morgan. Programming from Specifications. Prentice Hall, second edition, 1998.
13. David A. Naumann. Predicate transformers and higher order programs. Theoretical Computer Science, 150:211-159, 1995.
14. David A. Naumann. Predicate transformer semantics of a higher order imperative language with record subtyping. Science of Computer Programming, 41(1):1-51, 2001.
15. James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Proceedings of POPL1998, pages 378-390, New York, NY, 1998.
16. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
17. D. Sangiorgi. Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. PhD thesis, University of Edinburgh, 1992.
18. Davide Sangiorgi and David Walker. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
19. Ian Stark. A fully abstract domain model for the π-calculus. In Proceedings of the 11th Symposium on Logic in Computer Science, pages 36-42. IEEE Computer Society Press, 1996.
20. Xinbei Tang. Mobile processes in unifying theories. Technical Report 1-04, Computing Laboratory, University of Kent, Canterbury, Kent CT2 7NF, UK, January 2004.
21. Xinbei Tang and Jim Woodcock. Travelling processes. In Dexter Kozen, editor, MPC2004, volume 3125 of LNCS, pages 381-399. Springer-Verlag, July 2004.
22. J. C. P. Woodcock and A. L. C. Cavalcanti. A concurrent language for refinement. In A. Butterfield and C. Paul, editors, Proceedings of IWFM2001, Dublin, Ireland, July 2001.
23. J. C. P. Woodcock and A. L. C. Cavalcanti. The semantics of Circus. In Proceedings of ZB2002, volume 2272 of LNCS, pages. 184-203. Springer-Verlag, 2002.
24. Jim Woodcock and Jim Davies. Using Z: Specification, Refinement and Proof. Prentice Hall, 1996.