On the public citation graph

Eliminating the substitution axiom from UNITY logic

https://doi.org/10.1007/bf01898402
0 signed · 84 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/978-1-4612-3228-5openalex-snapshot
Predicate Calculus and Program Semantics
inferredcites →https://doi.org/10.1007/978-1-4612-4886-6openalex-snapshot
Fairness
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf01667079openalex-snapshot
Time-dependent distributed systems: proving safety, liveness and real-time properties
inferredcites →https://doi.org/10.1016/0020-0190(90)90218-mopenalex-snapshot
A predicate transformer for progress
inferredcites →https://doi.org/10.1137/0207005openalex-snapshot
Soundness and Completeness of an Axiom System for Program Verification
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/72981.72999openalex-snapshot
A predicate transformer approach to semantics of parallel programs
inferredcites →https://doi.org/10.1145/75199.75202openalex-snapshot
Rooting UNITY
inferredcites →https://doi.org/10.1145/75200.75202openalex-snapshot
Rooting UNITY
inferredcites →https://doi.org/10.1145/78969.78970openalex-snapshot
win and sin : predicate transformers for concurrency
inferredcites →https://doi.org/10.82444/warw.33641377openalex-snapshot
A semantic model for UNITY

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722010_12openalex-snapshot
Theorems about Composition
inferred← citeshttps://doi.org/10.1007/11516798_4openalex-snapshot
A UNITY-Based Framework Towards Component Based Systems
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/11888116_6openalex-snapshot
Web Cube
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_140openalex-snapshot
Refinement based validation of an algorithm for detecting distributed termination
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_32openalex-snapshot
Towards a Compositional Approach to the Design and Verification of Distributed Systems
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-55599-4_78openalex-snapshot
A decompositional approach to the design of efficient parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_44openalex-snapshot
Towards the formal design of self-stabilizing distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_48openalex-snapshot
On the relation between unity properties and sequences of states
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_51openalex-snapshot
Compositional liveness properties of EN-systems
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_24openalex-snapshot
Two fully abstract models for UNITY
inferred← citeshttps://doi.org/10.1007/3-540-57826-9_121openalex-snapshot
Program verification using HOL-UNITY
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_54openalex-snapshot
Towards a mechanically supported and compositional calculus to design distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_139openalex-snapshot
Soundness and completeness of UNITY logic
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_238openalex-snapshot
The HOL-UNITY verification system
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-60043-4_67openalex-snapshot
On mechanizing proofs within a complete proof system for Unity
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_24openalex-snapshot
ImpUNITY: UNITY with procedures and local variables
inferred← citeshttps://doi.org/10.1007/3-540-61769-8_7openalex-snapshot
Abstracting communication to reason about distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63383-9_89openalex-snapshot
Approximating unity
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_35openalex-snapshot
A UNITY mapping operator for distributed programs
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_20openalex-snapshot
Specifying and Verifying Conditional Progress
inferred← citeshttps://doi.org/10.1007/978-1-4471-0851-1_21openalex-snapshot
Requirements for a Temporal B Assigning Temporal Meaning to Abstract Machines… and to Abstract Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_10openalex-snapshot
Constructive Refinement of First Order Specifications
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-031-42202-7_1openalex-snapshot
Research Background
inferred← citeshttps://doi.org/10.1007/978-3-031-42202-7_2openalex-snapshot
Analysis of Approaches to the Development of a DSL for Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-42202-7_3openalex-snapshot
Analysis of Existing Approaches to the Formalization of the DSL Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-42202-7_4openalex-snapshot
Developing a Projection Approach to DSL Development
inferred← citeshttps://doi.org/10.1007/978-3-031-42202-7_5openalex-snapshot
Practical Use of the Proposed Projection Approach for Developing and Modifying a DSL in Changing Contexts
inferred← citeshttps://doi.org/10.1007/978-3-031-42202-7_6openalex-snapshot
Discussion and Further Development
inferred← citeshttps://doi.org/10.1007/978-3-031-42202-7_7openalex-snapshot
Conclusion and Final Remarks
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_23openalex-snapshot
Composing Invariants
inferred← citeshttps://doi.org/10.1007/bf01178381openalex-snapshot
Invariants, composition, and substitution
inferred← citeshttps://doi.org/10.1007/bf01209623openalex-snapshot
Program refinement in fair transition systems
inferred← citeshttps://doi.org/10.1007/bf01211085openalex-snapshot
A predicate transformer for the progress property ‘to-always’
inferred← citeshttps://doi.org/10.1007/bf01211214openalex-snapshot
DUALITY: A simple formalism for the analysis of UNITY
inferred← citeshttps://doi.org/10.1007/bf01211309openalex-snapshot
Error in the UNITY substitution rule for subscripted operators
inferred← citeshttps://doi.org/10.1007/bf01211315openalex-snapshot
Distributed maximum maintenance on hierarchically divided graphs
inferred← citeshttps://doi.org/10.1007/bfb0024440openalex-snapshot
The RPC-memory specification problem: UNITY + refinement calculus
inferred← citeshttps://doi.org/10.1007/bfb0024647openalex-snapshot
A proof environment for concurrent programs
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/bfb0098004openalex-snapshot
Examples of program composition illustrating the use of universal properties
inferred← citeshttps://doi.org/10.1007/bfb0105409openalex-snapshot
A modular coding of UNITY in COQ
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/s00236-003-0130-yopenalex-snapshot
Specification transformers: a predicate transformer approach to composition
inferred← citeshttps://doi.org/10.1007/s002360050115openalex-snapshot
Data refinement of mixed specifications
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90115-xopenalex-snapshot
Comments on “Always-true is not invariant”: assertional reasoning about invariance
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90077-9openalex-snapshot
A simple proof of a completeness result for leads-to in the UNITY logic
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90141-uopenalex-snapshot
Models for the substitution axiom of UNITY logic
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00017-4openalex-snapshot
Composition of assumption-commitment specifications in a UNITY style
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00033-bopenalex-snapshot
Predicate transformers for reasoning about concurrent computation
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00043-iopenalex-snapshot
On the logic of UNITY
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.scico.2005.08.001openalex-snapshot
Composing invariants
inferred← citeshttps://doi.org/10.1016/j.scico.2012.10.013openalex-snapshot
Complete assertional proof rules for progress under weak and strong fairness
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00327-1openalex-snapshot
A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00233-3openalex-snapshot
Composing leads-to properties
inferred← citeshttps://doi.org/10.1023/a:1012952311559openalex-snapshot
An Experiment in Program Composition and Proof
inferred← citeshttps://doi.org/10.1109/32.368135openalex-snapshot
A decompositional approach to the design of parallel programs
inferred← citeshttps://doi.org/10.1109/32.663997openalex-snapshot
Formal verification of concurrent programs using the Larch prover
inferred← citeshttps://doi.org/10.1142/s0129626499000402openalex-snapshot
THE OBSERVATION: AN ABSTRACT COMMUNICATION MECHANISM
inferred← citeshttps://doi.org/10.1145/112600.112619openalex-snapshot
A predicate transformer approach to knowledge and knowledge-based protocols (extended abstract)
inferred← citeshttps://doi.org/10.1145/200994.200997openalex-snapshot
Deducing fairness properties in UNITY logic—a new completeness result
inferred← citeshttps://doi.org/10.1145/298151.298195openalex-snapshot
Modeling deflection networks
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.21236/ada451478openalex-snapshot
Towards a Compositional Approach to the Design and Verification of Distributed Systems
inferred← citeshttps://doi.org/10.3233/hsn-2005-259openalex-snapshot
Formal design of self-stabilizing programs
inferred← citeshttps://doi.org/10.3929/ethz-a-000900473openalex-snapshot
Conjunctive predicate transformers for reasoning about concurrent 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.