On the public citation graph
The logic of aliasing
0 signed · 43 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/3-540-08342-1_3openalex-snapshot
Semantics and proof theory of pascal procedures
inferredcites →https://doi.org/10.1007/bf00260921openalex-snapshot
Proof rules for the programming language Euclid
inferredcites →https://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1007/bfb0025364openalex-snapshot
Complementary Definitions of Programming Language Semantics
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/tse.1978.231479openalex-snapshot
The Multiple Assignment Statement
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/512950.512952openalex-snapshot
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems
inferredcites →https://doi.org/10.2307/2273958openalex-snapshot
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular 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-12896-4_382openalex-snapshot
From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/3-540-36578-8_17openalex-snapshot
A Temporal Approach to Specification and Verification of Pointer Data-Structures
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_8openalex-snapshot
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_109openalex-snapshot
Modular completeness: Integrating the reuse of specified software in top-down program development
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_33openalex-snapshot
Static detection of pointer errors: An axiomatisation and a checking algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_14openalex-snapshot
Symbolic Analysis via Semantic Reinterpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_15openalex-snapshot
Heaps and Data Structures: A Challenge for Automated Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-46552-9_21openalex-snapshot
The Simplifier of the Program Verifier “Tatzelwurm”
inferred← citeshttps://doi.org/10.1007/978-3-662-02328-0_24openalex-snapshot
Program Veriflcation at Stanford: Past, Present, Future
inferred← citeshttps://doi.org/10.1007/bf01888232openalex-snapshot
Proof obligations for blocks and procedures
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s10817-009-9120-2openalex-snapshot
Formal Verification of C Systems Code
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/0304-3975(83)90009-9openalex-snapshot
On the notion of expressiveness and the rule of adaptation
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.1017/s0956796807006417openalex-snapshot
A logical analysis of aliasing in imperative higher-order functions
inferred← citeshttps://doi.org/10.1145/1086365.1086401openalex-snapshot
A logical analysis of aliasing in imperative higher-order functions
inferred← citeshttps://doi.org/10.1145/1090189.1086401openalex-snapshot
A logical analysis of aliasing in imperative higher-order functions
inferred← citeshttps://doi.org/10.1145/1250734.1250750openalex-snapshot
Automatic inference of optimizer flow functions from semantic meanings
inferred← citeshttps://doi.org/10.1145/215465.215594openalex-snapshot
Semantic models and abstract interpretation techniques for inductive data structures and pointers
inferred← citeshttps://doi.org/10.1145/3477143openalex-snapshot
Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic
inferred← citeshttps://doi.org/10.1145/357094.357100openalex-snapshot
Ada exception handling: an axiomatic approach
inferred← citeshttps://doi.org/10.1145/4472.4474openalex-snapshot
Side effects and aliasing can have simple axiomatic descriptions
inferred← citeshttps://doi.org/10.1145/99583.99616openalex-snapshot
Parameter-passing and the lambda calculus
inferred← citeshttps://doi.org/10.26190/unsworks/17927openalex-snapshot
Formal memory models for verifying C systems code
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06215openalex-snapshot
Reasoning about call-by-value: a missing result in the history of Hoare's logic
inferred← citeshttps://doi.org/10.82444/warw.33642034openalex-snapshot
Verification and abstraction of flow-graph programs with pointers and computed jumps
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.