• DocumentCode
    1954593
  • Title

    Why Are Modalities Good for Interface Theories?

  • Author

    Raclet, Jean-Baptiste ; Badouel, Eric ; Benveniste, Albert ; Caillaud, Benoît ; Passerone, Roberto

  • Author_Institution
    INRIA, Grenoble, France
  • fYear
    2009
  • fDate
    1-3 July 2009
  • Firstpage
    119
  • Lastpage
    127
  • Abstract
    In this paper we revisit the fundamentals of interface theories. Methodological considerations call for supporting ``aspects´´ and ``assume/guarantee´´ reasoning. From these considerations, we show that, in addition to the now classical refinement and substitutability properties of interfaces, two additional operations are needed, namely: conjunction and residuation (or quotient). We draw the attention to the difficulty in handling interfaces having different alphabets --- which calls for alphabet equalization. We show that alphabet equalization must be performed differently for the different operations. Then, we show that modal interfaces, as adapted from the original proposal by Kim Larsen, offer the needed flexibility.
  • Keywords
    algebraic specification; automata theory; reasoning about programs; refinement calculus; alphabet equalization; aspects concept; assume/guarantee reasoning; classical refinement; conjunction operation; methodological consideration; modal I/O automata; modal calculus; modal interface theory; modal specification; residuation operation; substitutability property; Automata; Concurrent computing; Contracts; Power system reliability; Proposals; Refining; Safety; System recovery; Systems engineering and theory; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application of Concurrency to System Design, 2009. ACSD '09. Ninth International Conference on
  • Conference_Location
    Augsburg
  • ISSN
    1550-4808
  • Print_ISBN
    978-0-7695-3697-2
  • Type

    conf

  • DOI
    10.1109/ACSD.2009.22
  • Filename
    5291055