Contract-Based Requirement Modularization via Synthesis of Correct Decompositions

In distributed development of modern systems, contracts play a vital role in ensuring interoperability of components and adherence to specifications. It is therefore often desirable to verify the satisfaction of an overall property represented as a contract, given the satisfaction of smaller propert...

Full description

Saved in:
Bibliographic Details
Published inTheory of computing systems Vol. 15
Main Authors Le, Thi Thieu Hoa, Passerone, Roberto, Fahrenberg, Uli, Legay, Axel
Format Journal Article
LanguageEnglish
Published Springer Verlag 07.06.2016
Subjects
Computer Science
synthesis
Additional Key Words and Phrases: Contract
General Terms: Design
ACM Reference Format
Theory
distributed systems
decomposition
Verification
requirement
I64 [Computing Methodologies]: Model Validation and Analysis
Online AccessGet full text

Cover

More Information
Summary:In distributed development of modern systems, contracts play a vital role in ensuring interoperability of components and adherence to specifications. It is therefore often desirable to verify the satisfaction of an overall property represented as a contract, given the satisfaction of smaller properties also represented as contracts. When the verification result is negative, designers must face the issue of refining the subproperties and components. This is an instance of the classical synthesis problems: " can we construct a model that satisfies some given specification? " In this work, we propose two strategies enabling designers to synthesize or refine a set of contracts so that their composition satisfies a given contract. We develop a generic algebraic method and show how it can be applied in different contract models to support top-down component-based development of distributed systems.
ISSN:1432-4350
1433-0490
DOI:10.1145/2885752