Parallel program design: a foundation
Parallel program design: a foundation
Predicate calculus and program semantics
Predicate calculus and program semantics
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
An explanatory presentation of composition rules for assumption-commitment specifications
Information Processing Letters
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science - Special issue on algebraic methodology and software technology
An Experiment in Program Composition and Proof
Formal Methods in System Design
Examples of Program Composition Illustrating the Use of Universal Properties
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
An Abstract Account of Composition
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Logical Foundations for Compositional Verification and Development of Concurrent Programs in UNITY
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Reasoning about Composition Using Property Transformers and Their Conjugates
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Towards a Compositional Approach to the Design and Verification of Distributed Systems
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Composition: A Way to Make Proofs Harder
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Science of Computer Programming
| Hi-index | 0.00 |
We consider the question of composition in system design, a fundamental issue in engineering. More precisely, we are interested in deducing system properties from components properties and vice-versa. This requires system and component specifications to be "compositional" in some sense. Depending on what systems are and how they are composed, this problem is satisfactorily solved (e.g., sequential composition of terminating programs) or remains a hot research topic (e.g., concurrent composition of reactive systems). In this paper, we aim at providing a logical framework in which composition issues can be reasoned about independently from the kind of systems and the laws of composition under consideration. We show that many composition related statements can be expressed in terms of predicate transformers in a way that presents interesting similarities with program semantics descriptions based on weakest precondition calculus.