On the public citation graph
Pointers and Records in the Unifying Theories of Programming
0 signed · 30 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/11561163_9openalex-snapshot
rCOS: Refinement of Component and Object Systems
inferredcites →https://doi.org/10.1007/11889229openalex-snapshot
Refinement techniques in software engineering : First Pernambuco Summer School on Software Engineering, PSSE 2004, Recife, Brazil, November 23-December 5, 2004 : revised lectures
inferredcites →https://doi.org/10.1007/11889229_6openalex-snapshot
A Tutorial Introduction to CSP in Unifying Theories of Programming
inferredcites →https://doi.org/10.1007/3-540-16816-8_26openalex-snapshot
A fully abstract semantics and a proof system for an algol-like language with sharing
inferredcites →https://doi.org/10.1007/3-540-44880-2openalex-snapshot
ZB 2003: Formal Specification and Development in Z and B
inferredcites →https://doi.org/10.1007/3-540-44880-2_22openalex-snapshot
Towards Practical Proofs of Class Correctness
inferredcites →https://doi.org/10.1007/978-0-387-21798-7_11openalex-snapshot
A trace model for pointers and objects
inferredcites →https://doi.org/10.1007/978-1-4615-5265-9openalex-snapshot
The Object-Z Specification Language
inferredcites →https://doi.org/10.1007/978-3-540-45236-2_19openalex-snapshot
A Semantic Foundation for TCOZ in Unifying Theories of Programming
inferredcites →https://doi.org/10.1007/b100112openalex-snapshot
A checker for modal formulas for processes with data
inferredcites →https://doi.org/10.1007/s00165-003-0021-6openalex-snapshot
Superposition: composition vs refinement of non-deterministic, action-based systems
inferredcites →https://doi.org/10.1007/s00165-003-0024-3openalex-snapshot
ERC – An object-oriented refinement calculus for Eiffel
inferredcites →https://doi.org/10.1007/s10270-005-0085-2openalex-snapshot
Unifying classes and processes
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/s0167-6423(00)00005-8openalex-snapshot
Predicate transformer semantics of a higher-order imperative language with record subtyping
inferredcites →https://doi.org/10.1109/apsec.2003.1254398openalex-snapshot
Reasoning about pointers in refinement calculus
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
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-031-40436-8_13openalex-snapshot
Applying Formal Verification to an Open-Source Real-Time Operating System
inferred← citeshttps://doi.org/10.1007/978-3-319-47166-2_26openalex-snapshot
Heterogeneous Semantics and Unifying Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_31openalex-snapshot
Unifying Theories of Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_10openalex-snapshot
A Theory of Pointers for the UTP
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_10openalex-snapshot
Unifying Theories of Locations
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_3openalex-snapshot
UTP and Temporal Logic Model Checking
inferred← citeshttps://doi.org/10.1007/s00165-012-0253-4openalex-snapshot
The Safety-Critical Java memory model formalised
inferred← citeshttps://doi.org/10.1007/s00165-013-0279-2openalex-snapshot
Test-data generation for control coverage by proof
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.055openalex-snapshot
Mechanical Reasoning about Families of UTP Theories
inferred← citeshttps://doi.org/10.1109/tase.2008.38openalex-snapshot
A Relational Model for Confined Separation Logic
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.