Parallel program design: a foundation
Parallel program design: a foundation
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the Fourth Annual Symposium on Logic in computer science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Selected papers of the 3rd workshop on Concurrency and compositionality
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Revised Lectures from the International Symposium on Compositionality: The Significant Difference
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Application of the Composition Principle to Unity-like Specifications
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Seminar on Concurrency, Carnegie-Mellon University
On Unifying Assumption-Commitment Style Proof Rules for Concurrency
CONCUR '94 Proceedings of the Concurrency Theory
Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary Variables
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Formula-Dependent Equivalence for Compositional CTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Local Liveness for Compositional Modeling of Fair Reactive Systems
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On the complexity of modular model checking
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Synchronized Parallel Composition of Event Systems in B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Modeling and Verification of Reactive Systems using Rebeca
Fundamenta Informaticae
| Hi-index | 0.00 |
In the compositional verification of a concurrent system, one seeks to deduce properties of the system from properties of its constituent modules. This paper supplements our previous work on the same subject to provide a comprehensive compositional framework in linear-time temporal logic. It has been shown by many that specifying properties of a module in the assumption-guarantee style is effective in achieving compositionality. We consider two forms of temporal formulas that correspond to two interpretations of an assumption-guarantee specification and investigate how they can be applied in compositional verification. We argue by examples that the two forms complement each other and both are needed to facilitate the compositional approach. We also show how to handle assumption-guarantee specifications where the assumption contains a liveness property.