RGITL: A temporal logic framework for compositional reasoning about interleaved programs. This paper gives a self-contained presentation of the temporal logic Rely-Guarantee Interval Temporal Logic (RGITL). The logic is based on interval temporal logic (ITL) and higher-order logic. It extends ITL with explicit interleaved programs and recursive procedures. Deduction is based on the principles of symbolic execution and induction, known from the verification of sequential programs, which are transferred to a concurrent setting with temporal logic. We include an interleaving operator with compositional semantics. As a consequence, the calculus permits proving decomposition theorems which reduce reasoning about an interleaved program to reasoning about individual threads. A central instance of such theorems are rely-guarantee (RG) rules, which decompose global safety properties. We show how the correctness of such rules can be formally derived in the calculus. Decomposition theorems for other global properties are also derivable, as we show for the important progress property of lock-freedom. RGITL is implemented in the interactive verification environment KIV. It has been used to mechanize various proofs of concurrent algorithms, mainly in the area oflinearizable and lock-free algorithms.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Moszkowski, Ben; Guelev, Dimitar P.: An application of temporal projection to interleaving concurrency (2017)
- Schellhorn, Gerhard; Travkin, Oleg; Wehrheim, Heike: Towards a thread-local proof technique for starvation freedom (2016)
- Schellhorn, Gerhard; Derrick, John; Wehrheim, Heike: A sound and complete proof technique for linearizability of concurrent data structures (2014)
- Schellhorn, Gerhard; Tofan, Bogdan; Ernst, Gidon; Pfähler, Jörg; Reif, Wolfgang: RGITL: a temporal logic framework for compositional reasoning about interleaved programs (2014)