MPI-I-2003-2-001. January 2003, 22 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|