Interleaved Programs and Rely-Guarantee Reasoning with ITL

Authors:
Gerhard Schellhorn;Bogdan Tofan;Gidon Ernst;Wolfgang Reif
Affiliations:
-;-;-;-
Venue:
TIME '11 Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning
Year:
2011

Citing 0
Cited 4

Formal verification of a lock-free stack with hazard pointers

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
The VerCors project: setting up basecamp

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
A concurrent temporal programming model with atomic blocks

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Dynamic logic with trace semantics

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a logic that extends basicITL with explicit, interleaved programs. The calculus is based on symbolic execution, as previously described. We extend this former work here, by integrating the logic with higher-order logic, adding recursive procedures and rules to reason about fairness. Further, we show how rules for rely-guarantee reasoning can be derived and outline the application of some features to verify concurrent programs in practice. The logic is implemented in the interactive verification environment KIV.