A generalization of Owicki-Gries's Hoare logic for a concurrent while language
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Accommodating interference in the formal design of concurrent object-based programs
Formal Methods in System Design
Parallel composition of assumption-commitment specifications
Acta Informatica
Specifying Message Passing and Time-Critical Systems with Temporal Logic
Specifying Message Passing and Time-Critical Systems with Temporal Logic
Specification and Compositional Verification of Real-Time Systems
Specification and Compositional Verification of Real-Time Systems
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
Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract)
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Lazy Compositional Verification
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Seminar on Concurrency, Carnegie-Mellon University
A Method for the Development of Totally Correct Shared-State Parallel Programs
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
On Unifying Assumption-Commitment Style Proof Rules for Concurrency
CONCUR '94 Proceedings of the Concurrency Theory
An Extended Duration Calculus for Hybrid Real-Time Systems
Hybrid Systems
Some Very Compositional Temporal Properties
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Verifying duration properties of timed transition systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
A Duration Calculus with Infinite Intervals
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
An Old-Fashioned Recipe for Real Time
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Compositional reasoning about projected and infinite time
ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
P-A logic: a compositional proof system for distributed programs
Distributed Computing
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Can Component/Service-Based Systems Be Proved Correct?
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A stepwise development of the peterson's mutual exclusion algorithm using b abstract systems
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
Assumption-Commitment paradigms have been investigated to derive tractable rules for composing specifications of concurrent systems. We first give a short survey of several typical composition rules, and then we adopt the principle to reason about real time systems. An extension of Duration Calculus capable of describing infinite behaviours and instantaneous actions is proposed. In the calculus, verification techniques based on assumption-commitment are incorporated.