On the public citation graph

A modular coding of UNITY in COQ

https://doi.org/10.1007/bfb0105409
0 signed · 29 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-57826-9_121openalex-snapshot
Program verification using HOL-UNITY
inferredcites →https://doi.org/10.1007/3-540-59173-7openalex-snapshot
Extensions of the UNITY Methodology
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf01898402openalex-snapshot
Eliminating the substitution axiom from UNITY logic
inferredcites →https://doi.org/10.1007/bfb0024647openalex-snapshot
A proof environment for concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(94)00043-iopenalex-snapshot
On the logic of UNITY
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1109/12.9730openalex-snapshot
The formal specification and design of a distributed electronic funds-transfer system
inferredcites →https://doi.org/10.1109/32.58787openalex-snapshot
Mechanically verifying concurrent programs with the Boyer-Moore prover

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470612514.ch16openalex-snapshot
Coq
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_20openalex-snapshot
A Structural Embedding of Ocsid in PVS
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_11openalex-snapshot
Rewriting UNITY
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_31openalex-snapshot
Verification of reactive systems using DisCo and PVS
inferred← citeshttps://doi.org/10.1007/978-1-4471-0701-9_13openalex-snapshot
An Abstract and Constructive Specification in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_5openalex-snapshot
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_13openalex-snapshot
Owicki/Gries in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-21461-5_7openalex-snapshot
A Framework for Verifying Data-Centric Protocols
inferred← citeshttps://doi.org/10.1007/bfb0028386openalex-snapshot
Formal verification of concurrent programs in Lp and in Coq: A comparative analysis
inferred← citeshttps://doi.org/10.1007/s00165-004-0053-6openalex-snapshot
Mechanizing compositional reasoning for concurrent systems: some lessons
inferred← citeshttps://doi.org/10.1007/s10817-015-9358-9openalex-snapshot
Mechanizing a Process Algebra for Network Protocols
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.073openalex-snapshot
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.010openalex-snapshot
A Coq Library for Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.065openalex-snapshot
State Spaces — The Locale Way
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00207-5openalex-snapshot
Progress properties for empty Unity programs
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925133openalex-snapshot
Proving properties of multidimensional recurrences with application to regular parallel algorithms
inferred← citeshttps://doi.org/10.1145/343369.343370openalex-snapshot
Mechanizing UNITY in Isabelle
inferred← citeshttps://doi.org/10.1145/504709.504711openalex-snapshot
Mechanizing a theory of program composition for UNITY
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.117openalex-snapshot
Verification of Concurrent Programs Using the Coq Proof Assistant: A Case Study
inferred← citeshttps://doi.org/10.48456/tr-514openalex-snapshot
Nomadic π-calculi: expressing and verifying communication infrastructure for mobile computation
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.