Skip to main content
SpringerLink
Log in

A Perspective on Component Refinement

  • Conference paper
Formal Methods for Components and Objects (FMCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3657))

Included in the following conference series:

Abstract

This paper provides an overview of an approach to coalgebraic modelling and refinement of state-based software components, summing up some basic results and introducing a discussion on the interplay between behavioural and classical data refinement. The approach builds on coalgebra theory as a suitable tool to capture observational semantics and to base an abstract characterisation of possible behaviour models for components (from partiality to different degrees of non-determinism).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial, J.R.: The B Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Aczel, P., Mendler, N.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357–365. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  3. Arbab, F.: Abstract behaviour types: a foundation model for components and their composition. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 33–70. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Backhouse, R.C., Hoogendijk, P.F.: Elements of a relational theory of datatypes. In: Möller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol. 755, pp. 7–42. Springer, Heidelberg (1993)

    Google Scholar 

  5. Backhouse, R.C., Jansson, P., Jeuring, J., Meertens, L.: Generic programming: An introduction. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol. 1608, pp. 28–115. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Barbosa, L.S.: Components as processes: An exercise in coalgebraic modeling. In: Smith, S.F., Talcott, C.L. (eds.) FMOODS 2000 - Formal Methods for Open Object-Oriented Distributed Systems, pp. 397–417. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  7. Barbosa, L.S.: Towards a Calculus of State-based Software Components. Journal of Universal Computer Science 9(8), 891–909 (2003)

    Google Scholar 

  8. Barbosa, L.S., Oliveira, J.N.: State-based components made generic. In: Peter Gumm, H. (ed.) CMCS 2003. Elect. Notes in Theor. Comp. Sci, vol. 82(1). Elsevier, Amsterdam (2003)

    Google Scholar 

  9. Barbosa, L.S., Sun, M., Aichernig, B.K., Rodrigues, N.: On the semantics of componentware: a coalgebraic perspective. In: He, J., Liu, Z. (eds.) Mathematical Frameworks for Component Software: Models for Analysis and Synthesis. Series on Component-Based Development. World Scientific, Singapore (2005)

    Google Scholar 

  10. Barbosa, M.A., Barbosa, L.S.: Specifying software connectors. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 52–67. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Benabou, J.: Introduction to bicategories. Springer Lect. Notes Maths. (47), 1–77 (1967)

    Article  MathSciNet  Google Scholar 

  12. van Benthem, J.: Modal Correspondence Theory. Ph.D. thesis, University of Amsterdam (1976)

    Google Scholar 

  13. Bergner, K., Rausch, A., Sihling, M., Vilbig, A., Broy, M.: A Formal Model for Componentware. In: Leavens, G.T., Sitaraman, M. (eds.) Foundations of Component-Based Systems, pp. 189–210. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  14. Bird, R.: Functional Programming Using Haskell. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1998)

    Google Scholar 

  15. Bird, R., Moor, O.: The Algebra of Programming. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1997)

    Google Scholar 

  16. Broy, M.: Semantics of finite and infinite networks of communicating agents. Distributed Computing (2) (1987)

    Google Scholar 

  17. Gelernter, D., Carrier, N.: Coordination languages and their significance. Communication of the ACM 2(35), 97–107 (1992)

    Article  Google Scholar 

  18. Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica 1, 271–281 (1972)

    Article  MATH  Google Scholar 

  19. Hoogendijk, P.F.: A generic theory of datatypes. Ph.D. thesis, Department of Computing Science, Eindhoven University of Technology (1996)

    Google Scholar 

  20. Jacobs, B.: Objects and classes, co-algebraically. In: Lengauer, C., Freitag, B., Jones, C.B., Schek, H.-J. (eds.) Object-Orientation with Parallelism and Persistence, pp. 83–103. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  21. Jacobs, B., Hughes, J.: Simulations in coalgebra. In: Peter Gumm, H. (ed.) CMCS 2003, Warsaw. Elect. Notes in Theor. Comp. Sci, vol. 82(1) (April 2003)

    Google Scholar 

  22. Jacobs, B.: Exercises in coalgebraic specification. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol. 2297, pp. 237–280. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Jones, C.B.: Systematic Software Development Using Vdm. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1986)

    MATH  Google Scholar 

  24. Katis, P., Sabadini, N., Walters, R.F.C.: Bicategories of processes. Journal of Pure and Applied Algebra 115(2), 141–178 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  25. Katis, P., Sabadini, N., Walters, R.F.C.: On the algebra of systems with feedback and boundary. Rendiconti del Circolo Matematico di Palermo II(63), 123–156 (2000)

    Google Scholar 

  26. Kock, A.: Strong functors and monoidal monads. Archiv für Mathematik 23, 113–120 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  27. Mealy, G.H.: A method for synthesizing sequential circuits. Bell Systems Techn. Jour. 34(5), 1045–1079 (1955)

    MathSciNet  Google Scholar 

  28. Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 124–144. Springer, Heidelberg (1991)

    Google Scholar 

  29. Meng, S., Barbosa, L.S.: On refinement of generic software components. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 506–520. Springer, Heidelberg (2004); Best Student Co-authored paper Award

    Chapter  Google Scholar 

  30. Meng, S., Barbosa, L.S.: Components as coalgebras: The refinement dimension. Theor. Comp. Sci. (2005) (accepted for publication)

    Google Scholar 

  31. Milner, R.: Communication and Concurrency. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1989)

    MATH  Google Scholar 

  32. Nierstrasz, O., Achermann, F.: A calculus for modeling software components. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 339–360. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  33. Oaks, S., Wong, H.: Jini in a Nutshell. O’Reilly and Associates, Sebastopol (2000)

    Google Scholar 

  34. Oliveira, J.N.: A reification calculus for model-oriented software specification. Formal Aspects of Computing 2(1), 1–23 (1990)

    Article  MathSciNet  Google Scholar 

  35. Oliveira, J.N.: Software reification using the Sets calculus. In: Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK, January 8-10, pp. 140–171. Springer, Heidelberg (1992)

    Google Scholar 

  36. Oliveira, J.N., Rodrigues, C.J.: Transposing relations: From maybe functions to hash tables. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 334–356. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  37. Papadopoulos, G., Arbab, F.: Coordination models and languages. In: Advances in Computers — The Engineering of Large Systems, vol. 46, pp. 329–400 (1998)

    Google Scholar 

  38. Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 561–572. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  39. Poll, E.: A coalgebraic semantics of subtyping. Theorectical Informatica and Apllications 35(1), 61–82 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  40. Reichel, H.: An approach to object semantics based on terminal co-algebras. Math. Struct. in Comp. Sci. 5, 129–152 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  41. de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison, vol. 47. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  42. Rutten, J.: Universal coalgebra: A theory of systems. Theor. Comp. Sci., 249(1), 3–80 (Revised version of CWI Techn. Rep. CS-R9652 (2000)

    Google Scholar 

  43. Schneider, J.-G., Nierstrasz, O.: Components, scripts, glue. In: Barroca, L., Hall, J., Hall, P. (eds.) Software Architectures - Advances and Applications, pp. 13–25. Springer, Heidelberg (1999)

    Google Scholar 

  44. Segerberg, K.: An essay in classical modal logic. Filosofiska Studier (13) (1971)

    Google Scholar 

  45. Spivey, J.M.: The Z Notation: A Reference Manual, 2nd edn. Series in Computer Science. Prentice Hall International, Englewood Cliffs (1992)

    Google Scholar 

  46. Szyperski, C.: Component Software, Beyond Object-Oriented Programming. Addison-Wesley, Reading (1998)

    Google Scholar 

  47. The RAISE Language Group. In: The RAISE Specification Language. Prentice Hall International, Englewood Cliffs (1992)

    Google Scholar 

  48. Turi, D., Rutten, J.: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Math. Struct. in Comp. Sci. 8(5), 481–540 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  49. Wadler, P., Weihe, K.: Component-based programming under different paradigms. Technical report, Dagstuhl Seminar 99081 (February 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DI – CCTC, Universidade do Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Luís S. Barbosa

Authors
  1. Luís S. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Mathematics and Computer Science, CWI, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Frank S. de Boer

  2. Leiden Institute of Advanced Computer Science, Leiden University, P.O. Box 9512, 2300, Leiden, RA, The Netherlands

    Marcello M. Bonsangue

  3. Centre Equitation, VERIMAG, 2 Avenue de Vignate, 38610, Grenoble-Gières, France

    Susanne Graf

  4. Institute of Computer Science and Applied Mathematics, Christian-Albrechts University Kiel, Hermann-Rodewald-Straße 3, 24118, Kiel, Germany

    Willem-Paul de Roever

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barbosa, L.S. (2005). A Perspective on Component Refinement. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2004. Lecture Notes in Computer Science, vol 3657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561163_2

Download citation

  • DOI: https://doi.org/10.1007/11561163_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29131-2

  • Online ISBN: 978-3-540-31939-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation