A Boolean Algebra of Contracts for Assume-guarantee Reasoning

Authors:
Yann Glouche;Paul Le Guernic;Jean-Pierre Talpin;Thierry Gautier
Affiliations:
INRIA, Centre de Recherche Rennes-Bretagne Atlantique Campus de Beaulieu, 35042 Rennes Cedex, France;INRIA, Centre de Recherche Rennes-Bretagne Atlantique Campus de Beaulieu, 35042 Rennes Cedex, France;INRIA, Centre de Recherche Rennes-Bretagne Atlantique Campus de Beaulieu, 35042 Rennes Cedex, France;INRIA, Centre de Recherche Rennes-Bretagne Atlantique Campus de Beaulieu, 35042 Rennes Cedex, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 15
Cited 0

Composing specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Domain theory

Handbook of logic in computer science (vol. 3)
Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Compositional refinement of interactive systems

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
Design by contract, by example

Design by contract, by example
Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Formal verification of programs specified with signal: application to a power transformer station controller

Science of Computer Programming
Synthesis of Discrete-Event Controllers Based on the SignalEnvironment

Discrete Event Dynamic Systems
An OCL Extension for Real-Time Constraints

Object Modeling with the OCL, The Rationale behind the Object Constraint Language
Basic notions of trace theory

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Logical-Time Contracts for Reactive Embedded Components

EUROMICRO '04 Proceedings of the 30th EUROMICRO Conference
Interface theories with component reuse

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Why Are Modalities Good for Interface Theories?

ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Modal I/O automata for interface and product line theories

ESOP'07 Proceedings of the 16th European conference on Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contract-based design is an expressive paradigm for a modular and compositional specification 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: first, the assumption or guarantee of a component is defined as a filter and, second, filters enjoy the structure of a Boolean algebra. This yields a structure of contracts that is a Heyting algebra.