Filters








7 Hits in 1.9 sec

RGITL: A temporal logic framework for compositional reasoning about interleaved programs

Gerhard Schellhorn, Bogdan Tofan, Gidon Ernst, Jörg Pfähler, Wolfgang Reif
2014 Annals of Mathematics and Artificial Intelligence  
As a consequence, the calculus permits proving decomposition theorems which reduce reasoning about an interleaved program to reasoning about individual threads.  ...  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.  ...  Acknowledgment We would like to thank Cliff Jones and Ben Moszkowski for thoroughly reading a preliminary version of this paper, and in addition Dimitar Guelev, Alexander Knapp and the anonymous referees  ... 
doi:10.1007/s10472-013-9389-z fatcat:ygihh7xrlzb73g4lynbyo3alze

Guest editors' preface to special issue on interval temporal logics

Ben Moszkowski, Dimitar Guelev, Martin Leucker
2014 Annals of Mathematics and Artificial Intelligence  
A special thanks is reserved for the reviewers of the special issue's submissions for making careful assessments and providing constructive advice to the authors and guest editors.  ...  These reviewers' names are listed below, with the exception of the ones for Ben Moszkowski's article: Benedikt Bollig, Catalin Dima, Emmanuel Filiot, Marcelo Finger, Carlo A.  ...  -RGITL: A Temporal logic framework for compositional reasoning about interleaved programs by Gerhard Schellhorn, Bogdan Tofan, Gidon Ernst, Jörg Pfähler and Wolfgang Reif: This paper, which involves the  ... 
doi:10.1007/s10472-014-9417-7 fatcat:j7tch4ezf5cqzdl2mvbd6xfvbe

An application of temporal projection to interleaving concurrency

Ben Moszkowski, Dimitar P. Guelev
2017 Formal Aspects of Computing  
Furthermore, Π and another standard PITL projection operator are interdefinable and both suitable for reasoning about different time granularities.  ...  We revisit the earliest temporal projection operator Π in discrete-time Propositional Interval Temporal Logic (PITL) and use it to formalise interleaving concurrency.  ...  We thank Maciej Koutny and the anonymous reviewers for their comments and suggestions.  ... 
doi:10.1007/s00165-017-0417-3 fatcat:tni5wadhz5anlmwqepsvsnjmt4

Balancing expressiveness in formal approaches to concurrency

Cliff B. Jones, Ian J. Hayes, Robert J. Colvin
2014 Formal Aspects of Computing  
Both rely/guarantee methods and separation logic(s) provide useful frameworks in which it is natural to reason about aspects of concurrency.  ...  One might think that specifying and reasoning about concurrent programs would be easier with more expressive languages. This paper questions that view.  ...  RGITL The combination of Moszkowski's [Mos85] "interval temporal logic" (ITL) with R/G in Schellhorn's RGITL [STER11] provides a seductive combination.  ... 
doi:10.1007/s00165-014-0310-2 fatcat:nrsgjshrmbc6tfn6czoacta4g4

Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads [chapter]

Cliff B. Jones
2020 Lecture Notes in Computer Science  
This paper addresses the topic of reasoning formally about concurrent computer programs that execute with variables that are shared between threads.  ...  Abstract: This paper addresses the topic of reasoning formally about concurrent computer programs that execute with variables that are shared between threads.  ...  The author is grateful to the organisers for the event and the audience for their feedback. Furthermore, Troy Astarte kindly commented on a draft of the current paper.  ... 
doi:10.1007/978-3-030-54997-8_3 fatcat:wspf5epgrve5vntaobyieillb4

Verifying Linearisability

Brijesh Dongol, John Derrick
2015 ACM Computing Surveys  
However, because the underlying framework, nomenclature and terminology for each method is different, it has become difficult for practitioners to evaluate the differences between each approach, and hence  ...  Linearizability is a key correctness criterion for concurrent data structures, ensuring that each history of the concurrent object under consideration is consistent with respect to a history of the corresponding  ...  We also thank Lindsay Groves for his comments on an earlier version.  ... 
doi:10.1145/2796550 fatcat:q7a5zsxqrzawbd5mhl4lxmy2vi

Verifying linearizability: A comparative survey [article]

Brijesh Dongol, John Derrick
2015 arXiv   pre-print
However, as the underlying framework, nomenclature and terminology for each method differs, it has become difficult for practitioners to judge the differences between each approach, and hence, judge the  ...  with respect to a sequential history of a corresponding abstract data structure.  ...  Compositional frameworks Compositional frameworks allow one to reason about a concurrent program in a modular manner by capturing the behaviour of the environment of a program abstractly as a two-state  ... 
arXiv:1410.6268v2 fatcat:uwsc3vwyovhxtlylkxudnrakne