On the public citation graph
Strongest invariant functions: Their use in the systematic analysis of while statements
0 signed · 34 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-09987-5openalex-snapshot
A Relational Theory of Computing
inferredcites →https://doi.org/10.1007/bf00264277openalex-snapshot
A relational approach to the design of deterministic programs
inferredcites →https://doi.org/10.1016/0020-0190(83)90056-xopenalex-snapshot
Verifying programs by induction on their data structure: General format and applications
inferredcites →https://doi.org/10.1109/tse.1975.6312858openalex-snapshot
Strong verification of programs
inferredcites →https://doi.org/10.1145/356876.356881openalex-snapshot
A Comparative Analysis of Functional Correctness
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/358161.358168openalex-snapshot
A generalized control structure and its formal definition
inferredcites →https://doi.org/10.1145/360569.360659openalex-snapshot
The new math of computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/390016.808436openalex-snapshot
Finding Invariant assertions for proving programs
inferredcites →https://doi.org/10.1145/800027.808436openalex-snapshot
Finding Invariant assertions for proving programs
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
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-48958-4_15openalex-snapshot
Invariant Discovery via Failed Proof Attempts
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_17openalex-snapshot
Relational Methods in the Analysis of While Loops: Observations of Versatility
inferred← citeshttps://doi.org/10.1007/s11334-012-0189-0openalex-snapshot
Invariant relations, invariant functions, and loop functions
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90335-yopenalex-snapshot
Regularity of relations: A measure of uniformity
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.010openalex-snapshot
Harnessing a Refinement Theory to Compute Loop Functions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.02.001openalex-snapshot
Convergence: Integrating termination and abort-freedom
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.04.001openalex-snapshot
A versatile concept for the analysis of loops
inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.013openalex-snapshot
A relation-algebraic approach to the “Hoare logic” of functional dependencies
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.007openalex-snapshot
Reflexive transitive invariant relations: A basis for computing loop functions
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.008openalex-snapshot
Mechanical inference of invariants for FOR-loops
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.04.001openalex-snapshot
Invariant functions and invariant relations: An alternative to invariant assertions
inferred← citeshttps://doi.org/10.1016/j.scico.2009.09.009openalex-snapshot
Mathematics for reasoning about loop functions
inferred← citeshttps://doi.org/10.1016/j.scico.2012.05.006openalex-snapshot
Invariant assertions, invariant relations, and invariant functions
inferred← citeshttps://doi.org/10.1023/a:1018969728171openalex-snapshot
Proof planning for strategy development
inferred← citeshttps://doi.org/10.1109/hicss.2007.32openalex-snapshot
A Semantic Recognizer Infrastructure for Computing Loop Behavior
inferred← citeshttps://doi.org/10.1109/sew.2007.87openalex-snapshot
A Refinement Based Framework for Computing Loop Behavior
inferred← citeshttps://doi.org/10.1109/tse.2016.2521379openalex-snapshot
Software Reliability Analysis Using Weakest Preconditions in Linear Assignment Programs
inferred← citeshttps://doi.org/10.1145/1810295.1810369openalex-snapshot
Using invariant functions and invariant relations to compute loop functions
inferred← citeshttps://doi.org/10.29007/zhz4openalex-snapshot
A Comparative Study of Invariant Assertions, Invariant Relations, and Invariant Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1210.4661openalex-snapshot
Functions as types or the "Hoare logic" of functional dependencies
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.