Skip to main content

Algebraic State Machines: Concepts and Applications to Security

  • Conference paper
Perspectives of System Informatics (PSI 2003)

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

  • 424 Accesses

Abstract

The concept of algebraic state machine has been introduced in [3] as a state transition system the states of which are each defined as an algebra, and that communicate through channels.

To make efficient use of this concept, one needs a formal semantics, as well as notions of composition and refinement, which are provided in the present work. To demonstrate their usefulness for an application area of major interest, we show how to extend algebraic state machines with data types modelling cryptographic operations and with an adversary model to reason about security-critical systems. As an example we consider a cryptographic protocol proposed in the literature.

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

Access this chapter

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. Apostolopoulos, V., Peris, V., Saha, D.: Transport layer security: How much does it really cost? In: Conference on Computer Communications (IEEE Infocom), New York (March 1999)

    Google Scholar 

  2. Broy, M., Stølen, K.: Specification and Development of Interactive Systems. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  3. Broy, M., Wirsing, M.: Algebraic state machines. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, p. 89. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. OUP (1995)

    Google Scholar 

  5. Jürjens, J.: A UML statecharts semantics with message-passing. In: Symposium of Applied Computing 2002, March 11-14, pp. 1009–1013. ACM, New York (2002)

    Chapter  Google Scholar 

  6. Jürjens, J.: Formal Semantics for Interacting UML subsystems. In: 5th Interna- tional Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2002), pp. 29–44. IFIP, Kluwer (2002)

    Google Scholar 

  7. Jürjens, J.: Secure Systems Development with UML. Springer, Heidelberg (2003) (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jürjens, J. (2004). Algebraic State Machines: Concepts and Applications to Security. In: Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2003. Lecture Notes in Computer Science, vol 2890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39866-0_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39866-0_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20813-6

  • Online ISBN: 978-3-540-39866-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics