A calculus for reasoning about software composition

Theoretical Computer Science

Volumn 331, Issue 2-3, 2005, Pages 367-396

  Achermann, Franz ^a   Nierstrasz, Oscar ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Process calculi; Software architecture; Software components

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; INFORMATION ANALYSIS; INTERFACES (COMPUTER); JAVA PROGRAMMING LANGUAGE; SEMANTICS; SOFTWARE PROTOTYPING; SYNCHRONIZATION; SYNTACTICS;

COMPONENT-BASED SOFTWARE DEVELOPMENT (CBSD); PROCESS CALCULI; SOFTWARE ARCHITECTURE; SOFTWARE COMPONENTS;

DIFFERENTIATION (CALCULUS);

EID: 13444280262     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.022     Document Type: Conference Paper

References (56)

1. M. Abadi, L. Cardelli, P.L. Curien, and J.-J. Lévy Explicit substitutions J. Funct. Programming 1 4 1991 375 416
2. F. Achermann, Forms, agents and channels - defining composition abstraction with style, Ph.D. Thesis, University of Berne, January 2002.
3. F. Achermann, S. Kneubühl, O. Nierstrasz, Scripting coordination styles, in: A. Porto, G.-C. Roman (Eds.), Coordination '2000, Lecture Notes in Computer Science, Vol. 1906, Limassol, Cyprus, September 2000, Springer, Berlin, pp. 19-35.
4. F. Achermann, M. Lumpe, J.-G. Schneider, and O. Nierstrasz Piccola - a small composition language H. Bowman J. Derrick Formal Methods for Distributed Processing - A Survey of Object-Oriented Approaches 2001 Cambridge University Press Cambridge 403 426
5. F. Achermann, O. Nierstrasz, Explicit namespaces, in: J. Gutknecht, W. Weck (Eds.), Modular Programming Languages, Lecture Notes in Computer Science, Vol. 1897, Zürich, Switzerland, September 2000, Springer, Berlin, pp. 77-89.
6. F. Achermann, and O. Nierstrasz Applications = Components + Scripts - a tour of Piccola M. Aksit Software Architectures and Component Technology 2001 Kluwer Dordrecht 261 292
7. F. Arbab, F. Mavaddat, Coordination through channel composition, in: F. Arbab, C. Talcott (Eds.), Coordination Languages and Models: Proc. Coordination 2002, Lecture Notes in Computer Science, Vol. 2315, Springer, Berlin, April 2002, pp. 21-38.
8. K. Asai, H. Masuhara, and A. Yonezawa Partial evaluation of call-by-value λ -calculus with side-effects Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation Amsterdam, the Netherlands June 1997 12-21
9. G. Berry, and G. Boudol The chemical abstract machine Theoret. Comput. Sci. 96 1992 217 248
10. G. Boudol The pi-calculus in direct style Conference Record of POPL' 97 1997 228 241
11. R. Burstall, B. Lampson, A kernel language for abstract data types and modules, Inform. and Comput. 76(2/3), 1984. Also appeared in: Proc. Internat. Symp. on Semantics of Data Types, Springer, Lecture Notes in Computer Science, 1984, and as SRC Research Report 1.
12. R. Burstall, B. Lampson, A kernel language for abstract data types and modules, Inform. and Comput. 76(2/3), 1984. Also appeared in: Proc. Internat. Symp. on Semantics of Data Types, Springer, Lecture Notes in Computer Science, 1984, and as SRC Research Report 1.
13. L. Cardelli, and J.C. Mitchell Operations on records C.A. Gunter J.C. Mitchell Theoretical Aspects of Object-Oriented Programming. Types, Semantics and Language Design 1993 MIT Press Cambridge, MA 295 350
14. C. Consel, and O. Danvy Tutorial notes on partial evaluation Conference Record of POPL' 93 January 1993 ACM New York 493 501
15. S. Dal-Zilio, Le calcul bleu: types et objects, Ph.D. Thesis, Université de Nice - Sophia Antipolis, July 1999 (in French).
16. L. Dami, Software composition: towards an integration of functional and object-oriented approaches, Ph.D. Thesis, University of Geneva, 1994.
17. C. Fournet, and G. Gonthier A hierarchy of equivalences for asynchronous calculi Proc. ICALP '98 1998 844 855
18. C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy, A calculus of mobile agents, in: Proc. 7th Internat. Conf. on Concurrency Theory (CONCUR '96), Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, August 1996, pp. 406-421.
19. D. Garlan, R. Allen, and J. Ockerbloom Architectural mismatch why reuse is so hard IEEE Software 12 6 1995 17 26
20. A.D. Gordon, and P.D. Hankin A concurrent object calculus reduction and typing Proc. HLCL '98 1998 Elsevier ENTCS
21. J.R. Hindley, and J.P. Seldin Introduction to Combinatory Logic and Lambda Calculus 1986 Cambridge University Press Cambridge
22. K. Honda, M. Tokoro, An object calculus for asynchronous communication, in: P. America (Ed.), Proc. ECOOP '91, Lecture Notes in Computer Science, Vol. 512, Geneva, Switzerland, July 1991, Springer, Berlin, pp. 133-147.
23. A. Igarashi, B.C. Pierce, and P. Wadler Featherweight Java a minimal core calculus for Java and GJ ACM TOPLAS 23 3 2001 396 450
24. D. Ingalls, T. Kaehler, J. Maloney, S. Wallace, and A. Kay Back to the future the story of squeak, a practical smalltalk written in itself Proc. OOPSLA '97 November 1997 ACM Press New York 318 326
25. N.J. Jones, C.K. Gomard, and P. Sestoft Partial Evaluation and Automatic Program Generation 1993 Prentice-Hall Englewood Cliffs, NJ
26. S. Kneubühl, Implementing coordination styles in piccola, Informatikprojekt, University of Bern, February 2001.
27. S. Kneubühl, Typeful compositional styles, Diploma Thesis, University of Bern, April 2003.
28. M. Lumpe, A pi-calculus based approach to software composition, Ph.D. Thesis, University of Bern, Institute of Computer Science and Applied Mathematics, January 1999.
29. M. Lumpe, F. Achermann, and O. Nierstrasz A formal language for composition G. Leavens M. Sitaraman Foundations of Component Based Systems 2000 Cambridge University Press Cambridge 69 90
30. M. Lutz Programming Python 1996 O'Reilly & Associates, Inc. Sebastopol, CA
31. M. Merro, D. Sangiorgi, On asynchrony in name-passing calculi, in: K.G. Larsen, S. Skyum, G. Winskel (Eds.), 25th Colloquium on Automata, Languages and Programming (ICALP), Aalborg, Denmark, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, July 1998, pp. 856-867.
32. W.De. Meuter Agora the story of the simplest MOP in the world - or - the scheme of object-orientation J. Noble I. Moore A. Taivalsaari Prototype-based Programming 1998 Springer Berlin
33. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes part, I/II Inform. and Comput. 100 1992 1 77
34. R. Milner, D. Sangiorgi, Barbed bisimulation, in: Proc. ICALP '92, Lecture Notes in Computer Science, Vol. 623, Vienna, July 1992, Springer, Berlin, pp. 685-695.
35. U. Nestmann, B.C. Pierce, Decoding choice encodings, in: U. Montanari, V. Sassone (Eds.), CONCUR'96: Concurrency Theory, Seventh Internat. Conf., Lecture Notes in Computer Science, Vol. 1119, Pisa, Italy, August 1996, Springer, Berlin, pp. 179-194.
36. O. Nierstrasz, Contractual types, Technical Report IAM-03-004, Institut für Informatik, Universität Bern, Switzerland, 2003.
37. O. Nierstrasz, and F. Achermann Supporting compositional styles for software evolution Proc. Internat. Symp. on Principles of Software Evolution (ISPSE 2000) Kanazawa, Japan November 2000 IEEE New York 11 19
38. O. Nierstrasz, F. Achermann, A calculus for modeling software components, in: FMCO 2002 Proc. Lecture Notes in Computer Science, Vol. 2852, Springer, Berlin, 2003, pp. 339-360.
39. O. Nierstrasz, F. Achermann, S. Kneubühl, A guide to JPiccola, Technical Report IAM-03-003, Institut für Informatik, Universität Bern, Switzerland, June 2003.
40. O. Nierstrasz, T.D. Meijler, Requirements for a composition language, in: P. Ciancarini, O. Nierstrasz, A. Yonezawa (Eds.), Object-Based Models and Languages for Concurrent Systems, Lecture Notes in Computer Science, Vol. 924, Springer, Berlin, 1995, pp. 147-161.
41. Shin-ya Nishizaki, Programmable environment calculus as theory of dynamic software evolution, in: Proc. ISPSE 2000, IEEE Computer Society Press, Silver Spring, MD, 2000.
42. C. Pahl, A pi-calculus based framework for the composition and replacement of components, in: Workshop on Specification and Verification of Component-Based Systems (OOPSLA 2001), 2001.
43. B.C. Pierce, and D.N. Turner Pict a programming language based on the pi-calculus G. Plotkin C. Stirling M. Tofte Proof, Language and Interaction Essay in Honour of Robin Milner May 2000 MIT Press Cambridge, MA
44. D. Rémy, Typing Record Concatenation for Free, MIT Press, Cambridge, MA, April 1994, pp. 351-372 (Chapter 10).
45. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, Computer Science Department, University of Edinburgh, May 1993.
46. D. Sangiorgi Asynchronous process calculi the first-order and higher-order paradigms (tutorial) Theoret. Comput. Sci. 253 2001
47. M. Sato, T. Sakurai, R.M. Burstall, Explicit environments, in: J.Y. Girard (Ed.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, Vol. 1581, L'Aquila, Italy, April 1999. Springer, Berlin, pp. 340-354.
48. N. Schärli, Supporting pure composition by inter-language bridging on the meta-level, Diploma Thesis, University of Bern, September 2001.
49. N. Schärli, F. Achermann, Partial evaluation of inter-language wrappers, in: Workshop on Composition Languages, WCL '01, September 2001.
50. A. Schlapbach, Enabling white-box reuse in a pure composition language, Diploma Thesis, University of Bern, January 2003.
51. J.-G. Schneider, Components, scripts, and glue: A conceptual framework for software composition, Ph.D. Thesis, University of Bern, Institute of Computer Science and Applied Mathematics, October 1999.
52. J.-G. Schneider, and O. Nierstrasz Components, scripts, and glue L. Barroca J. Hall P. Hall Software Architectures - Advances and Applications 1999 Springer Berlin 13 25
53. M. Shaw, and D. Garlan Software Architecture Perspectives on an Emerging in Discipline 1996 Prentice-Hall Englewood Cliffs, NJ
54. D. Walker Objects in the π -calculus Inform. and Comput. 116 2 1995 253 271
55. P.T. Wojciechowski, Nomadic pict: language and infrastructure design for mobile computation, Ph.D. Thesis, Wolfson College, University of Cambridge, March 2000.
56. M. Zenger, Type-safe prototype-based component evolution, in: Proc. ECOOP 2002, Lecture Notes in Computer Science, Vol. 2374, Malaga, Spain, June 2002, Springer, Berlin, pp. 470-497.