ACM Transactions on Programming Languages and Systems (TOPLAS)
Composition and refinement of discrete real-time systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
From formal models to formally based methods: an industrial experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Automated deductive requirements analysis of critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
An Abstract Account of Composition
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
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
Deductive Verification of Modular Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
On the Competeness of Compositional Reasoning
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Compositional circular assume-guarantee rules cannot be sound and complete
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Hi-index | 0.00 |
We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, real-time system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a small set of conditions concerning the integration of the different parts into a whole system. The reference specification language is the TRIO metric linear temporal logic. The novelty of our approach with respect to existing compositional frameworks — most of which do not deal explicitly with real-time requirements — consists mainly in its generality and abstraction from any assumptions about the underlying computational model and from any semantic characterizations of the temporal logic language used in the specification. Moreover, the framework deals equally well with continuous and discrete time. It is supported by a tool, implemented on top of the proof-checker PVS, to perform deduction-based verification through theorem-proving of modular real-time axiom systems. As an example of application, we show the verification of a real-time version of the old-fashioned but still relevant “benchmark” of the dining philosophers problem.