Interface Theories for Component-Based Design
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.
KeywordsOutput Port Input Port Input Move Interface Description Interface Theory
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.Google Scholar
- L. de Alfaro and T. A. Henzinger. Interface automata. In 9th Symp. Foundations of Software Engineering. ACM Press, 2001.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speedindependent Circuits. MIT Press, 1989.Google Scholar
- 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.Google Scholar
- E. A. Lee. What’s ahead for embedded software? IEEE Computer Magazine, 33:18–26, 2000.Google Scholar
- E. A. Lee. Overview of the Ptolemy Project. Technical Memorandum UCB/ERLM01/ 11, University of California, Berkeley, 2001.Google Scholar
- N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.Google Scholar
- J. Rumbaugh, G. Booch, and I. Jacobson. The UML Reference Guide. Addison-Wesley, 1999.Google Scholar
- N. Shankar. Lazy compositional verification. In Compositionality: The Significant Difference, LNCS 1536, pp. 541–564. Springer-Verlag, 1999.Google Scholar