The Community for Technology Leaders
Computer-Aided Design, International Conference on (2002)
San Jose, California
Nov. 10, 2002 to Nov. 14, 2002
ISSN: 1092-3152
ISBN: 0-7803-7607-2
pp: 132-139
Alberto L. Sangiovanni-Vincentelli , University of California, Berkeley, Berkeley, CA
Thomas A. Henzinger , University of California, Berkeley, Berkeley, CA
Luca de Alfaro , University of California, Santa Cruz, Santa Cruz, CA
Roberto Passerone , Cadence Berkeley Laboratories, Berkeley, CA
ABSTRACT
An essential problem in component-based design is how to compose components designed in isolation. Several approaches have been proposed for specifying component interfaces that capture behavioral aspects such as interaction protocols, and for verifying interface compatibility. Likewise, several approaches have been developed for synthesizing converters between incompatible protocols. In this paper, we introduce the notion of adaptability as the property that two interfaces have when they can be made compatible by communicating through a converter that meets specified requirements. We show that verifying adaptability and synthesizing an appropriate converter are two faces of the same coin: adaptability can be formalized and solved using a game-theoretic framework, and then the converter can be synthesized as a strategy that always wins the game. Finally we show that this framework can be related to the rectification problem in trace theory.
INDEX TERMS
CITATION
Alberto L. Sangiovanni-Vincentelli, Thomas A. Henzinger, Luca de Alfaro, Roberto Passerone, "Convertibility verification and converter synthesis: two faces of the same coin", Computer-Aided Design, International Conference on, vol. 00, no. , pp. 132-139, 2002, doi:10.1109/ICCAD.2002.1167525
115 ms
(Ver 3.3 (11022016))