Handbook of theoretical computer science (vol. B)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Assumption/guarantee specifications in linear-time temporal logic
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Formal specification and verification of a dataflow processor array
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
An assume-guarantee rule for checking simulation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Thread-Modular Verification for Shared-Memory Programs
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
An Abstract Account of Composition
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
You Assume, We Guarantee: Methodology and Case Studies
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On the Competeness of Compositional Reasoning
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Automated compositional proofs for real-time systems
Theoretical Computer Science
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
Assume-guarantee reasoning with local specifications
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Automated compositional proofs for real-time systems
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Interface input/output automata
FM'06 Proceedings of the 14th international conference on Formal Methods
Automatic derivation of compositional rules in automated compositional reasoning
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
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.