@inproceedings{3d26fa4c36494814aaab9cc2bc403b2e,
title = "Compositional circular assume-guarantee rules cannot be sound and complete",
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.",
keywords = "compositional verification, assume-guarantee reasoning, completeness",
author = "Patrick Maier",
year = "2003",
month = apr,
doi = "10.1007/3-540-36576-1_22",
language = "English",
isbn = "978-3-540-00897-2",
volume = "2620",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "343--357",
booktitle = "Foundations of Software Science and Computational Structures",
note = "6th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2003 ; Conference date: 07-04-2003 Through 11-04-2003",
}