Behavioral type inference: part I - algebraic theory for bahavioral type inference

  • Authors:
  • Jean-Pierre Talpin;Paul Le Guernic

  • Affiliations:
  • INRIA, project Espresso, IRISA, Campus de Beaulieu, Rennes Cedex, France;INRIA, project Espresso, IRISA, Campus de Beaulieu, Rennes Cedex, France

  • Venue:
  • Formal methods and models for system design
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

The design productivity gap has been recognized as one of the major threats to the continued growth of embedded systems design productivity. Ad-hoc system-level design methodologies, that lift modeling to higher levels of abstraction, and the concept of intellectual property (IP), that promotes reuse of existing components, are essential steps to manage design complexity. However, the issue of compositional correctness arises with these steps. Given components from different manufacturers, designed with heterogeneous models, at different levels of abstraction, assembling them in a correct-by-construction manner is a difficult challenge. We address it by proposing a process algebraic model to support system design with a formal model of computation that serves as a behavioral type system to capture the behavior of system components at the interface level. The proposed algebra is conceptually minimal, equipped with a formal semantics defined in a synchronous model of computation, and supports a scalable notion and a flexible degree of abstraction. We demonstrate its benefits by considering the type-based synthesis of latency-insensitive protocols. We show that the synthesis of component wrappers can be optimized by the behavioral information carried by interface type descriptions and yield minimized stalls and maximized throughput.