Convertibility verification and converter synthesis: two faces of the same coin

  • Authors:

  • Roberto Passerone;Luca de Alfaro;Thomas A. Henzinger;Alberto L. Sangiovanni-Vincentelli

  • Affiliations:

  • Cadence Berkeley Laboratories, Berkeley, CA;University of California, Santa Cruz, Santa Cruz, CA;University of California, Berkeley, Berkeley, CA;University of California, Berkeley, Berkeley, CA

  • Venue:
  • Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.