On the public citation graph

A unified approach for developing efficient algorithmic programs

0 signed · 72 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-4476-9_28openalex-snapshot

A Simple Program Whose Proof Isn’t

inferredcites →https://doi.org/10.1007/978-1-4612-5983-1openalex-snapshot

The Science of Programming

inferredcites →https://doi.org/10.1007/978-3-319-21840-3openalex-snapshot

Algorithms and Data Structures

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

Two new strategies for developing loop invariants and their applications

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/32.58788openalex-snapshot

KIDS: a semiautomatic program development system

inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot

Data Structures and Algorithms

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

Using induction to design algorithms

inferredcites →https://doi.org/10.21236/ada310438openalex-snapshot

Increasing the Practical Impact of Formal Methods for Computer-Aided Software Development,

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-13651-2_7openalex-snapshot

Formal Specification and Verification for Real-Time Scheduling Based on PAR

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-17404-4_10openalex-snapshot

Formal Semantics of Orc Based on TLA$$^+$$

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_1openalex-snapshot

Orchestration Combinators in Apla+ Language

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-540-69311-6_14openalex-snapshot

A Linear In-situ Algorithm for the Power of Cyclic Permutation

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-02270-8_6openalex-snapshot

Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems

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-1877-2_2openalex-snapshot

Algorithm Design Through the Optimization of Reuse-Based Generation

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/bf02946498openalex-snapshot

Formal derivation of graph algorithmic programs using partition-and-recur

inferred← citeshttps://doi.org/10.1007/s00607-010-0085-0openalex-snapshot

A problem reduction based approach to discrete optimization algorithm design

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.1016/j.entcs.2014.12.008openalex-snapshot

An Algebraic Approach to Population-Based Evolutionary Algorithm Generation

inferred← citeshttps://doi.org/10.1016/j.phpro.2012.03.170openalex-snapshot

A Multi-Agent approach To the Design of An Programming ICAI System

inferred← citeshttps://doi.org/10.1051/wujns/2023286483openalex-snapshot

Program Construction Method for Sequential Statistics Class Algorithm Based on Bidirectional Scanning Induction

inferred← citeshttps://doi.org/10.1109/carpi.2012.6356542openalex-snapshot

Research on generic constraints mechanisms of Apia language

inferred← citeshttps://doi.org/10.1109/cise.2009.5363209openalex-snapshot

Formal Derivation of the String Scheme Number Combinatorics Problem with PAR Method

inferred← citeshttps://doi.org/10.1109/cit.2014.169openalex-snapshot

Contract-Based Generic Programming Mechanism for Dynamic Service Orchestration

inferred← citeshttps://doi.org/10.1109/cso.2010.202openalex-snapshot

Problem Reduction Graph Model for Discrete Optimization Problems

inferred← citeshttps://doi.org/10.1109/etcs.2010.20openalex-snapshot

Formal Derivation of the Second Kind Stirling Numbers with PAR Method

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/icccs55155.2022.9846685openalex-snapshot

Apla+: a Practical Service-oriented Programming Language for Service Orchestration

inferred← citeshttps://doi.org/10.1109/iccis53528.2021.9646013openalex-snapshot

Derivation and Formal Proof of Floyd-Warshall 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/iciii.2009.36openalex-snapshot

Formal Derivation of the Longest Common Subsequence Problem with PAR Method

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/icise.2009.601openalex-snapshot

Formal Derivation of the Interlaced Arrange Scheme Number Combinatorics Problem with PAR Method

inferred← citeshttps://doi.org/10.1109/icmecg.2014.73openalex-snapshot

Formal Derivation of Traveling Salesman Problem

inferred← citeshttps://doi.org/10.1109/iscid.2009.8openalex-snapshot

Formal Derivation of the Maximal Contiguous Subsequence Sum Problem with PAR Method

inferred← citeshttps://doi.org/10.1109/iscsct.2008.91openalex-snapshot

The Research and Application of Apla-Java Reusable Components

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.2009.46openalex-snapshot

Formal Derivation of a Generic Algorithmic Program for Solving a Class of Extremum Problems

inferred← citeshttps://doi.org/10.1109/tase.2011.34openalex-snapshot

A Generative Approach to Searching Algorithmic Programs Development

inferred← citeshttps://doi.org/10.1109/tools.2000.885894openalex-snapshot

Expanding design pattern to support parallel programming

inferred← citeshttps://doi.org/10.1109/wnis.2009.8openalex-snapshot

Formal Derivation of the Knapsack Problem with PAR Method

inferred← citeshttps://doi.org/10.1142/s0218001421590503openalex-snapshot

A Multiplayer Virtual Intelligent System Based on Distributed Virtual Reality

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.628175openalex-snapshot

Efficient Multiple Sequences Alignment Algorithm Generation via Components Assembly Under PAR Framework

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.568-570.1451openalex-snapshot

Formal Approach to Enhance the Reliability of Embedded Software System

inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.610.312openalex-snapshot

Deductive Synthesis of Algorithms in Human-Computer Interaction

inferred← citeshttps://doi.org/10.4236/jsea.2009.23026openalex-snapshot

Formal Derivation of the Combinatorics Problems with PAR Method

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.