On the public citation graph

Unifying theories for parallel programming

https://doi.org/10.1007/bfb0002714
0 signed · 95 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-50939-9_121openalex-snapshot
The varieties of programming language
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_3openalex-snapshot
The Varieties of Programming Language
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00289062openalex-snapshot
The ?Hoare logic? of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
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.25405/ncl.34125705openalex-snapshot
Specification and Design of (Parallel) Programs

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-36103-0_19openalex-snapshot
Hardware/Software Partitioning in Verilog
inferred← citeshttps://doi.org/10.1007/3-540-36103-0_54openalex-snapshot
Using Transition Systems to Unify UML Models
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_19openalex-snapshot
The Verifying Compiler: A Grand Challenge for Computing Research
inferred← citeshttps://doi.org/10.1007/3-540-44525-0_17openalex-snapshot
Guards, Preconditions, and Refinement in Z
inferred← citeshttps://doi.org/10.1007/3-540-44525-0_27openalex-snapshot
Segregation with Communication
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_33openalex-snapshot
Logic of Global Synchrony
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_23openalex-snapshot
Faithful Translations Among Models and Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_7openalex-snapshot
Reasoning about Timeouts
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_26openalex-snapshot
Refinement in Circus
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_10openalex-snapshot
The Semantics of Circus
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_14openalex-snapshot
A Theory of Generalised Substitutions
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_9openalex-snapshot
A Fixpoint Theory for Non-monotonic Parallelism
inferred← citeshttps://doi.org/10.1007/3-540-46428-x_12openalex-snapshot
What Is ‘Mathematicalness’ in Software Engineering?
inferred← citeshttps://doi.org/10.1007/3-540-47884-1_9openalex-snapshot
A Framework for Translating Models and Specifications
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_26openalex-snapshot
A weakest precondition semantics for an object-oriented language of refinement
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_11openalex-snapshot
A Security Calculus for Wireless Networks of Named Data Networking
inferred← citeshttps://doi.org/10.1007/978-3-030-91265-9_4openalex-snapshot
Reasoning About Iteration and Recursion Uniformly Based on Big-Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_1openalex-snapshot
RoboWorld: Where Can My Robot Work?
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_24openalex-snapshot
Formally Verified Animation for RoboChart Using Interaction Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_2openalex-snapshot
“Testing Can Be Formal Too”: 30 Years Later
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_12openalex-snapshot
Time: It is only Logical!
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_1openalex-snapshot
Denotational and Algebraic Semantics for the SMrCaIT Calculus Based on UTP
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_11openalex-snapshot
A Tour Through the Programming Choices: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_4openalex-snapshot
PCSP# Denotational Semantics with an Application in Sports Analytics
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_9openalex-snapshot
Towards an Algebra for Unifying Theories of Concurrent Programming (UTCP)
inferred← citeshttps://doi.org/10.1007/978-3-031-88546-4_8openalex-snapshot
Review on Verification for Marine Autonomous Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-30693-7_21openalex-snapshot
From Monolithic to Compositional: A Compositional Operational Semantics for Crystality
inferred← citeshttps://doi.org/10.1007/978-3-319-02812-5_1openalex-snapshot
Foundations for Model-Based Engineering of Systems of Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_9openalex-snapshot
Extended Conscriptions Algebraically
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_23openalex-snapshot
Invariants, Well-Founded Statements and Real-Time Program Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_3openalex-snapshot
Engineering UToPiA
inferred← citeshttps://doi.org/10.1007/978-3-319-09099-3_1openalex-snapshot
Model-Based Mutation Testing of an Industrial Measurement Device
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_18openalex-snapshot
A Resource-Based Logic for Termination and Non-termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-14806-9_1openalex-snapshot
Three Approaches to Timed External Choice in UTP
inferred← citeshttps://doi.org/10.1007/978-3-319-14806-9_2openalex-snapshot
Isabelle/UTP: A Mechanised Theory Engineering Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_5openalex-snapshot
Linking Discrete and Continuous Models, Applied to Traffic Manoeuvrers
inferred← citeshttps://doi.org/10.1007/978-3-319-92711-4_12openalex-snapshot
Conclusions
inferred← citeshttps://doi.org/10.1007/978-3-540-74107-7_10openalex-snapshot
Z Logic and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_12openalex-snapshot
Lazy Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_3openalex-snapshot
Compositionality: Ontology and Mereology of Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_11openalex-snapshot
Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_6openalex-snapshot
Lazy UTP
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_10openalex-snapshot
Unifying Recursion in Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_41openalex-snapshot
Automating Algebraic Methods in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_11openalex-snapshot
Unifying Correctness Statements
inferred← citeshttps://doi.org/10.1007/978-3-642-32775-9_6openalex-snapshot
A Formal Model-Based Approach to Engineering Systems-of-Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_2openalex-snapshot
Unifying Lazy and Strict Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_1openalex-snapshot
Unifying Theories of Undefinedness in UTP
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_2openalex-snapshot
Unifying Theories of Programming with Monads
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_6openalex-snapshot
The Logic of U ·(TP)2
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_7openalex-snapshot
Conscriptions: A New Relational Model for Sequential Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-37057-1_26openalex-snapshot
Testing with Inputs and Outputs in CSP
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_10openalex-snapshot
The Circus Testing Theory Revisited in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_15openalex-snapshot
A UTP Semantics for Communicating Processes with Shared Variables
inferred← citeshttps://doi.org/10.1007/978-3-662-45231-8_5openalex-snapshot
Contracts in CML
inferred← citeshttps://doi.org/10.1007/978-981-10-2546-4_14openalex-snapshot
rCOS: A Refinement Calculus of Internetware Systems
inferred← citeshttps://doi.org/10.1007/978-981-97-2285-3_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf02947306openalex-snapshot
An algebraic hardware/software partitioning algorithm
inferred← citeshttps://doi.org/10.1007/s00165-009-0119-6openalex-snapshot
A process algebraic framework for specification and validation of real-time systems
inferred← citeshttps://doi.org/10.1007/s00165-011-0212-5openalex-snapshot
Reasoning about orchestrations of web services using partial correctness
inferred← citeshttps://doi.org/10.1007/s00165-014-0309-8openalex-snapshot
Denotational semantics and its algebraic derivation for an event-driven system-level language
inferred← citeshttps://doi.org/10.1007/s00165-015-0342-2openalex-snapshot
Model checking CML: tool development and industrial applications
inferred← citeshttps://doi.org/10.1007/s00165-018-0453-7openalex-snapshot
A UTP semantics for communicating processes with shared variables and its formal encoding in PVS
inferred← citeshttps://doi.org/10.1007/s00165-018-0467-1openalex-snapshot
A UTP approach for rTiMo
inferred← citeshttps://doi.org/10.1007/s00165-021-00530-xopenalex-snapshot
A process calculus BigrTiMo of mobile systemsand its formal semantics
inferred← citeshttps://doi.org/10.1007/s00165-021-00546-3openalex-snapshot
Denotational semantics of channel mobility in UTP-CSP
inferred← citeshttps://doi.org/10.1007/s00236-005-0163-5openalex-snapshot
The weakest specifunction
inferred← citeshttps://doi.org/10.1007/s00236-012-0162-2openalex-snapshot
Algebras for iteration and infinite computations
inferred← citeshttps://doi.org/10.1007/s10270-005-0085-2openalex-snapshot
Unifying classes and processes
inferred← citeshttps://doi.org/10.1007/s10270-021-00916-8openalex-snapshot
Probabilistic modelling and verification using RoboChart and PRISM
inferred← citeshttps://doi.org/10.1007/s11390-006-0682-8openalex-snapshot
Development of Software Engineering: A Research Perspective
inferred← citeshttps://doi.org/10.1007/s11390-021-1616-1openalex-snapshot
Trace Semantics and Algebraic Laws for Total Store Order Memory Model
inferred← citeshttps://doi.org/10.1016/s0950-5849(98)00119-0openalex-snapshot
When are methods complementary?
inferred← citeshttps://doi.org/10.1017/s1471068402001448openalex-snapshot
A refinement calculus for logic programs
inferred← citeshttps://doi.org/10.1023/b:form.0000004787.52329.98openalex-snapshot
A Constructive Approach to Hardware/Software Partitioning
inferred← citeshttps://doi.org/10.1080/10637199808947391openalex-snapshot
AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
inferred← citeshttps://doi.org/10.1145/3372020.3391559openalex-snapshot
Formal Model-Based Assurance Cases in Isabelle/SACM
inferred← citeshttps://doi.org/10.1145/3477355.3477358openalex-snapshot
Finding Effective Abstractions
inferred← citeshttps://doi.org/10.1145/3477355.3477369openalex-snapshot
Hoare and He’s Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1145/3477355.3477375openalex-snapshot
List of Tony Hoare’s Publications
inferred← citeshttps://doi.org/10.1145/3702981openalex-snapshot
Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3803555openalex-snapshot
Experiences from the European ProCoS Projects: Provably Correct Systems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.658.662openalex-snapshot
Application Research of rCOS-Based Trusted Requirement Engineering
inferred← citeshttps://doi.org/10.70675/77ea8727z9983z49f1zb2dfzc928ed49379aopenalex-snapshot
Traceability of concerns and observer-based verification for railway safety-critical software
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.