Proving linearizability with temporal logic

Bäumler, Simon; Schellhorn, Gerhard; Tofan, Bogdan; Reif, Wolfgang

doi:10.1007/s00165-009-0130-y

Cited by 25 publications

(24 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As far as we are aware, two of these are based on interval-based principles similar to ours. A framework that combines interval temporal logic and refinement has been defined by Bäumler et al [7], but their execution model strictly interleaves a component and its environment. As a result, our non-deterministic expression evaluation operators and true concurrency semantics cannot be easily incorporated into their framework.…”

Section: Discussionmentioning

confidence: 99%

“…We interpret concurrency using a true concurrency semantics. Note that this interpretation below is not the only possibility -one could also, for example, give an interval-based interleaved semantics (e.g., [46,7]). However, such a treatment would defeat the purpose of this example, which is to show that interval predicates form a natural basis for reasoning about true concurrency.…”

Section: An Interval-based Semanticsmentioning

confidence: 99%

See 1 more Smart Citation

Interval-based data refinement: A uniform approach to true concurrency in discrete and real-time systems

Dongol

Derrick

2015

Science of Computer Programming

View full text Add to dashboard Cite

The majority of modern systems exhibit sophisticated concurrent behaviour, where several system components observe and modify the state with fine-grained atomicity. Many systems also exhibit truly concurrent behaviour, where multiple events may occur simultaneously. Data refinement, a correctness criterion to compare an abstract and a concrete implementation, normally admits interleaved models of execution only. In this paper, we present a method of data refinement using a framework that allows one to view a component's evolution over an interval of time, simplifying reasoning about true concurrency. By modifying the type of an interval, our theory may be specialised to cover data refinement of both discrete and real-time systems. We develop a sound interval-based forward simulation rule that enables decomposition of data refinement proofs, and apply this rule to verify data refinement for two examples: a simple concurrent program and a more in-depth real-time controller.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: An Interval-based Semanticsmentioning

confidence: 99%

Interval-based data refinement: A uniform approach to true concurrency in discrete and real-time systems

Dongol

Derrick

2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…KIV can employ ITL proof systems such as ours. The concluding remarks of [BSTR11] note the following advantages of ITL:…”

Section: Introductionmentioning

confidence: 99%

A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time

Moszkowski¹

2012

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We solve the longstanding open problem of finding a complete axiom system for basic quantifier-free propositional ITL (PITL) with infinite time for analysing nonterminating computational systems. Our completeness proof uses a reduction to completeness for PITL with finite time and conventional propositional linear-time temporal logic. Unlike completeness proofs of equally expressive logics with nonelementary computational complexity, our semantic approach does not use tableaux, subformula closures or explicit deductions involving encodings of omega automata and nontrivial techniques for complementing them. We believe that our result also provides evidence of the naturalness of interval-based reasoning.

show abstract

“…On the other hand, a recent example of persistent concerns by many researchers of ITLs' conceptual complexity involves RGITL [4], which combines Jones' rely-guarantee conditions [22] with Moszkowski's ITL [31]. RGITL is the subject of Schellhorn et al's article in this special issue and is used to mechanically verify algorithms with shared-variable concurrency.…”

mentioning

confidence: 99%

“…-Multi-core processors become ubiquitous as technological limits for clock rates are being reached. Research on ITLs (e.g., [4]) suggests they might offer a promising general framework for formal reasoning about some relevant concurrent algorithms involving fine-grained interleaved access to shared variables. -A revised standard SQL:2011 for the database Structured Query Language (SQL) now includes support for time intervals [19,25].…”

mentioning

confidence: 99%