Skip to main content
Journal ArticleOPEN ACCESS

Compositional circular assume-guarantee rules cannot be sound and complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2620 343-357
DOI: 10.1007/3-540-36576-1_22
15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Circular assume-guarantee reasoning is used for the compositional verification of concurrent systems. Its soundness has been studied in depth, perhaps because circularity makes it anything but obvious. In this paper, we investigate completeness. We show that compositional circular assume-guarantee rules cannot be both sound and complete. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Maier, P. (2003). Compositional circular assume-guarantee rules cannot be sound and complete. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2620, 343–357. https://doi.org/10.1007/3-540-36576-1_22

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