Component composition preserving behavioural contracts based on communication traces

Authors:
Arnaud Bailly;Mireille Clerbout;Isabelle Simplot-Ryl
Affiliations:
LIFL, CNRS UMR 8022, Université de Lille I, Cité Scientifique, Villeneuve d'Ascq, France;LIFL, CNRS UMR 8022, Université de Lille I, Cité Scientifique, Villeneuve d'Ascq, France;LIFL, CNRS UMR 8022, Université de Lille I, Cité Scientifique, Villeneuve d'Ascq, France
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 11
Cited 4

A behavioral notion of subtyping

ACM Transactions on Programming Languages and Systems (TOPLAS)
Conjoining specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal basis for architectural connection

ACM Transactions on Software Engineering and Methodology (TOSEM)
A Classification and Comparison Framework for Software Architecture Description Languages

IEEE Transactions on Software Engineering
Component Software: Beyond Object-Oriented Programming

Component Software: Beyond Object-Oriented Programming
On Object Systems and Behavioral Inheritance

IEEE Transactions on Software Engineering
Behavior Protocols for Software Components

IEEE Transactions on Software Engineering
Specifying Distributed Software Architectures

Proceedings of the 5th European Software Engineering Conference
Architectural Reasoning in ArchJava

ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Extending CORBA Interfaces with p-Calculus for Protocol Compatibility

TOOLS '00 Proceedings of the Technology of Object-Oriented Languages and Systems (TOOLS 33)
A formal approach to component adaptation

Journal of Systems and Software - Special issue: Automated component-based software engineering

Infinite unfair shuffles and associativity

Theoretical Computer Science
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Detecting and Coordinating Complex Patterns of Distributed Events with KETAL

Electronic Notes in Theoretical Computer Science (ENTCS)
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the compositional properties of reusable software components defined with explicit dependencies and behavioural contracts expressing rely-guarantee specifications in the form of communication traces. In this setting, connection of components through their matching ports is indeed compositional and yields a new component or composite that respects its constituents' contracts. Thus the behaviour of the composite is computed from the behaviours of its constituents and is known to conform to the contracts without any new proof.