*banner
 

On Relational Interfaces
Stavros Tripakis, Ben Lickly, Tom Henzinger, Edward A. Lee

Citation
Stavros Tripakis, Ben Lickly, Tom Henzinger, Edward A. Lee. "On Relational Interfaces". Technical report, UC Berkeley, 8, May, 2009.

Abstract
In this paper we extend the work of De Alfaro, Henzinger et al, on interface theories for component-based design. Existing interface theories fail to capture functional relations between the inputs and outputs of an interface. For example, a simple interface that takes as input a number n>0 and returns as output n+1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports both stateless and stateful interfaces, includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions.

Electronic downloads

Citation formats  
  • HTML
    Stavros Tripakis, Ben Lickly, Tom Henzinger, Edward A. Lee.
    <a
    href="http://chess.eecs.berkeley.edu/pubs/584.html"
    ><i>On Relational Interfaces</i></a>,
    Technical report,  UC Berkeley, 8, May, 2009.
  • Plain text
    Stavros Tripakis, Ben Lickly, Tom Henzinger, Edward A. Lee.
    "On Relational Interfaces". Technical report,  UC
    Berkeley, 8, May, 2009.
  • BibTeX
    @techreport{TripakisLicklyHenzingerLee09_OnRelationalInterfaces,
        author = {Stavros Tripakis and Ben Lickly and Tom Henzinger
                  and Edward A. Lee},
        title = {On Relational Interfaces},
        institution = {UC Berkeley},
        number = {8},
        month = {May},
        year = {2009},
        abstract = {In this paper we extend the work of De Alfaro,
                  Henzinger et al, on interface theories for
                  component-based design. Existing interface
                  theories fail to capture functional relations
                  between the inputs and outputs of an interface.
                  For example, a simple interface that takes as
                  input a number n>0 and returns as output n+1,
                  cannot be expressed in existing theories. In this
                  paper we provide a theory of relational
                  interfaces, where such input-output relations can
                  be captured. Our theory supports both stateless
                  and stateful interfaces, includes explicit notions
                  of environments and pluggability, and satisfies
                  fundamental properties such as preservation of
                  refinement by composition, and characterization of
                  pluggability by refinement. We achieve these
                  properties by making reasonable restrictions on
                  feedback loops in interface compositions.},
        URL = {http://chess.eecs.berkeley.edu/pubs/584.html}
    }
    

Posted by Stavros Tripakis on 8 May 2009.
Groups: chess naomi ptolemy
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess