On the public citation graph
The rely-guarantee method for verifying shared variable concurrent programs
0 signed · 152 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1996.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
inferredcites →https://doi.org/10.1007/3-540-50214-9_27openalex-snapshot
Using VDM with rely and guarantee-conditions
inferredcites →https://doi.org/10.1007/3-540-54430-5_110openalex-snapshot
A method for the development of totally correct shared-state parallel programs
inferredcites →https://doi.org/10.1007/3-540-54834-3_20openalex-snapshot
An attempt to reason about shared-state concurrency in the style of VDM
inferredcites →https://doi.org/10.1007/3-540-56610-4_67openalex-snapshot
Application of the composition principle to unity-like specifications
inferredcites →https://doi.org/10.1007/3-540-59293-8_200openalex-snapshot
Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4471-3756-6_15openalex-snapshot
A Theory of State-based Parallel Programming: Part 1
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_22openalex-snapshot
On Unifying Assumption—Commitment Style Proof Rules for Concurrency
inferredcites →https://doi.org/10.1007/bf00122417openalex-snapshot
Accommodating interference in the formal design of concurrent object-based programs
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00289262openalex-snapshot
Recursive assertions and parallel programs
inferredcites →https://doi.org/10.1007/bf00289263openalex-snapshot
Proving total correctness of nondeterministic programs in infinitary logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90033-3openalex-snapshot
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.25405/ncl.34131210openalex-snapshot
Development methods for computer programs including a notion of interference
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11415787_8openalex-snapshot
A Stepwise Development of the Peterson’s Mutual Exclusion Algorithm Using B Abstract Systems
inferred← citeshttps://doi.org/10.1007/11576280_27openalex-snapshot
Incremental Verification of Owicki/Gries Proof Outlines Using PVS
inferred← citeshttps://doi.org/10.1007/11817963_44openalex-snapshot
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
inferred← citeshttps://doi.org/10.1007/11888116_12openalex-snapshot
Automatic Synthesis of Assumptions for Compositional Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_24openalex-snapshot
The Rely-Guarantee Method in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferred← citeshttps://doi.org/10.1007/3-540-36578-8_6openalex-snapshot
Composing Specifications of Event Based Applications
inferred← citeshttps://doi.org/10.1007/3-540-44947-7_5openalex-snapshot
Adding Temporal Annotations and Associated Verification to the Ravenscar Profile
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_16openalex-snapshot
Formal justification of the rely-guarantee paradigm for shared-variable concurrency: a semantic approach
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_12openalex-snapshot
A Perfecto Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_25openalex-snapshot
Compositional Symmetric Sharing in B
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_1openalex-snapshot
The Need for Compositional Proof Systems: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_21openalex-snapshot
Lazy Compositional Verication
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_22openalex-snapshot
Compositional Reasoning Using the Assumption-Commitment Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-60406-5_7openalex-snapshot
Using a symbolic model checker for verify safety properties in SA/RT models
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_27openalex-snapshot
A compositional proof system for shared variable concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_11openalex-snapshot
A Parametric Rely-Guarantee Reasoning Framework for Concurrent Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-48077-6_2openalex-snapshot
Adding Concurrency to a Sequential Refinement Tower
inferred← citeshttps://doi.org/10.1007/978-3-030-76020-5_14openalex-snapshot
Flashix: Modular Verification of a Concurrent and Crash-Safe Flash File System
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_16openalex-snapshot
Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory Models
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-37706-8_11openalex-snapshot
Rely-Guarantee Reasoning for Causally Consistent Shared Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_6openalex-snapshot
Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_1openalex-snapshot
Jifeng He at Oxford and Beyond: An Appreciation
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_11openalex-snapshot
Assume-Guarantee Reasoning for Additive Hybrid Behaviour
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-031-47705-8_10openalex-snapshot
Lifting the Reasoning Level in Generic Weak Memory Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_5openalex-snapshot
A Denotational Approach to Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-66673-5_4openalex-snapshot
On the Relational Basis of Early R/G Work
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_5openalex-snapshot
A Rely-Guarantee Framework for Proving Deadlock Freedom Under Causal Consistency
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_25openalex-snapshot
Detecting Speculative Execution Vulnerabilities on Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_27openalex-snapshot
Unifying Weak Memory Verification Using Potentials
inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_18openalex-snapshot
Two-sorted algebraic decompositions of Brookes’s shared-state denotational semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-98208-8_19openalex-snapshot
Detecting Speculative Data Flow Vulnerabilities Using Weakest Precondition Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_7openalex-snapshot
Operational and Algebraic Approaches to the Two-Run Relational System
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_9openalex-snapshot
Rely-Guarantee Is Coinductive
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_20openalex-snapshot
Generating Rely-Guarantee Conditions with the Conditional-Writes Domain
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_6openalex-snapshot
Towards Proving Liveness on Weak Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_2openalex-snapshot
On Rely-Guarantee Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_17openalex-snapshot
Towards a Proof Method for Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_4openalex-snapshot
Observation-Based Concurrent Program Logic for Relaxed Memory Consistency Models
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_24openalex-snapshot
Assertion-Based Reasoning Method for Calculus of Wireless System
inferred← citeshttps://doi.org/10.1007/978-3-319-64021-1_3openalex-snapshot
Overview of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_13openalex-snapshot
Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_31openalex-snapshot
Compositional Reasoning for Shared-Variable Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot
A Marriage of Rely/Guarantee and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-76650-6_21openalex-snapshot
Calculating and Composing Progress Properties in Terms of the Leads-to Relation
inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_27openalex-snapshot
A Basis for Verifying Multi-threaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-04570-7_8openalex-snapshot
Compositional Verification of a Communication Protocol for a Remotely Operated Vehicle
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_1openalex-snapshot
A Bibliography of Willem-Paul de Roever
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_7openalex-snapshot
A Formal Approach to Analyzing Interference Problems in Aspect-Oriented Designs
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_4openalex-snapshot
Compositionality Entails Sequentializability
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_24openalex-snapshot
A Coinductive Calculus for Asynchronous Side-Effecting Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_20openalex-snapshot
Using Locales to Define a Rely-Guarantee Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-33826-7_12openalex-snapshot
The Rely/Guarantee Approach to Verifying Concurrent BPEL Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_28openalex-snapshot
CSimpl: A Rely-Guarantee-Based Framework for Verifying Concurrent Programs
inferred← citeshttps://doi.org/10.1007/bfb0058036openalex-snapshot
Hoare-Style compositional proof systems for reactive shared variable concurrency
inferred← citeshttps://doi.org/10.1007/s00165-003-0005-6openalex-snapshot
Compositional Action System Refinement
inferred← citeshttps://doi.org/10.1007/s00165-008-0092-5openalex-snapshot
Trace-based derivation of a scalable lock-free stack algorithm
inferred← citeshttps://doi.org/10.1007/s00165-016-0407-xopenalex-snapshot
Tournaments for mutual exclusion: verification and concurrent complexity
inferred← citeshttps://doi.org/10.1007/s001650050027openalex-snapshot
Design for Proof: An Approach to the Design of Domain-Specific Languages
inferred← citeshttps://doi.org/10.1007/s001650070032openalex-snapshot
ADL: An Activity Description Language for Real-Time Networks
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/s10515-005-2641-yopenalex-snapshot
Component Verification with Automatically Generated Assumptions
inferred← citeshttps://doi.org/10.1007/s10703-021-00370-8openalex-snapshot
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs
inferred← citeshttps://doi.org/10.1007/s11704-008-0039-2openalex-snapshot
Verifying BPEL-like programs with Hoare logic
inferred← citeshttps://doi.org/10.1016/j.ic.2013.08.012openalex-snapshot
A coinductive calculus for asynchronous side-effecting processes
inferred← citeshttps://doi.org/10.1016/j.scico.2011.10.011openalex-snapshot
Compositional verification of a communication protocol for a remotely operated aircraft
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.2024.103227openalex-snapshot
Verification of forward simulations with thread-local, step-local proof obligations
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.006openalex-snapshot
Program equivalence in linear contexts
inferred← citeshttps://doi.org/10.1017/s0960129510000241openalex-snapshot
Axiomatic semantics of projection temporal logic programs
inferred← citeshttps://doi.org/10.1093/logcom/exm030openalex-snapshot
A Structural Proof of the Soundness of Rely/guarantee Rules
inferred← citeshttps://doi.org/10.1109/ase.2002.1114984openalex-snapshot
Assumption generation for software component verification
inferred← citeshttps://doi.org/10.1109/ase.2015.33openalex-snapshot
Interpolation Guided Compositional Verification (T)
inferred← citeshttps://doi.org/10.1109/ats.2015.42openalex-snapshot
A New Approach for Minimal Environment Construction for Modular Property Verification
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00017openalex-snapshot
A Dafny-based approach to thread-local information flow analysis
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00019openalex-snapshot
Using cylindric algebra to support local variables in rely/guarantee concurrency
inferred← citeshttps://doi.org/10.1109/iceccs.1995.479336openalex-snapshot
Compositional reasoning about projected and infinite time
inferred← citeshttps://doi.org/10.1109/iceccs.2007.39openalex-snapshot
Reasoning about Nonblocking Concurrency using Reduction
inferred← citeshttps://doi.org/10.1109/iceccs51672.2020.00013openalex-snapshot
Automatic Verification of Multi-threaded Programs by Inference of Rely-Guarantee Specifications
inferred← citeshttps://doi.org/10.1109/reldis.2003.1238069openalex-snapshot
A systematic approach to the development of event based applications
inferred← citeshttps://doi.org/10.1109/ssiri.2009.20openalex-snapshot
Verifying Aspect-Oriented Programs Using Open Temporal Logic
inferred← citeshttps://doi.org/10.1109/tase.2007.1openalex-snapshot
A Certified Thread Library for Multithreaded User Programs
inferred← citeshttps://doi.org/10.1109/tase.2008.41openalex-snapshot
Verifying BPEL-Like Programs with Hoare Logic
inferred← citeshttps://doi.org/10.1109/tase.2010.10openalex-snapshot
Axiomatic Temporal Logic Programs Verification
inferred← citeshttps://doi.org/10.1109/tase.2013.14openalex-snapshot
Formal Analysis of AODV Using Rely-Guarantee
inferred← citeshttps://doi.org/10.1109/tase49443.2020.00021openalex-snapshot
Rely-Guarantee Reasoning about Messaging System for Autonomous Vehicles
inferred← citeshttps://doi.org/10.1109/tc.2010.94openalex-snapshot
Counterexample-Guided Assume-Guarantee Synthesis through Learning
inferred← citeshttps://doi.org/10.1109/time.2011.12openalex-snapshot
Interleaved Programs and Rely-Guarantee Reasoning with ITL
inferred← citeshttps://doi.org/10.1109/tse.2013.57openalex-snapshot
Learning Assumptions for CompositionalVerification of Timed Systems
inferred← citeshttps://doi.org/10.1109/ukrcon.2019.8880029openalex-snapshot
Compositional-Nominative Approach to the Client-Server Systems Properties Proofs within Different Formal Execution Models
inferred← citeshttps://doi.org/10.1145/1233843.1233848openalex-snapshot
Rely-guarantee approach to reasoning about aspect-oriented programs
inferred← citeshttps://doi.org/10.1145/1353482.1353489openalex-snapshot
Reasoning about aspects with common sense
inferred← citeshttps://doi.org/10.1145/1394496.1394499openalex-snapshot
Enforcing behavioral constraints in evolving aspect-oriented programs
inferred← citeshttps://doi.org/10.1145/1529282.1529402openalex-snapshot
Local reasoning for abstraction and sharing
inferred← citeshttps://doi.org/10.1145/2187671.2187678openalex-snapshot
Behavioral interface specification languages
inferred← citeshttps://doi.org/10.1145/2837614.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferred← citeshttps://doi.org/10.1145/2914770.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferred← citeshttps://doi.org/10.1145/3276501openalex-snapshot
Horn-ICE learning for synthesizing invariants and contracts
inferred← citeshttps://doi.org/10.1145/3276529openalex-snapshot
Compositional programming and testing of dynamic distributed systems
inferred← citeshttps://doi.org/10.1145/3574137openalex-snapshot
Compositional Reasoning for Non-multicopy Atomic Architectures
inferred← citeshttps://doi.org/10.1145/3656399openalex-snapshot
Compositional Semantics for Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1145/3701729openalex-snapshot
A Proof System for the SMrCaIT Calculus
inferred← citeshttps://doi.org/10.1145/3715096openalex-snapshot
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1145/3776706openalex-snapshot
An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories
inferred← citeshttps://doi.org/10.1145/3801150openalex-snapshot
Reasoning about expression evaluation under interference
inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
inferred← citeshttps://doi.org/10.13140/rg.2.1.2454.1281openalex-snapshot
Towards Certified Program Logics for the Verification of Imperative Programs
inferred← citeshttps://doi.org/10.15407/pp2016.02-03.113openalex-snapshot
Peterson’s algorithm Total correctness proof in IPCL
inferred← citeshttps://doi.org/10.2197/ipsjjip.25.244openalex-snapshot
Concurrent Program Logic for Relaxed Memory Consistency Models with Dependencies across Loop Iterations
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603020openalex-snapshot
Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms
inferred← citeshttps://doi.org/10.25405/ncl.34130049openalex-snapshot
A structural proof of the soundness of rely/guarantee rules (revised)
inferred← citeshttps://doi.org/10.29007/l2spopenalex-snapshot
Proving Simpson's Four-Slot Algorithm Using Ownership Transfer
inferred← citeshttps://doi.org/10.3233/aic-2010-0458openalex-snapshot
Interactive verification of concurrent systems using symbolic execution
inferred← citeshttps://doi.org/10.3929/ethz-a-005575233openalex-snapshot
Modeling and verifying embedded operating systems
inferred← citeshttps://doi.org/10.3990/1.9789036548984openalex-snapshot
Deductive techniques for model-based concurrency verification
inferred← citeshttps://doi.org/10.48456/tr-726openalex-snapshot
Modular fine-grained concurrency verification
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01416openalex-snapshot
New Lace and Arsenic: adventures in weak memory with a program logic
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02775openalex-snapshot
A Thread-Local Semantics and Efficient Static Analyses for Race Free Programs
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
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-1614/paper_75.pdfopenalex-snapshot
Application of the Method for Concurrent Programs Properties Proof to Real-World Industrial Software Systems
inferred← citeshttps://doi.org/10.59471/raia202387openalex-snapshot
Verificación de Programas Distribuidos
inferred← citeshttps://doi.org/10.6100/ir612838openalex-snapshot
Constructive formal methods and protocol standardization
inferred← citeshttps://doi.org/10.70675/fce22fcdz3ea4z44e7z9f6ez023636445af0openalex-snapshot
Développement prouvé de structures de données sans verrou
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.