Predicates are predicate transformers: a unified compositional theory for concurrency
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Trace-based network proof systems: expressiveness and completeness
ACM Transactions on Programming Languages and Systems (TOPLAS)
The composability of ASTRAL realtime specifications
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving concurrent constraint programs correct
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specification of Realtime Systems Using ASTRAL
IEEE Transactions on Software Engineering
Specification of realtime systems using ASTRAL
IEEE Transactions on Software Engineering
A Verification Framework for Agent Communication
Autonomous Agents and Multi-Agent Systems
Composition and Refinement for Partial Object Specifications
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Lazy Compositional Verification
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Compositional Reasoning Using the Assumption-Commitment Paradigm
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Compositional Verification of Real-Time Applications
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Compositional Proof Methods for Concurrency: A Semantic Approach
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Formally Specifying and Verifying Real-Time Systems
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
P-A logic: a compositional proof system for distributed programs
Distributed Computing
The compositional approach to sequential consistency and lazy caching
Distributed Computing - Special issue: Verification of lazy caching
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
Assumption-Commitment Support for CSP Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Assumption---Commitment Support for CSP Model Checking
Journal of Automated Reasoning
Modular Verification of Recursive Programs
Languages: From Formal to Natural
On the completeness of compositional reasoning methods
ACM Transactions on Computational Logic (TOCL)
A refinement calculus for communicating processes with state
IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods
An unbounded nondeterministic model for CSP-like Languages
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Communication traces in the verification of distributed programs
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity
Fundamenta Informaticae
Compositional Proofs For Networks Of Processes
Fundamenta Informaticae
| Hi-index | 0.00 |