research-article

Interface theories with component reuse

Authors:

Laurent Doyen,

Thomas A. Henzinger,

Barbara Jobstmann,

Tatjana PetrovAuthors Info & Claims

EMSOFT '08: Proceedings of the 8th ACM international conference on Embedded software

Pages 79 - 88

https://doi.org/10.1145/1450058.1450070

Published: 19 October 2008 Publication History

Get Access

Abstract

Interface theories have been proposed to support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can proceed for partial system descriptions, without knowing the interfaces of all components. Independent implementability means that compatible interfaces can be refined separately, maintaining compatibility. We show that these interface theories provide no formal support for component reuse, meaning that the same component cannot be used to implement several different interfaces in a design. We add a new operation to interface theories in order to support such reuse. For example, different interfaces for the same component may refer to different aspects such as functionality, timing, and power consumption. We give both stateless and stateful examples for interface theories with component reuse. To illustrate component reuse in interface-based design, we show how the stateful theory provides a natural framework for specifying and refining PCI bus clients.

References

[1]

R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi. Alternating refinement relations. In Proceedings of CONCUR: Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 163--178. Springer, 1998.

Digital Library

Google Scholar

[2]

A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and F. Y. C. Mang. Synchronous and bidirectional component interfaces. In Proceedings of CAV: Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 414--427. Springer, 2002.

Digital Library

Google Scholar

[3]

A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Resource interfaces. In Proceedings of EMSOFT: Embedded Software, volume 2855 of Lecture Notes in Computer Science, pages 117--133. Springer, 2003.

Crossref

Google Scholar

[4]

L. de Alfaro and T. A. Henzinger. Interface automata. In Proceedings of FSE: Foundations of Software Engineering, pages 109--120. ACM Press, 2001.

Digital Library

Google Scholar

[5]

L. de Alfaro and T. A. Henzinger. Interface theories for component-based design. In Proceedings of EMSOFT: Embedded Software, volume 2211 of Lecture Notes in Computer Science, pages 148--165. Springer, 2001.

Digital Library

Google Scholar

[6]

L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Timed interfaces. In Proceedings of EMSOFT: Embedded Software, volume 2491 of Lecture Notes in Computer Science, pages 108--122. Springer, 2002.

Digital Library

Google Scholar

[7]

T. A. Henzinger and S. Matic. An interface algebra for real-time components. In IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 253--266. IEEE Computer Society, 2006.

Digital Library

Google Scholar

[8]

E. A. Lee and Y. Xiong. System-level types for component-based design. In Proceedings of EMSOFT: Embedded Software, pages 237--253. Springer, 2001.

Digital Library

Google Scholar

[9]

PCI bus power management interface specification revision, 2004. http://www.pcisig.com/specifications/conventional.

Google Scholar

[10]

B. C. Pierce. Types and Programming Languages. MIT Press, 2002.

Digital Library

Google Scholar

[11]

E. Wandeler and L. Thiele. Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling. In Proceedings of EMSOFT: Embedded Software, pages 80--89. ACM Press, 2005.

Digital Library

Google Scholar

[12]

E. Wandeler and L. Thiele. Interface-based design of real-time systems with hierarchical scheduling. In IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 243--252. IEEE Computer Society, 2006.

Digital Library

Google Scholar

Cited By

View all

Iannopollo AIncer ISangiovanni-Vincentelli A(2024)Synthesizing LTL contracts from component libraries using rich counterexamplesScience of Computer Programming10.1016/j.scico.2024.103116236:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.scico.2024.103116
Preoteasa VDragomir ITripakis S(2022)The refinement calculus of reactive systemsInformation and Computation10.1016/j.ic.2021.104819285(104819)Online publication date: May-2022
https://doi.org/10.1016/j.ic.2021.104819
Incer IBenveniste ASangiovanni-Vincentelli ASeshia S(2022)From Interface Automata to HypercontractsPrinciples of Systems Design10.1007/978-3-031-22337-2_23(477-493)Online publication date: 29-Dec-2022
https://doi.org/10.1007/978-3-031-22337-2_23
Show More Cited By

Index Terms

Interface theories with component reuse
1. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
      1. Interface definition languages

Recommendations

A model of component-based programming
FSEN'07: Proceedings of the 2007 international conference on Fundamentals of software engineering

Component-based programming is about how to create application programs from prefabricated components with new software that provides both glue between the components, and new functionality. Models of components are required to support black-box ...
A catalogue of component connectors to support development with reuse

Component-based development is based on the idea of building software systems by composing pre-existing components. Connectors are the 'glue' for composing components. Therefore, it is important to consider connectors as first-class entities and provide ...
Using resemblance to support component reuse and evolution
SAVCBS '06: Proceedings of the 2006 conference on Specification and verification of component-based systems

The aim of a component-based approach to software is to allow the construction of a system by reusing and connecting together a number of existing components. To successfully reuse a component, alterations generally need to be made to it, particularly ...

Comments

Information & Contributors

Information

Published In

EMSOFT '08: Proceedings of the 8th ACM international conference on Embedded software

October 2008

284 pages

ISBN:9781605584683

DOI:10.1145/1450058

Program Chairs:
Luca de Alfaro
University of California, Santa Cruz
,
Jens Palsberg
University of California, Los Angeles

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ESWEEK 08

Sponsor:

ESWEEK 08: Fourth Embedded Systems Week

October 19 - 24, 2008

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
486
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Iannopollo AIncer ISangiovanni-Vincentelli A(2024)Synthesizing LTL contracts from component libraries using rich counterexamplesScience of Computer Programming10.1016/j.scico.2024.103116236:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.scico.2024.103116
Preoteasa VDragomir ITripakis S(2022)The refinement calculus of reactive systemsInformation and Computation10.1016/j.ic.2021.104819285(104819)Online publication date: May-2022
https://doi.org/10.1016/j.ic.2021.104819
Incer IBenveniste ASangiovanni-Vincentelli ASeshia S(2022)From Interface Automata to HypercontractsPrinciples of Systems Design10.1007/978-3-031-22337-2_23(477-493)Online publication date: 29-Dec-2022
https://doi.org/10.1007/978-3-031-22337-2_23
Incer IBenveniste ASangiovanni-Vincentelli ASeshia S(2022)HypercontractsNASA Formal Methods10.1007/978-3-031-06773-0_36(674-692)Online publication date: 24-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-06773-0_36
Eiter TKaminski T(2020)Pruning external minimality checking for answer set programs using semantic dependenciesArtificial Intelligence10.1016/j.artint.2020.103402(103402)Online publication date: Oct-2020
https://doi.org/10.1016/j.artint.2020.103402
Janssen R(2020)Combining Partial Specifications using Alternating Interface AutomataFundamental Approaches to Software Engineering10.1007/978-3-030-45234-6_23(462-481)Online publication date: 17-Apr-2020
https://doi.org/10.1007/978-3-030-45234-6_23
Reineke JStergiou CTripakis S(2019)Basic problems in multi-view modelingSoftware and Systems Modeling (SoSyM)10.1007/s10270-017-0638-118:3(1577-1611)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10270-017-0638-1
Gareis JLüttgen GSchinko AVogler W(2019)Interface Automata for Shared MemoryModels, Mindsets, Meta: The What, the How, and the Why Not?10.1007/978-3-030-22348-9_10(151-166)Online publication date: 26-Jun-2019
https://doi.org/10.1007/978-3-030-22348-9_10
Westman JNyberg M(2018)Conditions of contracts for separating responsibilities in heterogeneous systemsFormal Methods in System Design10.1007/s10703-017-0294-752:2(147-192)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s10703-017-0294-7
Aichernig BHörmaier KLorber FNiăźKović DTiran S(2017)Require, test, and trace ITInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-016-0444-z19:4(409-426)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s10009-016-0444-z
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A model of component-based programming

A catalogue of component connectors to support development with reuse

Using resemblance to support component reuse and evolution

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A model of component-based programming

A catalogue of component connectors to support development with reuse

Using resemblance to support component reuse and evolution

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations