On the public citation graph

Two new strategies for developing loop invariants and their applications

https://doi.org/10.1007/bf02939477
0 signed · 47 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-5983-1openalex-snapshot
The Science of Programming
inferredcites →https://doi.org/10.1007/978-3-642-27266-0openalex-snapshot
Algorithmics
inferredcites →https://doi.org/10.1007/bf00268074openalex-snapshot
A simple fixpoint argument without the restriction to continuity
inferredcites →https://doi.org/10.1007/bf01941134openalex-snapshot
Generating a random cyclic permutation
inferredcites →https://doi.org/10.1016/0020-0190(84)90016-4openalex-snapshot
A technique for developing loop invariants
inferredcites →https://doi.org/10.1016/0167-6423(83)90015-1openalex-snapshot
A note on a standard strategy for developing loop invariants and loops
inferredcites →https://doi.org/10.1016/0167-6423(88)90003-2openalex-snapshot
Developing a linear algorithm for cubing a cyclic permutation
inferredcites →https://doi.org/10.1109/tse.1979.234198openalex-snapshot
Synthesis: Dreams → Programs
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/76380.76381openalex-snapshot
A debate on teaching computing science

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-02450-5_5openalex-snapshot
PAR: A Practicable Formal Method and Its Supporting Platform
inferred← citeshttps://doi.org/10.1007/978-3-030-41418-4_12openalex-snapshot
Formal Development and Verification of Reusable Component in PAR Platform
inferred← citeshttps://doi.org/10.1007/978-3-031-29476-1_1openalex-snapshot
Formal Derivation and Verification of Critical Path Algorithm for Directed Acyclic Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-31220-0_1openalex-snapshot
Genericity in PAR Platform
inferred← citeshttps://doi.org/10.1007/978-3-319-31220-0_12openalex-snapshot
Research on Formal Development of Non-recursive Algorithms of Graph Search
inferred← citeshttps://doi.org/10.1007/978-3-319-57708-1_6openalex-snapshot
Formal Development of Linear Structure Reusable Components in PAR Platform
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_31openalex-snapshot
Toward an Automatic Approach to Greedy Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-20539-2_26openalex-snapshot
A Knowledge-Driven Approach to Web-Based Learning for Formal Algorithm Development
inferred← citeshttps://doi.org/10.1007/978-981-16-7443-3_14openalex-snapshot
Research on the Model Transformation Method and Application of Formal Model Driven Engineering (FMDE)
inferred← citeshttps://doi.org/10.1007/bf02943151openalex-snapshot
A unified approach for developing efficient algorithmic programs
inferred← citeshttps://doi.org/10.1007/bf02946498openalex-snapshot
Formal derivation of graph algorithmic programs using partition-and-recur
inferred← citeshttps://doi.org/10.1007/s10586-016-0663-9openalex-snapshot
Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms
inferred← citeshttps://doi.org/10.1109/ical.2007.4338533openalex-snapshot
Formal Programming for the Shortest Path and Its Critical Edge Problems
inferred← citeshttps://doi.org/10.1109/iccis53528.2021.9646013openalex-snapshot
Derivation and Formal Proof of Floyd-Warshall Algorithm
inferred← citeshttps://doi.org/10.1109/iccis53528.2021.9646069openalex-snapshot
Derivation and Formal Proof of Binary Tree Depth Non-Recursive Algorithm
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228151openalex-snapshot
Introducing formal derivation into the design and analysis of algorithms
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228204openalex-snapshot
A category theoretic approach to search algorithms: Towards a unified implementation for branch-and-bound and backtracking
inferred← citeshttps://doi.org/10.1109/icfem.1997.630419openalex-snapshot
A simple program whose derivation and proof is also
inferred← citeshttps://doi.org/10.1109/icis.2008.32openalex-snapshot
A Mechanical Approach for Deriving Algorithmic Programs
inferred← citeshttps://doi.org/10.1109/icis.2008.34openalex-snapshot
Generating Algorithms plus Loop Invariants by Formal Derivation
inferred← citeshttps://doi.org/10.1109/icis.2011.52openalex-snapshot
Formal Derivation of Two Algorithms Involving Sequences
inferred← citeshttps://doi.org/10.1109/ieec.2010.5533196openalex-snapshot
Formal Derivation and Implementation for the Stone-Merger Algorithm
inferred← citeshttps://doi.org/10.1109/iwcfta.2010.93openalex-snapshot
Formal Development of Non-recursive Algorithm for Koch Curve
inferred← citeshttps://doi.org/10.1109/iwcfta.2012.67openalex-snapshot
Formal Development of Non-recursive Algorithm for L-system Based Koch Curve
inferred← citeshttps://doi.org/10.1109/qsic.2010.60openalex-snapshot
Generating Provably Correct Algorithmic Programs from Formal Specifications
inferred← citeshttps://doi.org/10.1109/snpd.2016.7515871openalex-snapshot
Automatic verification of non-recursive algorithm of Hanoi Tower by using Isabelle Theorem Prover
inferred← citeshttps://doi.org/10.1109/tase.2011.34openalex-snapshot
A Generative Approach to Searching Algorithmic Programs Development
inferred← citeshttps://doi.org/10.1145/3437075.3437096openalex-snapshot
Methodology and Platform of IS Code Generation
inferred← citeshttps://doi.org/10.1155/2021/6636710openalex-snapshot
New Construction of Family of MLCS Algorithms
inferred← citeshttps://doi.org/10.1155/2021/6676194openalex-snapshot
Gene Sequence Assembly Algorithm Model Based on the DBG Strategy and Its Application
inferred← citeshttps://doi.org/10.17559/tv-20221025164232openalex-snapshot
Correctness by Construction for Pairwise Sequence Alignment Algorithm in Bio-Sequence
inferred← citeshttps://doi.org/10.3389/fgene.2020.00105openalex-snapshot
Component-Based Design and Assembly of Heuristic Multiple Sequence Alignment Algorithms
inferred← citeshttps://doi.org/10.3389/fgene.2020.630923openalex-snapshot
Research on Components Assembly Platform of Biological Sequences Alignment Algorithm
inferred← citeshttps://doi.org/10.3389/fpls.2021.830042openalex-snapshot
Efficient Generation of RNA Secondary Structure Prediction Algorithm Under PAR Framework
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2013.04260openalex-snapshot
Research on Relative Correctness of Radl Formal Specification
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2009.00982openalex-snapshot
PAR-Based Formal Development of Algorithms
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.610.312openalex-snapshot
Deductive Synthesis of Algorithms in Human-Computer Interaction
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.