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.