TY - GEN

T1 - Towards realizability checking of contracts using theories

AU - Gacek, Andrew

AU - Katis, Andreas

AU - Whalen, Michael W.

AU - Backes, John

AU - Cofer, Darren

N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system construction. Such proofs build from “leaf-level” assume/guarantee component contracts through architectural layers towards top-level safety properties. The proofs are built upon the premise that each leaf-level component contract is realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. Without engineering support it is all too easy to write leaf-level components that can’t be realized. Realizability checking for propositional contracts has been well-studied for many years, both for component synthesis and checking correctness of temporal logic requirements. However, checking realizability for contracts involving infinite theories is still an open problem. In this paper, we describe a new approach for checking realizability of contracts involving theories and demonstrate its usefulness on several examples.

AB - Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system construction. Such proofs build from “leaf-level” assume/guarantee component contracts through architectural layers towards top-level safety properties. The proofs are built upon the premise that each leaf-level component contract is realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. Without engineering support it is all too easy to write leaf-level components that can’t be realized. Realizability checking for propositional contracts has been well-studied for many years, both for component synthesis and checking correctness of temporal logic requirements. However, checking realizability for contracts involving infinite theories is still an open problem. In this paper, we describe a new approach for checking realizability of contracts involving theories and demonstrate its usefulness on several examples.

UR - http://www.scopus.com/inward/record.url?scp=84942617379&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942617379&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-17524-9_13

DO - 10.1007/978-3-319-17524-9_13

M3 - Conference contribution

AN - SCOPUS:84942617379

SN - 9783319175232

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 173

EP - 187

BT - NASA Formal Methods - 7th International Symposium, NFM 2015, Proceedings

A2 - Havelund, Klaus

A2 - Holzmann, Gerard

A2 - Joshi, Rajeev

PB - Springer- Verlag

T2 - 7th International Symposium on NASA Formal Methods, NFM 2015

Y2 - 27 April 2015 through 29 April 2015

ER -