On the public citation graph

Program invariants as fixedpoints

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.

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-06859-7_136openalex-snapshot

Inductive assertion patterns for recursive procedures

inferredcites →https://doi.org/10.1007/bf00264034openalex-snapshot

Consistent and complementary formal theories of the semantics of programming languages

inferredcites →https://doi.org/10.1007/bfb0059689openalex-snapshot

Symposium on Semantics of Algorithmic Languages

inferredcites →https://doi.org/10.1007/bfb0059703openalex-snapshot

The lattice of flow diagrams

inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot

Assigning meanings to programs

inferredcites →https://doi.org/10.1109/sfcs.1975.15openalex-snapshot

Flow of control in the proof theory of structured programming

inferredcites →https://doi.org/10.1109/sfcs.1977.1openalex-snapshot

A necessary and sufficient condition for the existence of hoare logics

inferredcites →https://doi.org/10.1109/tc.1978.1675193openalex-snapshot

IEEE Transactions On Software Engineering

inferredcites →https://doi.org/10.1109/tse.1976.233829openalex-snapshot

Induction as the Basis for Program Verification

inferredcites →https://doi.org/10.1137/0205030openalex-snapshot

Proof Theory of Partial Correctness Verification Systems

inferredcites →https://doi.org/10.1145/321592.321606openalex-snapshot

Formalization of Properties of Functional Programs

inferredcites →https://doi.org/10.1145/512950.512951openalex-snapshot

A complete and consistent hoare axiomatics for a simple programming language

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.1145/512950.512963openalex-snapshot

Implementation of an array bound checker

inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot

Abstract interpretation

inferredcites →https://doi.org/10.1145/800113.803634openalex-snapshot

A consistent and complete deductive system for the verification of parallel programs

inferredcites →https://doi.org/10.1145/800113.803635openalex-snapshot

A new incompleteness result for Hoare's system

inferredcites →https://doi.org/10.26153/tsw/52912openalex-snapshot

A simple axiomatic basis for programming language constructs

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-10003-2_87openalex-snapshot

Semantics :Algebras,fixed points,axioms

inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_2openalex-snapshot

SMT-Based Model Checking for Recursive Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot

The Birth of Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_2openalex-snapshot

The Beginning of Model Checking: A Personal Perspective

inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_17openalex-snapshot

Computing Differential Invariants of Hybrid Systems as Fixedpoints

inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_15openalex-snapshot

Meanings of Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-642-14509-4_6openalex-snapshot

Computing Differential Invariants as Fixed Points

inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot

Semantics of algorithmic languages

inferred← citeshttps://doi.org/10.1007/s10703-009-0079-8openalex-snapshot

Computing differential invariants of hybrid systems as fixedpoints

inferred← citeshttps://doi.org/10.1007/s10703-016-0249-4openalex-snapshot

SMT-based model checking for recursive programs

inferred← citeshttps://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot

Using branching time temporal logic to synthesize synchronization skeletons

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90091-4openalex-snapshot

Stratified least fixpoint logic

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/cbo9780511792588.002openalex-snapshot

Origins of bisimulation and coinduction

inferred← citeshttps://doi.org/10.1098/rsta.1984.0068openalex-snapshot

The characterization problem for Hoare logics

inferred← citeshttps://doi.org/10.1145/1516507.1516510openalex-snapshot

On the origins of bisimulation and coinduction

inferred← citeshttps://doi.org/10.1145/2817824openalex-snapshot

Differential Game Logic

inferred← citeshttps://doi.org/10.1145/3544585.3544593openalex-snapshot

Dijkstra’s Legacy on Program Verification

inferred← citeshttps://doi.org/10.1145/72981.73000openalex-snapshot

Predicates are predicate transformers: a unified compositional theory for concurrency

inferred← citeshttps://doi.org/10.1184/r1/6587273openalex-snapshot

A Complete Axiomatization of Differential Game Logic for Hybrid Games (CMU-CS-13-100R)

inferred← citeshttps://doi.org/10.18255/1818-1015-2019-4-550-571openalex-snapshot

Property-Directed Inference of Relational Invariants

inferred← citeshttps://doi.org/10.2298/ns20101213kupusinacopenalex-snapshot

Analyses of characteristics of dynamic postconditions in Hoare triplets

inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894274openalex-snapshot

Property Directed Inference of Relational Invariants

inferred← citeshttps://doi.org/10.4271/2004-01-0716openalex-snapshot

Next Generation Testing Tools for Embedded Automotive Applications

inferred← citeshttps://doi.org/10.48550/arxiv.1405.4028openalex-snapshot

SMT-based Model Checking for Recursive Programs

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.