Abstract
We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of Hennessy-Milner logic including a constructive implication, or function space constructor. This result is a non-trivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present a sound proof system 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.
Partially supported by ESPRIT BRA 6454 CONFER. Part of the work was done while visiting SICS.
Partially supported by ESPRIT BRA 8130 LOMAPS.
Chapter PDF
Similar content being viewed by others
References
S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161–218, 1991.
R. Amadio. On the reduction of chocs bisimulation to π-calculus bisimulation. In Proc. CONCUR 93, Hildesheim, pages 112–126. SLNCS 715, 1993. Also appeared as Research Report Inria-Lorraine 1786, October 1992.
G. Boudol. Towards a lambda calculus for concurrent and communicating systems. SLNCS, 351, 1989. In Proc. TAPSOFT.
M. Dam. Model checking mobile processes. In Proc. CONCUR'93, Lecture Notes in Computer Science, 715:22–36, 1993. Full version in SICS report RR94:1, 1994.
A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121–160, 1989.
M. Hennessy. A denotational model for higher-order processes. In Proc. IEEE-LICS, 1993.
M. Hennessy and X. Liu. A modal logic for message passing processes. Dept. of Computer Science, University of Sussex, Report 3/93, 1993.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137–162, 1985.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. TCS, 114:149–171, 1993.
F. Nielsen. The typed lambda calculus with first class processes. Springer Lecture Notes in Computer Science, 366, 1989. In Proc. PARLE.
A. Pitts and I. Stark. What's new? In Proc. Mathematical Foundations of Computer Science, Gdańsk, Poland. SLNCS 711, 1993.
J. Reppy. Cml: A higher-order concurrent language. In Proc. ACM-SIGPLAN 91, Conf. on Prog. Lang. Design and Impl., 1991.
D. Sangiorgi. Expressing mobility in process algebras: first-order and higher order paradigms. PhD thesis, University of Edinburgh, September 1992.
C. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311–347, 1987.
C. Stirling. Modal and temporal logics. In Handbook of Logic in Computer Science Vol. 2, Oxford University Press, 1992.
B. Thomsen. A calculus of higher order communicating systems. PhD thesis, Imperial College, London, 1990.
B. Thomsen. Plain chocs. Acta Informatica, 30:1–59, 1993. Also appeared as TR 89/4, Imperial College, London.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amadio1, R.M., Dam, M. (1995). Reasoning about higher-order processes. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_196
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_196
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive