Refinement-based synthesis of correct contract model 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...
Saved in:
Published in | 2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) pp. 134 - 143 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
Washington, DC, USA
IEEE Computer Society
01.10.2014
IEEE |
Series | ACM Conferences |
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 sub-properties 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 a strategy 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. |
---|---|
ISBN: | 9781479953387 1479953385 |
DOI: | 10.1109/MEMCOD.2014.6961851 |