Abstract
We present a framework for formal reasoning about the behaviour of distributed programs implementing open distributed systems (ODSs). The framework is based on the following key ingredients: a speci fication language based on the µ-calculus, a hierarchical transitional semantics of the implementation language used, a judgment format allowing parametrised behavioural assertions, and a proof system for proving validity of such assertions which includes proof rules for property decomposition. This setting provides the expressive power for behavioural reasoning required by the complex open and dynamic nature of ODSs. The utility of the approach is illustrated on a prototypical ODS.
Work partially supported by the Computer Science Laboratory of Ericsson Utvecklings AB, Stockholm, the Swedish National Board for Technical and Industrial Development (NUTEK) through the ASTEC competence centre, and a Swedish Foundation for Strategic Research Junior Individual Grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Armstrong, R. Virding, C. Wikström, and M. Williams. Concurrent Program-ming in Erlang (Second Edition). Prentice-Hall International (UK) Ltd., 1996.
T. Arts and M. Dam. Verifying a distributed database lookup manager written in Erlang. To appear in Proc. Formal Methods Europe’99, 1999.
T. Arts, M. Dam, L.-äa. Fredlund, and D. Gurov. System description: Verification of distributed Erlang programs. In Proc. CADE’98, Lecture Notes in Artificial Intelligence, vol. 1421, pp. 38–41, 1998.
S. Blau and J. Rooth. AXD 301-a new generation ATM switching system. Ericsson Review, 1:10–17, 1998.
M. Dam, L.-a. Fredlund, and D. Gurov. Toward parametric verification of open distributed systems. In Compositionality: the Significant Difference, H. Langmaack, A. Pnueli and W.-P. de Roever (eds.), Springer, 1536:150–185, 1998.
L. Fredlund. Towards a semantics for Erlang. Unpublished manuscript, Swedish Institute of Computer Science, 1999.
C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
D. Kozen. Results on the propositional µ-calculus. Theoretical Computer Science, 27:333–354, 1983.
R. Milner and M. Tofte. Co-induction in relational semantics. Theoretical Com puter Science, 87:209–220, 1991.
D. Park. Fixpoint induction and proof of program semantics. Machine Intelligence, 5:59–78, 1970.
G. D. Plotkin. A structural approach to operational semantics. Aarhus University report DAIMI FN-19, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fredlund, Lå., Gurov, D. (1999). A Framework for Formal Reasoning about Open Distributed Systems. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-46674-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66856-5
Online ISBN: 978-3-540-46674-1
eBook Packages: Springer Book Archive