Skip to main content
Springer Nature Link
Log in

Towards Semantics of Self-Adaptive Software

  • Conference paper
  • First Online:
Self-Adaptive Software (IWSAS 2000)

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

Included in the following conference series:

Abstract

When people perform computations, they routinely monitor their results, and try to adapt and improve their algorithms when a need arises. The idea of self-adaptive software is to implement this common facility of human mind within the frameworkof the standard logical methods of software engineering. The ubiquitous practice of testing, debugging and improving programs at the design time should be automated, and established as a continuing run time routine. Technically, the taskth us requires combining functionalities of automated software development tools and of runtime environments. Such combinations lead not just to challenging engineering problems, but also to novel theoretical questions. Formal methods are needed, and the standard techniques do not suffice. As a first contribution in this direction, we present a basic mathematical frameworksuitable for describing self-adaptive software at a high level of semantical abstraction. A static view leads to a structure akin to the Chu construction. An dynamic view is given by a coalgebraic presentation of adaptive transducers.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. R.-J. Backand J. Von Wright, The Refinement Calculus: A Systematic Introduction. (Springer 1998)

    Google Scholar 

  2. M. Barr, *-Autonomous Categories. Lecture Notes in Mathematics 752 (Springer, 1979)

    Google Scholar 

  3. J.A. Goguen and R.M. Burstall, Institutions: abstract model theory for speci.cations and programming. J. of the A.C.M. 39(1992) 95–146

    MATH  MathSciNet  Google Scholar 

  4. Y. Gurevich, Evolving algebras 1993: Lipari guide. In: Speci.cation and Validation Methods, ed. E. Börger, (Claredon Press 1995) 9–37

    Google Scholar 

  5. B. Jacobs, Coalgebraic specifications and models of deterministic hybrid systems. In: Proc. AMAST, ed. M. Nivat, Springer Lect. Notes in Comp. Sci. 1101(1996) 520–535

    Google Scholar 

  6. Y. Lafont and T. Streicher, Games semantics for linear logic. Proc 6 th LICS Conf. (IEEE 1991) 43–49

    Google Scholar 

  7. F.W. Lawvere, Functorial Semantics of Algebraic Theories. Thesis (Columbia University, 1963)

    Google Scholar 

  8. M. Makkai and R. Paré, Accessible Categories: The Foundations of Categorical Model Theory. Contemporary Mathematics 104 (AMS 1989)

    Google Scholar 

  9. M. Makkai and G. Reyes, First Order Categorical Logic. Lecture Notes in Mathematics 611 (Springer 1977)

    Google Scholar 

  10. E. Moggi, Notions of computation and monads. Information and Computation 1993

    Google Scholar 

  11. C. Morgan, Programming from Specifications. (Prentice-Hall 1990)

    Google Scholar 

  12. G.C. Necula, Compiling with Proofs. Thesis (CMU 1998)

    Google Scholar 

  13. V.C.V. de Paiva, The Dialectica categories. In: Categories in Computer Science and Logic, J. Gray and A. Scedrov, eds., Contemp. Math. 92 (Amer. Math. Soc., 1989) 47–62

    Google Scholar 

  14. D. Pavlovic, Chu I: cofree equivalences, dualities and *-autonomous categories. Math. Structures in Comp. Sci. 7(1997) 49–73

    Article  MATH  MathSciNet  Google Scholar 

  15. D. Pavlovic, Guarded induction on final coalgebras. E. Notes in Theor. Comp. Sci. 11(1998) 143–160

    Google Scholar 

  16. D. Pavlovic and M. Escardo, Calulus in coinductive form. Proc 13 th LICS Conf. (IEEE 1998) 408–417

    Google Scholar 

  17. D. Pavlovic, Semantics of first order parametric specifications. in: Formal Methods’ 99, J. Woodcockand J. Wing, eds., Springer Lect. Notes in Comp. Sci. 1708(1999) 155–172

    Google Scholar 

  18. G. Plotkin, Structural Operational Semantics. Lecture Notes DAIMI-FN 19(1981)

    Google Scholar 

  19. V. Pratt, Chu spaces and their interpretation as concurrent objects. In: Computer Science Today: Recent Trends and Developments, ed. J. van Leeuwen, Springer Lect. Notes in Comp. Sci. 1000(1995)

    Google Scholar 

  20. J.J.M.M. Rutten, Universal coalgebra: a theory of systems. To appear in Theoret. Comput. Sci.

    Google Scholar 

  21. J. Sztipanivits, G. Karsai and T. Bapty, Self-adaptive software for signal processing. Comm. of the ACM 41/5(1998) 66–73

    Article  Google Scholar 

  22. D. Turi and G.D. Plotkin, Towards a mathematical operational semantics. In: Proc. 12 th LICS Conf. (IEEE 1997) 280–291

    Google Scholar 

  23. D.R. Smith, Derivation of parallel sorting algorithms. In: Parallel Algorithm Derivation and Program Transformation, eds. R. Paige et al. (Kluwer 1993) 55–69

    Google Scholar 

  24. D.R. Smith, Towards a classi.cation approach to design. In: Proc. 5th AMAST, Springer Lect. Notes in Comp. Sci. 1101(1996) 62–84

    Article  Google Scholar 

  25. G. Winskel and M. Nielsen, Presheaves as transition systems. In: Proc. of POMIV 96, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (AMS 1997) 129–140

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kestrel Institute, Palo Alto, USA

    Duško Pavlović

Authors
  1. Duško Pavlović
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dynamic Object Language Labs., Inc., 9 Bartlet St #334, Andover, MA 01810, USA

    Paul Robertson

  2. Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 545 Technology Square (MIT NE43-839), Cambridge, Massachusetts, 02139, USA

    Howie Shrobe

  3. Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 545 Technology Square (MIT NE 43-804), Cambridge, Massachusetts, 02139, USA

    Robert Laddaga

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pavlović, D. (2000). Towards Semantics of Self-Adaptive Software. In: Robertson, P., Shrobe, H., Laddaga, R. (eds) Self-Adaptive Software. IWSAS 2000. Lecture Notes in Computer Science, vol 1936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44584-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44584-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41655-5

  • Online ISBN: 978-3-540-44584-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation