Skip to main content
SpringerLink
Log in

On Refinement of Generic State-Based Software Components

  • Conference paper
Algebraic Methodology and Software Technology (AMAST 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3116))

Abstract

This paper characterizes refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs.

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. Allen, R., Garlan, D.: A formal basis for architectural connection. ACM TOSEM 6(3), 213–249 (1997)

    Article  Google Scholar 

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

    Google Scholar 

  3. Barbosa, L.S., Oliveira, J.N.: State-based components made generic. In: Gumm, H.P. (ed.) CMCS 2003. Elect. Notes in Theor. Comp. Sci., vol. 82.1 (2003)

    Google Scholar 

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

    Google Scholar 

  5. Degano, P., Gorrieri, R., Rosolini, G.: A categorical view of process refinement. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol. 666, pp. 138–154. Springer, Heidelberg (1993)

    Google Scholar 

  6. Derrick, J., Boiten, E.: Calculating upward and downward simulations of statebased specifications. Information and Software Technology 41, 917–923 (1999)

    Article  Google Scholar 

  7. Fokkinga, M., Eshuis, R.: Comparing refinements for failure and bisimulation semantics. Technical report, Faculty of Computing Science, Enschede (2000)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Jacobs, B., Hughes, J.: Simulations in coalgebra. In: Gumm, H.P. (ed.) CMCS 2003, Warsaw, April 2003. Elect. Notes in Theor. Comp. Sci., vol. 82.1 (2003)

    Google Scholar 

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

    MATH  Google Scholar 

  11. Liskov, B.: Data abstraction and hierarchy. SIGPLAN Notices 23(3) (1988)

    Google Scholar 

  12. Meng, S., Aichernig, B.: Towards a Coalgebraic Semantics of UML: Class Diagrams and Use Cases. Technical Report 272, UNU/IIST (January 2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  17. Woodcock, J., Davies, J.: Using Z: Specification, Refinement and Proof. Prentice-Hall International, Englewood Cliffs (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LMAM, School of Mathematical Science, Peking University, China

    Sun Meng

  2. Department of Informatics, Minho University, Portugal

    Luís S. Barbosa

Authors
  1. Sun Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís S. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Stirling, FK9 4LA, Stirling, UK

    Charles Rattray

  2. University of Stirling, FK9 4LA, Stirling

    Savitri Maharaj

  3. Department of Computing Science and Mathematics, University of Stirling, FK9 4LA, Stirling, UK

    Carron Shankland

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, S., Barbosa, L.S. (2004). On Refinement of Generic State-Based Software Components. In: Rattray, C., Maharaj, S., Shankland, C. (eds) Algebraic Methodology and Software Technology. AMAST 2004. Lecture Notes in Computer Science, vol 3116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27815-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27815-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22381-8

  • Online ISBN: 978-3-540-27815-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation