On the public citation graph

Interleaved Programs and Rely-Guarantee Reasoning with ITL

https://doi.org/10.1109/time.2011.12
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45022-x_19openalex-snapshot
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
inferredcites →https://doi.org/10.1007/978-1-4757-4376-0openalex-snapshot
Verification of Sequential and Concurrent Programs
inferredcites →https://doi.org/10.1007/978-1-84882-736-3_3openalex-snapshot
The Abstract State Machines Method for High-Level System Design and Analysis
inferredcites →https://doi.org/10.1007/978-3-540-30232-2_7openalex-snapshot
Formal Verification of a Practical Lock-Free Queue Algorithm
inferredcites →https://doi.org/10.1007/978-3-642-13321-3_21openalex-snapshot
Temporal Logic Verification of Lock-Freedom
inferredcites →https://doi.org/10.1007/978-94-017-0435-9_1openalex-snapshot
Structured Specifications and Interactive Proofs with KIV
inferredcites →https://doi.org/10.1007/bf01211617openalex-snapshot
The rely-guarantee method for verifying shared variable concurrent programs
inferredcites →https://doi.org/10.1007/s00165-009-0130-yopenalex-snapshot
Proving linearizability with temporal logic
inferredcites →https://doi.org/10.1016/j.entcs.2007.05.034openalex-snapshot
Formal Fault Tree Analysis - Practical Experiences
inferredcites →https://doi.org/10.1109/mc.1985.1662795openalex-snapshot
A Temporal Logic for Multilevel Reasoning about Hardware
inferredcites →https://doi.org/10.1109/tpds.2004.8openalex-snapshot
Hazard pointers: safe memory reclamation for lock-free objects
inferredcites →https://doi.org/10.1145/142111.993246openalex-snapshot
A Lock-Free Multiprocessor OS Kernel
inferredcites →https://doi.org/10.1145/1480881.1480886openalex-snapshot
Proving that non-blocking algorithms don't block
inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot
The temporal logic of actions
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.25405/ncl.34125705openalex-snapshot
Specification and Design of (Parallel) Programs
inferredcites →https://doi.org/10.3233/aic-2010-0458openalex-snapshot
Interactive verification of concurrent systems using symbolic execution

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_1openalex-snapshot
A Guide to Rely/Guarantee Thinking
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_20openalex-snapshot
Software & System Verification with KIV
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_5openalex-snapshot
Specifying and Reasoning About Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-03077-7_15openalex-snapshot
Formal Specification of an Erase Block Management Layer for Flash Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-24312-2_21openalex-snapshot
A Dynamic Logic with Traces and Coinduction
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_1openalex-snapshot
General Lessons from a Rely/Guarantee Development
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_16openalex-snapshot
Formal Verification of a Lock-Free Stack with Hazard Pointers
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_5openalex-snapshot
A Concurrent Temporal Programming Model with Atomic Blocks
inferred← citeshttps://doi.org/10.1007/978-3-642-36249-1_4openalex-snapshot
Formal Modeling and Verification of Self-* Systems Based on Observer/Controller-Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_22openalex-snapshot
Dynamic Logic with Trace Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_13openalex-snapshot
Verification of a Virtual Filesystem Switch
inferred← citeshttps://doi.org/10.1007/s00165-014-0310-2openalex-snapshot
Balancing expressiveness in formal approaches to concurrency
inferred← citeshttps://doi.org/10.1007/s00165-019-00482-3openalex-snapshot
Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example
inferred← citeshttps://doi.org/10.1007/s10009-014-0308-3openalex-snapshot
KIV: overview and VerifyThis competition
inferred← citeshttps://doi.org/10.1007/s10472-013-9389-zopenalex-snapshot
RGITL: A temporal logic framework for compositional reasoning about interleaved programs
inferred← citeshttps://doi.org/10.1007/s11704-014-3342-0openalex-snapshot
A temporal programming model with atomic blocks based on projection temporal logic
inferred← citeshttps://doi.org/10.1016/j.scico.2014.04.001openalex-snapshot
Two approaches for proving linearizability of multiset
inferred← citeshttps://doi.org/10.1016/j.scico.2015.05.005openalex-snapshot
Interval-based data refinement: A uniform approach to true concurrency in discrete and real-time systems
inferred← citeshttps://doi.org/10.1109/time.2011.31openalex-snapshot
Extending ITL with Interleaved Programs for Interactive Verification
inferred← citeshttps://doi.org/10.1145/2103776.2103785openalex-snapshot
The VerCors project
inferred← citeshttps://doi.org/10.1145/2796550openalex-snapshot
Verifying Linearisability
inferred← citeshttps://doi.org/10.1145/3632924openalex-snapshot
A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.66.885openalex-snapshot
Compositional Verification of a Lock-Free Stack with RGITL
inferred← citeshttps://doi.org/10.4204/eptcs.102.5openalex-snapshot
A Formal Model of a Virtual Filesystem Switch
inferred← citeshttps://doi.org/10.4204/eptcs.94.4openalex-snapshot
A History of BlockingQueues
inferred← citeshttps://doi.org/10.48550/arxiv.1410.6268openalex-snapshot
Verifying linearizability: A comparative survey
inferred← citeshttps://doi.org/10.5445/ir/1000028184openalex-snapshot
Dynamic Trace Logic: Definition and Proofs
inferred← citeshttps://doi.org/10.5445/ir/1000039446openalex-snapshot
Towards Specification and Verification of Information Flow in Concurrent Java-like Programs
inferred← citeshttps://doi.org/10.5445/ir/1000045641openalex-snapshot
Deductive Verification of Concurrent Programs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.