A boolean algebra of contracts for assume-guarantee reasoning - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A boolean algebra of contracts for assume-guarantee reasoning

Résumé

Contract-based design is an expressive paradigm for a modular and compositional speci cation of programs. It is in turn becoming a fundamental concept in mainstream industrial computer-aided design tools for embedded system design. In this paper, we elaborate new foundations for contract-based embedded system design by proposing a general-purpose algebra of assume/guarantee contracts based on two simple concepts: rst, the assumption or guarantee of a component is de ned as a lter and, second, lters enjoy the structure of a Boolean algebra. This yields a structure of contracts that is a Heyting algebra.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

hal-00788413 , version 1 (14-02-2013)

Identifiants

  • HAL Id : hal-00788413 , version 1

Citer

Yann Glouche, Paul Le Guernic, Jean-Pierre Talpin, Thierry Gautier. A boolean algebra of contracts for assume-guarantee reasoning. FACS 2009 : 6th International Workshop on Formal Aspects of Component Software, Nov 2009, Eindhoven, Netherlands. ⟨hal-00788413⟩
125 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More