Compositional assume-guarantee reasoning for input/output component theories

17Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We formulate a sound and complete assume-guarantee framework for reasoning compositionally about components modelled as a variant of interface automata. The specification of a component, which expresses both safety and progress properties of input and output interactions with the environment, is characterised by finite traces. The framework supports dynamic reasoning about components and specifications, and includes rules for parallel composition, logical conjunction and disjunction corresponding to independent development, and quotient for incremental synthesis. Practical applicability of the framework is demonstrated through a link layer protocol case study. © 2014 Elsevier B.V.

Cite

CITATION STYLE

APA

Chilton, C., Jonsson, B., & Kwiatkowska, M. (2014). Compositional assume-guarantee reasoning for input/output component theories. Science of Computer Programming, 91(PART A), 115–137. https://doi.org/10.1016/j.scico.2013.12.010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free