Abstract
This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared variables. However, some universal properties do not appear directly in components specifications and they must be constructed to prove the composed system. Coming up with such universal properties often requires creativity. The paper shows through two examples how this construction can be achieved. The principle used is first presented with a toy example and then applied to a more substantial problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Martffi Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, May 1995.
R.J.R. Back. Refinement of parallel and reactive programs. Technical report, Marktoberdorf Summer School on Programming Logics, 1992.
K. Mani Chandy and Michel Charpentier. An experiment in program composition and proof. Submitted to Formal Methods in System Design, September 1998.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
K. Mani Chandy and Beverly A. Sanders. Predicate transformers for reasoning about concurrent computation. Science of Computer Programming, 24:129–148, 1995.
K. Mani Chandy and Beverly A. Sanders. Reasoning about program composition. Technical Report 96-035, University of Florida, Department of Computer and Information Science and Engineering, 1996.
Michel Charpentier. A Unity mapping operator for distributed programs. In J. Fitzgerald, C.B. Jones, and P. Lucas, editors, Fourth International Symposium of Formal Methods Europe (FME’97) volume 1313 of Lecture Notes in Computer Science, pages 665–684. Springer-Verlag, September 1997.
Pierre Collette. Design of Compositional Proof Systems Based on Assumption-Commitment Specifications. Application to Unity. Doctoral thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, June 1994.
Mamoun Filali, Philippe Mauran, and Gérard Padiou. Raffiner pour répartir. In Actes des quatriemes Rencontres francophones du Parallélisme (RenPar’4), Villeneuve D’Ascq, France, 1992.
S. S. Lam and A. U. Shankar. A theory of interfaces and modules 1: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55–71, January 1994.
C. Morgan, P. Gardiner, K. Robinson, and T. Vickers. On the Refinement Calculus. FACIT. Springer-Verlag, 1994.
Beverly A. Sanders. Eliminating the substitution axiom from Unity logic. Formal Aspects of Computing, 3(2):189–205, April–June 1991.
Rob T. Udink. Program Refinement in Unity-like Environments. PhD thesis, Utrecht University, September 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Charpentier, M., Chandy, K.M. (1999). Examples of program composition illustrating the use of universal properties. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0098004
Download citation
DOI: https://doi.org/10.1007/BFb0098004
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive