Automated Proof Support for Interval Logics
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Compositional Reasoning Using Interval Temporal Logic and Tempura
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
An Adequate First Order Interval Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A Complete Axiomatization of Interval Temporal Logic with Infinite Time
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Completeness of temporal logics over infinite intervals
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Complexity of propositional projection temporal logic with star†
Mathematical Structures in Computer Science
A transformation from PPTL to S1S
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Rely/Guarantee reasoning for teleo-reactive programs over multiple time bands
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Deriving real-time action systems controllers from multiscale system specifications
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
A complete proof system for propositional projection temporal logic
Theoretical Computer Science
| Hi-index | 0.00 |
Modularity is of fundamental importance in computer science. The need for a formal theory of modularity in the design and maintenance of large systems is especially pronounced. In recent work on Interval Temporal Logic (ITL) we gave an axiom system in which proofs of sequential and parallel systems can be decomposed into proofs for the syntactic subcomponents. This provides a precise framework for describing and generalizing the insights of Francez and Pnueli (1978) and Jones (1983) for modular reasoning about concurrency using what are often called assumptions and commitments. It combines the benefits of these ideas with temporal logic. We now show that such techniques can be used to analyze temporal projection operators developed by us for describing systems with multiple time granularities. In addition, we consider how to compositionally reason in ITL about the absence of deadlock in systems running for infinite time. This demonstrates that our generalization of Jones' techniques for assumptions and commitments handles not only safety properties but also liveness ones.