Towards realizability checking of contracts using theories

Andrew Gacek, Andreas Katis, Michael W. Whalen, John Backes, Darren Cofer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationNASA Formal Methods - 7th International Symposium, NFM 2015, Proceedings
EditorsKlaus Havelund, Gerard Holzmann, Rajeev Joshi
PublisherSpringer- Verlag
Pages173-187
Number of pages15
ISBN (Print)9783319175232
DOIs
StatePublished - Jan 1 2015
Event7th International Symposium on NASA Formal Methods, NFM 2015 - Pasadena, United States
Duration: Apr 27 2015Apr 29 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9058
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Symposium on NASA Formal Methods, NFM 2015
CountryUnited States
CityPasadena
Period4/27/154/29/15

Fingerprint Dive into the research topics of 'Towards realizability checking of contracts using theories'. Together they form a unique fingerprint.

Cite this