On the public citation graph
An axiomatic proof technique for parallel programs I
0 signed · 931 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.1007/978-1-4612-6315-9_16openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_6openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1007/bf00264034openalex-snapshot
Consistent and complementary formal theories of the semantics of programming languages
inferredcites →https://doi.org/10.1007/bf00288744openalex-snapshot
Proving properties of interacting processes
inferredcites →https://doi.org/10.1016/0304-3975(76)90032-3openalex-snapshot
Correctness of parallel programs: The Church-Rosser approach
inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot
Proving assertions about parallel programs
inferredcites →https://doi.org/10.1109/swat.1973.14openalex-snapshot
Mechanizable proofs about parallel processes
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/361268.361277openalex-snapshot
Synchronization of communicating processes
inferredcites →https://doi.org/10.1145/363095.363143openalex-snapshot
The structure of the “THE”-multiprogramming system
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471028959.sof056openalex-snapshot
Concurrency in Software Engineering
inferred← citeshttps://doi.org/10.1002/1096-9128(200007)12:8<755::aid-cpe508>3.0.co;2-mopenalex-snapshot
Design of the Kan distributed object system
inferred← citeshttps://doi.org/10.1002/cpe.3659openalex-snapshot
Dekker's mutual exclusion algorithm made RW‐safe
inferred← citeshttps://doi.org/10.1002/cpe.4330070602openalex-snapshot
Distributed implementations of communicating objects
inferred← citeshttps://doi.org/10.1002/cpe.70484openalex-snapshot
Weak Memory Model Formalisms: Introduction and Survey
inferred← citeshttps://doi.org/10.1002/spe.4380110304openalex-snapshot
A modula based language supporting hierarchical development and verification
inferred← citeshttps://doi.org/10.1002/spe.4380140803openalex-snapshot
The use of ghost variables and virtual programming in the documentation and verification of programs
inferred← citeshttps://doi.org/10.1002/stvr.274openalex-snapshot
Combining formal verification and conformance testing for validating reactive systems
inferred← citeshttps://doi.org/10.1006/inco.1996.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
inferred← citeshttps://doi.org/10.1007/10722060_22openalex-snapshot
Exceptions in OO Languages: Using Them and Reasoning about Them
inferred← citeshttps://doi.org/10.1007/11576280_27openalex-snapshot
Incremental Verification of Owicki/Gries Proof Outlines Using PVS
inferred← citeshttps://doi.org/10.1007/11589976_19openalex-snapshot
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/11783596_11openalex-snapshot
Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_162openalex-snapshot
Another approach for proving program correctness
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_67openalex-snapshot
Semantics of nondeterminism, concurrency and communication
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_29openalex-snapshot
On reductions of parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-10001-6_28openalex-snapshot
Reductions of nets and parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_65openalex-snapshot
Semantic analysis of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_11openalex-snapshot
Procedures and concurrency: A study in proof
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_16openalex-snapshot
Proving the correctness of implementations of shared data abstractions
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_7openalex-snapshot
A weakest precondition semantics for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_371openalex-snapshot
A verifier for compact parallel coordination programs
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_3openalex-snapshot
Transformations realizing fairness assumptions for parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_67openalex-snapshot
Proof rules for communication abstractions
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_90openalex-snapshot
Proof rules for communication abstractions
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_21openalex-snapshot
Synthesis of parallel programs invariants
inferred← citeshttps://doi.org/10.1007/3-540-15239-3_16openalex-snapshot
Owicki & Gries: Verification of parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_26openalex-snapshot
A proof system for Distributed Processes
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_4openalex-snapshot
An axiomatic treatment of a parallel programming language
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_1openalex-snapshot
On the axiomatic treatment of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_11openalex-snapshot
Concurrent behaviour: Sequences, processes and axioms
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_2openalex-snapshot
Hierarchical development of concurrent systems in a temporal logic framework
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_5openalex-snapshot
Axioms for memory access in asynchronous hardware systems
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_4openalex-snapshot
A class of termination detection algorithms for distributed computations
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_90openalex-snapshot
A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_15openalex-snapshot
Design and proof of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_16openalex-snapshot
On axiomatic defintion of max-model of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_16openalex-snapshot
Semantically based axiomatics
inferred← citeshttps://doi.org/10.1007/3-540-36103-0_5openalex-snapshot
Unifying Theories of Parallel Programming
inferred← citeshttps://doi.org/10.1007/3-540-36208-8_19openalex-snapshot
Formal Techniques for Java-like Programs
inferred← citeshttps://doi.org/10.1007/3-540-44525-0_10openalex-snapshot
Playing with Abstraction and Refinement for Managing Features Interactions
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_57openalex-snapshot
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_18openalex-snapshot
Proof-Outlines for Threads in Java
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_79openalex-snapshot
Towards Formally Refining BSP Barriers into Explicit Two — Sided Communications
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_9openalex-snapshot
A Technique for Invariant Generation
inferred← citeshttps://doi.org/10.1007/3-540-45426-8_6openalex-snapshot
An Environment for the Integrated Modelling of Systems with Complex Continuous and Discrete Dynamics
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_17openalex-snapshot
Refining Interactions in a Distributed System
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_1openalex-snapshot
UppaaL Implementation Secrets
inferred← citeshttps://doi.org/10.1007/3-540-45927-8_19openalex-snapshot
Thread-Modular Verification for Shared-Memory Programs
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_2openalex-snapshot
Verification for Java’s Reentrant Multithreading Concept
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_11openalex-snapshot
Compositional Proofs for Concurrent Objects
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_15openalex-snapshot
Composition: A Way to Make Proofs Harder
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_21openalex-snapshot
Lazy Compositional Verication
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_18openalex-snapshot
A Trace-Based Refinement Calculus for Shared-Variable Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_55openalex-snapshot
Compositionality in the temporal logic of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_11openalex-snapshot
Towards a calculus of data refinement
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_12openalex-snapshot
Stepwise refinement and concurrency: A small exercise
inferred← citeshttps://doi.org/10.1007/3-540-51604-2_3openalex-snapshot
Parallel programming techniques for linear algebra
inferred← citeshttps://doi.org/10.1007/3-540-51604-2_5openalex-snapshot
Parallel LU decomposition on a transputer network
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_34openalex-snapshot
Compositionality and modularity in process specification and design: A trace-state based approach
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_23openalex-snapshot
What are the limits of model checking methods for the verification of real life protocols?
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_43openalex-snapshot
Design methods based on nets
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_77openalex-snapshot
Multivalued possibilities mappings
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_62openalex-snapshot
Development of concurrent systems by incremental transformation
inferred← citeshttps://doi.org/10.1007/3-540-53912-3_18openalex-snapshot
Using transformations to verify parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_55openalex-snapshot
Loosely-coupled processes (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_62openalex-snapshot
Program refinement in fair transition systems
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_127openalex-snapshot
Program composition and modular verification
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_110openalex-snapshot
A method for the development of totally correct shared-state parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_96openalex-snapshot
Action systems and action refinement in the development of parallel systems
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_20openalex-snapshot
An attempt to reason about shared-state concurrency in the style of VDM
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_17openalex-snapshot
Protocol design by layered decomposition
inferred← citeshttps://doi.org/10.1007/3-540-55160-3_33openalex-snapshot
On the UNITY design decisions
inferred← citeshttps://doi.org/10.1007/3-540-55160-3_54openalex-snapshot
A distributed implementation of a task pool
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_133openalex-snapshot
A framework for parallel composition of protocols
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_2openalex-snapshot
Combining Petri Nets and other formal methods
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_21openalex-snapshot
The granularity of waiting (extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_16openalex-snapshot
Verification in process algebra of the distributed control of track vehicles—A case study
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_27openalex-snapshot
Crocos: An integrated environment for interactive verification of SDL specifications
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_28openalex-snapshot
Benign failure models for shared memory
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_44openalex-snapshot
Compositional C++: Compositional parallel programming
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_6openalex-snapshot
Programming with behaviors in an ML framework — The syntax and semantics of LCS
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_23openalex-snapshot
Verification and specification of concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_79openalex-snapshot
Reasoning about programs by exploiting the environment
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_72openalex-snapshot
A proof system for asynchronously communicating deterministic processes
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_165openalex-snapshot
Verification of an audio control protocol
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_175openalex-snapshot
Layering of real-time distributed processes
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_141openalex-snapshot
Extending the limits of sequentially phased reasoning
inferred← citeshttps://doi.org/10.1007/3-540-59450-7_3openalex-snapshot
Correctness-preserving transformations for the design of parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_64openalex-snapshot
Logical foundations for compositional verification and development of concurrent programs in UNITY
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_11openalex-snapshot
A compositional proof system for asynchronously communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_23openalex-snapshot
A refinement relation supporting the transition from unbounded to bounded communication buffers
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_14openalex-snapshot
Verification of a distributed summation algorithm
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_12openalex-snapshot
Layers as knowledge transitions in the design of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_103openalex-snapshot
The incremental development of correct specifications for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_97openalex-snapshot
Local nondeterminism in asynchronously communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_85openalex-snapshot
Modular verification for shared-variable concurrent programs
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/3-540-65307-4_46openalex-snapshot
Petri nets, process algebras and concurrent programming languages
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_182openalex-snapshot
Owicki-Gries Method of Axiomatic Verification
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_301openalex-snapshot
Monitors, Axiomatic Verification of
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_1openalex-snapshot
Wanted: a compositional approach to concurrency
inferred← citeshttps://doi.org/10.1007/978-0-387-35082-0_9openalex-snapshot
Some Specification and Proof Steps of a Spanning Tree Algorithm with an Object-Oriented Method
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_16openalex-snapshot
The design of a linearization of a concurrent data object
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_8openalex-snapshot
A proof theory of asynchronously communicating sequential processes
inferred← citeshttps://doi.org/10.1007/978-1-4471-0997-6_21openalex-snapshot
Safe combinations of services using B
inferred← citeshttps://doi.org/10.1007/978-1-4471-3240-0_11openalex-snapshot
Laws of Parallel Programming with Shared Variables
inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_5openalex-snapshot
Concurrent and Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_20openalex-snapshot
Temporal Specifications Directed by Grammar and Design of Process Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_16openalex-snapshot
A case study in formally developing state-based parallel programs—the Dutch National Torus
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_17openalex-snapshot
Proving Total Correctness with Respect to a Fair (Shared-State) Parallel Language
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_15openalex-snapshot
A Theory of State-based Parallel Programming: Part 1
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_16openalex-snapshot
Design, verification and documentation of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_16openalex-snapshot
Defining Conditional Independence Using Collapses
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_21openalex-snapshot
Distributed Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_1openalex-snapshot
Proving Termination of Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_6openalex-snapshot
Programs, Semantics and Effective Atomicity
inferred← citeshttps://doi.org/10.1007/978-1-4757-2714-2_4openalex-snapshot
Disjoint Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-2714-2_5openalex-snapshot
Parallel Programs with Shared Variables
inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_5openalex-snapshot
Disjoint Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_6openalex-snapshot
Parallel Programs with Shared Variables
inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_7openalex-snapshot
Parallel Programs with Synchronization
inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_2openalex-snapshot
Models for Robust Computation
inferred← citeshttps://doi.org/10.1007/978-1-84882-736-3_7openalex-snapshot
Separation Logic and Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-01461-2_2openalex-snapshot
Concurrency: Handling Interference Formally
inferred← citeshttps://doi.org/10.1007/978-3-030-03418-4_24openalex-snapshot
Modelling by Patterns for Correct-by-Construction Process
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_8openalex-snapshot
The Inner and Outer Algebras of Unified Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-32441-4_9openalex-snapshot
Teaching Concurrency with the Disappearing Formal Method
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_2openalex-snapshot
Verification by Construction of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_19openalex-snapshot
Practical Abstractions for Automated Verification of Shared-Memory Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_3openalex-snapshot
Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads
inferred← citeshttps://doi.org/10.1007/978-3-030-61470-6_7openalex-snapshot
Thirty-Seven Years of Relational Hoare Logic: Remarks on Its Principles and History
inferred← citeshttps://doi.org/10.1007/978-3-030-64354-6_13openalex-snapshot
SymPaths: Symbolic Execution Meets Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-64354-6_6openalex-snapshot
Constraint-Based Contract Inference for Deductive Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-88806-0_21openalex-snapshot
Compositional Verification of Smart Contracts Through Communication Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_13openalex-snapshot
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_22openalex-snapshot
Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_12openalex-snapshot
Parallelized Sequential Composition and Hardware Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_9openalex-snapshot
View-Based Owicki–Gries Reasoning for Persistent x86-TSO
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_9openalex-snapshot
Reasoning About Active Objects: A Sound and Complete Assertional Proof Method
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_15openalex-snapshot
A Proof System for Cyber-Physical Systems with Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_5openalex-snapshot
Separation of Concerning Things: A Simpler Basis for Defining and Programming with the C/C++ Memory Model
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_17openalex-snapshot
Reasoning About Promises in Weak Memory Models with Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_19openalex-snapshot
VeyMont: Parallelising Verified Programs Instead of Verifying Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_17openalex-snapshot
View-Based Axiomatic Reasoning for PSO
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-37706-8_9openalex-snapshot
nekton: A Linearizability Proof Checker
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_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-42441-0_10openalex-snapshot
Verification of the Busy-Forbidden Protocol
inferred← citeshttps://doi.org/10.1007/978-3-031-43681-9_13openalex-snapshot
Applying Rely-Guarantee Reasoning on Concurrent Memory Management and Mailbox in $$\mu $$C/OS-II: A Case Study
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-66676-6_10openalex-snapshot
What Is a Garbage Collector? An Exercise in Compositional Refinement
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_2openalex-snapshot
Captured: Compositional and Modular Approaches to Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_4openalex-snapshot
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures
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_27openalex-snapshot
Unifying Weak Memory Verification Using Potentials
inferred← citeshttps://doi.org/10.1007/978-3-031-73887-6_19openalex-snapshot
Three Ways of Proving Termination of Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_15openalex-snapshot
Beyond Concurrent Separation Logic: Who is Afraid of Completeness Proofs?
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_3openalex-snapshot
Arithmetizing Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_7openalex-snapshot
A Rely-Guarantee-Based Simulation for Cooperative Semantics
inferred← citeshttps://doi.org/10.1007/978-3-032-13711-1_4openalex-snapshot
The Beauty of Predicate Automata
inferred← citeshttps://doi.org/10.1007/978-3-032-13711-1_8openalex-snapshot
PVS as a Proof Obligation Generator
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-032-26220-2_20openalex-snapshot
Reasoning over Relaxed Shared Memory Models: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_5openalex-snapshot
Verification of Concurrent Systems with VerCors
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_22openalex-snapshot
A Compositional Proof Method for Linearizability Applied to a Wait-Free Multiset
inferred← citeshttps://doi.org/10.1007/978-3-319-11587-0_1openalex-snapshot
Playing with State-Based Models for Designing Better Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_7openalex-snapshot
A Program Construction and Verification Tool for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_26openalex-snapshot
Automated and Modular Refinement Reasoning for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_6openalex-snapshot
History-Based Verification of Functional Behaviour of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-25423-4_14openalex-snapshot
History-Based Specification and Verification of Scalable Concurrent and Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_11openalex-snapshot
Verifying Concurrent Data Structures Using Data-Expansion
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_1openalex-snapshot
Program Verification: To Err is Human
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_16openalex-snapshot
Effectively Eliminating Auxiliaries
inferred← citeshttps://doi.org/10.1007/978-3-319-33693-0_13openalex-snapshot
Towards a Thread-Local Proof Technique for Starvation Freedom
showing the first 200 of 918 · page through all 918
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.