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)
Mechanizing a theory of program composition for UNITY
ACM Transactions on Programming Languages and Systems (TOPLAS)
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Thread-Modular Verification for Shared-Memory Programs
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Program Composition in Isabelle/UNITY
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Completeness of the Owicki-Gries System for Parameterized Parallel Programs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Concurrency Verification: Introduction to Compositional and Non-compositional Methods
Concurrency Verification: Introduction to Compositional and Non-compositional Methods
A rigorous environment for development of concurrent systems
Nordic Journal of Computing
Compositional Verification of a Communication Protocol for a Remotely Operated Vehicle
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Interactive verification of concurrent systems using symbolic execution
AI Communications - Practical Aspects of Automated Reasoning
Explicit stabilisation for modular rely-guarantee reasoning
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A marriage of rely/guarantee and separation logic
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Compositional verification of a communication protocol for a remotely operated aircraft
Science of Computer Programming
Formal analysis of event-driven cyber physical systems
Proceedings of the First International Conference on Security of Internet of Things
| Hi-index | 0.00 |
We present the formalization of the rely-guarantee method in the theorem prover Isabelle/HOL. This method consists of a Hoarelike system of rules to verify concurrent imperative programs with shared variables in a compositional way. Syntax, semantics and proof rules are defined in higher-order logic. Soundness of the proof rules w.r.t. the semantics is proven mechanically. Also parameterized programs, where the number of parallel components is a parameter, are included in the programming language and thus can be verified directly in the system. We prove that the system is complete for parameterized programs. Finally, we show by an example how the formalization can be used for verifying concrete programs.