Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us Track your research
Search
Cart
Book cover

European Symposium on Programming

ESOP 2007: Programming Languages and Systems pp 64–79Cite as

  1. Home
  2. Programming Languages and Systems
  3. Conference paper
Modal I/O Automata for Interface and Product Line Theories

Modal I/O Automata for Interface and Product Line Theories

  • Kim G. Larsen1,
  • Ulrik Nyman1 &
  • Andrzej Wąsowski1,2 
  • Conference paper
  • 1461 Accesses

  • 113 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4421)

Abstract

Alfaro and Henzinger use alternating simulation in a two player game as a refinement for interface automata [1]. We show that interface automata correspond to a subset of modal transition systems of Larsen and Thomsen [2], on which alternating simulation coincides with modal refinement. As a consequence a more expressive interface theory may be built, by a simple generalization from interface automata to modal automata. We define modal I/O automata, an extension of interface automata with modality. Our interface theory that follows can express liveness properties, disallowing trivial implementations of interfaces, a problem that exists for theories build around simulation preorders. In order to further exemplify the usefulness of modal I/O automata, we construct a behavioral variability theory for product line development.

Keywords

  • Error State
  • Transition Relation
  • Software Product Line
  • Variability Model
  • Synthesis Algorithm

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Chapter PDF

Download to read the full chapter text

References

  1. Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE), Vienna, Austria, pp. 109–120. ACM Press, New York (2001)

    Google Scholar 

  2. Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  3. Chakabarti, A., et al.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, Springer, Heidelberg (2003)

    Google Scholar 

  4. Alfaro, L., Henzinger, T., Stoelinga, M.I.A.: Timed interfaces. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol. 2491, Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  5. Larsen, K.G., Nyman, U.: Interface input/output automata. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 82–97. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  6. Černá, I., Vařeková, P., Zimmerová, B.: Component substitutability via equivalencies of component-interaction automata. In: FACS’06, pp. 115–130. To be published in ENTCS (2006)

    Google Scholar 

  7. Hermanns, H., Rehof, J., Stoelinga, M.I.A. (eds.): Workshop Procedings FIT 2005: Foundations of Interface Technologies. ENTCS. Elsevier Science Publishers, Amsterdam (2005)

    Google Scholar 

  8. Alur, R., et al.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163–178. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  9. Alfaro, L., Henzinger, T.A.: Interface-based design. In: Engineering Theories of Software Intensive Systems, Marktoberdorf Summer School, Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  10. Carrez, C., Fantechi, A., Najm, E.: Assembling components with behavioral contracts. Annales del Télécommunications 60(7–8) (2005)

    Google Scholar 

  11. Parnas, D.L.: On the design and development of program families. IEEE Transactions on Software Engineering 2, 1–9 (1976)

    CrossRef  Google Scholar 

  12. Czarnecki, K., Eisenecker, U.W.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley, Reading (2000)

    Google Scholar 

  13. Pohl, K., Böckle, G., van der Linden, F.: Software Product Line Engineering—Foundations, Principles, and Techniques. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  14. Larsen, K.G., Larsen, U., Wasowski, A.: Color-Blind Specifications for Transformations of Reactive Synchronous Programs. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 160–174. Springer, Heidelberg (2005)

    Google Scholar 

  15. Boudol, G., Larsen, K.G.: Graphical versus logical specifications. In: Arnold, A. (ed.) CAAP 1990. LNCS, vol. 431, pp. 57–71. Springer, Heidelberg (1990)

    Google Scholar 

  16. Larsen, K.G.: Modal specifications. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol. 407, pp. 232–246. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalborg University,  

    Kim G. Larsen, Ulrik Nyman & Andrzej Wąsowski

  2. Computational Logic and Algorithms Group, IT University of Copenhagen,  

    Andrzej Wąsowski

Authors
  1. Kim G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulrik Nyman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Wąsowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rocco De Nicola

Rights and permissions

Reprints and Permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Larsen, K.G., Nyman, U., Wąsowski, A. (2007). Modal I/O Automata for Interface and Product Line Theories. In: De Nicola, R. (eds) Programming Languages and Systems. ESOP 2007. Lecture Notes in Computer Science, vol 4421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71316-6_6

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-540-71316-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-71316-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Publish with us

Policies and ethics

search

Navigation

  • Find a journal
  • Publish with us
  • Track your research

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support
  • Cancel contracts here

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature