Abstract
We classify component-based models of computation into component models and interface models. A component model specifies for each component howthe component behaves in an arbitrary environment; an interface model specifies for each component what the component expects from the environment. Component models support compositional abstraction, and therefore component-based verification. Interface models support compositional refinement, and therefore componentbased design. Many aspects of interface models, such as compatibility and refinement checking between interfaces, are properly viewed in a gametheoretic setting, where the input and output values of an interface are chosen by different players.
This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA ITO grant F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF ITR grant CCR-0085949.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15:7–48, 1999.
R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In 38th Symp. Foundations of Computer Science, pp. 100–109. IEEE Computer Society Press, 1997.
R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi. Alternating refinement relations. In Concurrency Theory, LNCS 1466, pp. 163–178. Springer-Verlag, 1998.
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
L. de Alfaro and T. A. Henzinger. Interface automata. In 9th Symp. Foundations of Software Engineering. ACM Press, 2001.
L. de Alfaro, T. A. Henzinger, and F. Y. C. Mang. The control of synchronous systems. In Concurrency Theory, LNCS 1877, pp. 458–473. Springer-Verlag, 2000.
L. de Alfaro, T. A. Henzinger, and F. Y. C. Mang. The control of synchronous systems, part II. In Concurrency Theory, LNCS, Springer-Verlag, 2001.
D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speedindependent Circuits. MIT Press, 1989.
T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Decomposing refinement proofs using assume-guarantee reasoning. In Int. Conf. Computer-aided Design, pp. 245–252. IEEE Computer Society Press, 2000.
L. Lamport. The temporal logic of actions. ACM Trans. Programming Languages and Systems, 16:872–923, 1994.
E. A. Lee. What’s ahead for embedded software? IEEE Computer Magazine, 33:18–26, 2000.
E. A. Lee. Overview of the Ptolemy Project. Technical Memorandum UCB/ERLM01/ 11, University of California, Berkeley, 2001.
N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
J. Rumbaugh, G. Booch, and I. Jacobson. The UML Reference Guide. Addison-Wesley, 1999.
N. Shankar. Lazy compositional verification. In Compositionality: The Significant Difference, LNCS 1536, pp. 541–564. Springer-Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Alfaro, L., Henzinger, T.A. (2001). Interface Theories for Component-Based Design. In: Henzinger, T.A., Kirsch, C.M. (eds) Embedded Software. EMSOFT 2001. Lecture Notes in Computer Science, vol 2211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45449-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-45449-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42673-8
Online ISBN: 978-3-540-45449-6
eBook Packages: Springer Book Archive