On the public citation graph
The ?Hoare logic? of concurrent programs
0 signed · 164 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/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot
Proving assertions about parallel programs
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-12896-4_363openalex-snapshot
Deciding branching time logic: A triple exponential decision procedure for CTL
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_3openalex-snapshot
The role of proof obligations in software design
inferred← citeshttps://doi.org/10.1007/3-540-15239-3_15openalex-snapshot
Lamport: Verification of concurrent programs
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-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-36103-0_5openalex-snapshot
Unifying Theories of Parallel Programming
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-45619-8_3openalex-snapshot
An Abductive Approach for Analysing Event-Based Requirements Specifications
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-50302-1_5openalex-snapshot
From a synchronous declarative language to a temporal logic dealing with multiform time
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_12openalex-snapshot
Stepwise refinement and concurrency: A small exercise
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-54430-5_96openalex-snapshot
Action systems and action refinement in the development of parallel systems
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_74openalex-snapshot
On the semantics of atomized statements — the parallel-choice option —
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-56496-9_27openalex-snapshot
Crocos: An integrated environment for interactive verification of SDL specifications
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-58468-4_157openalex-snapshot
Hybrid verification by exploiting the environment
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-3227-1_33openalex-snapshot
On using a Composition Principle to Design Parallel Programs
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-4615-6698-4_22openalex-snapshot
Specifying and Verifying Protocols Represented as Abstract Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-03421-4_7openalex-snapshot
A Language-Independent Program Verification Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-21410-8_46openalex-snapshot
Novel Designs for Memory Checkers Using Semantics and Digital Sequential Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-74950-1openalex-snapshot
The Huawei and Snowden Questions: Can Electronic Equipment from Untrusted Vendors be Verified? Can an Untrusted Vendor Build Trust into Electronic Equipment?
inferred← citeshttps://doi.org/10.1007/978-3-642-61455-2_17openalex-snapshot
Notes on Proof Outline Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_4openalex-snapshot
An Axiomatic Semantics of Concurrent Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-84542-0_7openalex-snapshot
Extending the Techniques to Parallel Programs
inferred← citeshttps://doi.org/10.1007/bf00244290openalex-snapshot
On the role of automated theorem proving in the compile-time derivation of concurrency
inferred← citeshttps://doi.org/10.1007/bf00264294openalex-snapshot
General predicate transformer and the semantics of a programming language with go to statement
inferred← citeshttps://doi.org/10.1007/bf00264361openalex-snapshot
Redundant proofs of non-interference in Levin-Gries CSP program proofs
inferred← citeshttps://doi.org/10.1007/bf00291052openalex-snapshot
Specification and verification of database dynamics
inferred← citeshttps://doi.org/10.1007/bf01069174openalex-snapshot
Practical methods of program verification
inferred← citeshttps://doi.org/10.1007/bf01130532openalex-snapshot
Algebraic-grammatical models of parallel computation
inferred← citeshttps://doi.org/10.1007/bf01178381openalex-snapshot
Invariants, composition, and substitution
inferred← citeshttps://doi.org/10.1007/bf01211310openalex-snapshot
Axiomatic treatment of processes with shared variables revisited
inferred← citeshttps://doi.org/10.1007/bf01211458openalex-snapshot
The semantics of the combination of atomized statements and parallel choice
inferred← citeshttps://doi.org/10.1007/bf01212527openalex-snapshot
Verifying a distributed list system: A case history
inferred← citeshttps://doi.org/10.1007/bf01221097openalex-snapshot
Process algebra with guards: Combining Hoare logic with process algebra
inferred← citeshttps://doi.org/10.1007/bf01383968openalex-snapshot
Verification of the Futurebus+ cache coherence protocol
inferred← citeshttps://doi.org/10.1007/bf01872845openalex-snapshot
Semantics and verification of monitors and systems of monitors and processes
inferred← citeshttps://doi.org/10.1007/bf02280829openalex-snapshot
Wait-free linearization with an assertional proof
inferred← citeshttps://doi.org/10.1007/bfb0002714openalex-snapshot
Unifying theories for parallel programming
inferred← citeshttps://doi.org/10.1007/bfb0013037openalex-snapshot
Towards a temporal logic for causality and choice in distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0014000openalex-snapshot
A stuttering closed temporal logic for modular reasoning about concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0015773openalex-snapshot
A complete compositional modal proof system for a subset of CCS
inferred← citeshttps://doi.org/10.1007/bfb0015776openalex-snapshot
Compositionality and concurrent networks: Soundness and completeness of a proofsystem
inferred← citeshttps://doi.org/10.1007/bfb0016280openalex-snapshot
A proof system to derive eventuality properties under justice hypothesis
inferred← citeshttps://doi.org/10.1007/bfb0025784openalex-snapshot
Program logics and program verification
inferred← citeshttps://doi.org/10.1007/bfb0027044openalex-snapshot
The quest goes on: A survey of proofsystems for partial correctness of CSP
inferred← citeshttps://doi.org/10.1007/bfb0027049openalex-snapshot
Concepts for concurrent programming
inferred← citeshttps://doi.org/10.1007/bfb0036894openalex-snapshot
An axiomatization of the intermittent assertion method using temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0039067openalex-snapshot
A programming logic for formal concurrent systems
inferred← citeshttps://doi.org/10.1007/pl00003939openalex-snapshot
SCTL-MUS: A Formal Methodology for Software Development of Distributed Systems. A Case Study
inferred← citeshttps://doi.org/10.1007/s001650200023openalex-snapshot
On Verification of Parallel Message-Passing Processes
inferred← citeshttps://doi.org/10.1007/s10992-011-9195-1openalex-snapshot
Fine-grained Concurrency with Separation Logic
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90039-xopenalex-snapshot
The liveness property of on-the-fly garbage collector—a proof
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90014-xopenalex-snapshot
An assertional correctness proof of a distributed algorithm
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90018-2openalex-snapshot
A proof system for concurrent ADA programs
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90020-eopenalex-snapshot
Stepwise refinement and concurrency: the finite-state case
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00002-aopenalex-snapshot
Verifying programs that use causally-ordered message-passing
inferred← citeshttps://doi.org/10.1016/0167-739x(90)90025-9openalex-snapshot
Compositionality in the temporal logic of concurrent systems (extended abstract)
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90033-3openalex-snapshot
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0306-4379(86)90023-2openalex-snapshot
The INFOLOG linear tense propositional logic of events and transactions
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90018-7openalex-snapshot
A language independent proof of the soundness and completeness of generalized Hoare logic
inferred← citeshttps://doi.org/10.1016/b978-0-12-373892-9.00010-4openalex-snapshot
Verification and Security Issues in On-Chip Communication Architecture Design
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50007-3openalex-snapshot
Concepts and notations for concurrent programming**Reprinted from: ACM Computing Surveys, 15(1), March 1983 with permission of the Association for Computing Machinery Inc.
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115560openalex-snapshot
The Autonomous Data Language – Concepts, design and formal verification
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116150openalex-snapshot
Probabilistic predicate transformers II: partially observable probability
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80047-9openalex-snapshot
Deciding full branching time logic
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80037-7openalex-snapshot
Syntax directed analysis of liveness properties of while programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00421-7openalex-snapshot
Correctness of substring-preprocessing in Boyer–Moore's pattern matching algorithm
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00035-8openalex-snapshot
Syntax-directed model checking of sequential programs
inferred← citeshttps://doi.org/10.1023/a:1018552818225openalex-snapshot
Formation of hydride in zircaloy-4 cladding tube
inferred← citeshttps://doi.org/10.1049/ip-sen:20030131openalex-snapshot
Predicate transformers in the semantics of Circus
inferred← citeshttps://doi.org/10.1051/ita/1987210302871openalex-snapshot
Méthode axiomatique sur les propriétés de fatalité des programmes parallèles
inferred← citeshttps://doi.org/10.1080/00207729708929473openalex-snapshot
Automating the refinement of specifications for distributed systems via syntactic transformations
inferred← citeshttps://doi.org/10.1109/32.44363openalex-snapshot
Verifying general safety properties of Ada tasking programs
inferred← citeshttps://doi.org/10.1109/32.58782openalex-snapshot
The specification and verified decomposition of system requirements using CSP
inferred← citeshttps://doi.org/10.1109/43.277609openalex-snapshot
Formal verification of sequential hardware: a tutorial
inferred← citeshttps://doi.org/10.1109/43.913756openalex-snapshot
Using word-level ATPG and modular arithmetic constraint-solving techniques for assertion property checking
inferred← citeshttps://doi.org/10.1109/acc.2016.7525009openalex-snapshot
Symbolic construction of GR(1) contracts for systems with full information
inferred← citeshttps://doi.org/10.1109/apsec.2000.896683openalex-snapshot
The LAST project: development of a formal method for IS-specification and of a CASE-tool for IS-design
inferred← citeshttps://doi.org/10.1109/ase.1999.802128openalex-snapshot
Modular and incremental analysis of concurrent software systems
inferred← citeshttps://doi.org/10.1109/cise.2010.5676835openalex-snapshot
Modeling Traverse Feature in Concurrent Software System with UML Statecharts
inferred← citeshttps://doi.org/10.1109/correctness.2018.00012openalex-snapshot
Towards Deductive Verification of Message-Passing Parallel Programs
inferred← citeshttps://doi.org/10.1109/csd.1998.657551openalex-snapshot
Verifying fault tolerance of distributed algorithms formally-an example
inferred← citeshttps://doi.org/10.1109/csse.2008.844openalex-snapshot
Research on Modeling Traversing Features in Concurrent Software System
inferred← citeshttps://doi.org/10.1109/gcce50665.2020.9291945openalex-snapshot
A Node-Style Visual Programming Environment for the nuXmv Model Checker
inferred← citeshttps://doi.org/10.1109/hicss.1990.205212openalex-snapshot
Temporal specification of Ada tasks
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5622348openalex-snapshot
Aspect-oriented modeling concurrent software system with UML statecharts
inferred← citeshttps://doi.org/10.1109/iccd.1991.139914openalex-snapshot
Specifying system behavior in CPA
inferred← citeshttps://doi.org/10.1109/icdsn.2000.857597openalex-snapshot
Survivability analysis of network specifications
inferred← citeshttps://doi.org/10.1109/icmsao.2011.5775479openalex-snapshot
Formal methods and automation for system verification
inferred← citeshttps://doi.org/10.1109/iiai-aai50415.2020.00107openalex-snapshot
Model Checking of Visual Scripts Created by UE4 Blueprints
inferred← citeshttps://doi.org/10.1109/istcs.1993.253466openalex-snapshot
Divergence models for atomized statements and parallel choice
inferred← citeshttps://doi.org/10.1109/jproc.2018.2834926openalex-snapshot
Layering Assume-Guarantee Contracts for Hierarchical System Design
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferred← citeshttps://doi.org/10.1109/test.1996.557152openalex-snapshot
Generation of test cases for hardware design verification of a super-scalar Fetch Processor
inferred← citeshttps://doi.org/10.1142/s0218194022500759openalex-snapshot
Matching Logic for Concurrent Programs Based on Rely/Guarantee and Abstract Patterns
inferred← citeshttps://doi.org/10.1145/1067627.806585openalex-snapshot
Proving real-time properties of programs with temporal logic
inferred← citeshttps://doi.org/10.1145/1182613.1182617openalex-snapshot
On compositionality and its limitations
inferred← citeshttps://doi.org/10.1145/135419.135461openalex-snapshot
From sequential layers to distributed processes
inferred← citeshttps://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferred← citeshttps://doi.org/10.1145/2103776.2103782openalex-snapshot
A hoare calculus for the verification of synchronous languages
inferred← citeshttps://doi.org/10.1145/242223.242252openalex-snapshot
Strategic directions in concurrency research
inferred← citeshttps://doi.org/10.1145/2993.357247openalex-snapshot
The ``Hoare Logic'' of CSP, and All That
inferred← citeshttps://doi.org/10.1145/3335772.3335938openalex-snapshot
The mutual exclusion problem: part II---Statement and solutions
inferred← citeshttps://doi.org/10.1145/356901.356903openalex-snapshot
Concepts and Notations for Concurrent Programming
inferred← citeshttps://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferred← citeshttps://doi.org/10.1145/372202.372305openalex-snapshot
Coordinating interaction patterns
inferred← citeshttps://doi.org/10.1145/42190.42348openalex-snapshot
Control predicates are better than dummy variables for reasoning about program control
inferred← citeshttps://doi.org/10.1145/42192.42195openalex-snapshot
Specification and verification of liveness properties of cyclic, concurrent processes
inferred← citeshttps://doi.org/10.1145/511446.511470openalex-snapshot
Model checking cobweb protocols for verification of HTML frames behavior
inferred← citeshttps://doi.org/10.1145/567067.567072openalex-snapshot
Reasoning about nonatomic operations
inferred← citeshttps://doi.org/10.1145/581339.581395openalex-snapshot
Assuring and evolving concurrent programs
inferred← citeshttps://doi.org/10.1145/582153.582187openalex-snapshot
Modular verification of concurrent programs
inferred← citeshttps://doi.org/10.1145/63264.63402openalex-snapshot
ECCS and LIPS: two languages for OSI systems specification and verification
inferred← citeshttps://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferred← citeshttps://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferred← citeshttps://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferred← citeshttps://doi.org/10.1145/88616.96551openalex-snapshot
Using symbolic execution for verification of Ada tasking programs
inferred← citeshttps://doi.org/10.1587/transinf.2021edp7063openalex-snapshot
Formal Verification for Node-Based Visual Scripts Using Symbolic Model Checking
inferred← citeshttps://doi.org/10.20868/upm.thesis.46778openalex-snapshot
Síntesis de protocolos de comunicación a partir de especificaciones de servicio
inferred← citeshttps://doi.org/10.21236/ada156190openalex-snapshot
Specifying and Verifying Concurrent Programs.
inferred← citeshttps://doi.org/10.21236/ada256234openalex-snapshot
An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language
inferred← citeshttps://doi.org/10.21236/ada358751openalex-snapshot
A Study of Practice Issues in Model-Based Verification Using the Symbolic Model Verifier (SMV)
inferred← citeshttps://doi.org/10.21236/ada422193openalex-snapshot
Information Assurance Science and Engineering Project
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:26)2012openalex-snapshot
Static Analysis of Run-Time Errors in Embedded Real-Time Parallel C Programs
inferred← citeshttps://doi.org/10.22028/d291-26012openalex-snapshot
On the formal foundation of a verification approach for system-level concurrent programs
inferred← citeshttps://doi.org/10.3233/978-1-58603-873-1-213openalex-snapshot
A Constraint-based Approach to Medical Guidelines and Protocols
inferred← citeshttps://doi.org/10.3233/978-1-58603-873-1-63openalex-snapshot
Formal Methods for Verification of Clinical Practice Guidelines
inferred← citeshttps://doi.org/10.5445/ir/1000045641openalex-snapshot
Deductive Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.70675/7c693e77z7b55z4e31zac54z427635398953openalex-snapshot
Static Analysis for BSPlib Programs
inferred← citeshttps://doi.org/10.71548/18425openalex-snapshot
A Unifying Theory of Multi-Exit Programs
inferred← citeshttps://doi.org/10.82444/warw.33484729openalex-snapshot
Model checking quantum protocols
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.