English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete

Maier, P. (2003). Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete. In Foundations of software science and computation structures: 6th International Conference, FOSSACS 2003 (pp. 343-357). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Maier, Patrick1, Author           
Gordon, Andrew D., Editor
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-172003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202048
Other: Local-ID: C1256104005ECAFC-D6DFA25A621ED297C1256D08004352DE-Maier2003z
 Degree: -

Event

show
hide
Title: FOSSACS 2003
Place of Event: Warsaw, Poland
Start-/End Date: 2003-04-07 - 2003-04-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 343 - 357 Identifier: ISBN: 3-540-00897-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2620 Sequence Number: - Start / End Page: - Identifier: -