On the public citation graph
A system which automatically improves programs
0 signed · 184 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/978-94-015-8624-5_2openalex-snapshot
Representation and Meaning
inferredcites →https://doi.org/10.1016/s0022-0000(73)80040-6openalex-snapshot
Program schemes, recursion schemes, and formal languages
inferredcites →https://doi.org/10.1093/comjnl/15.1.13openalex-snapshot
A Note on Compiling Arithmetic Expressions
inferredcites →https://doi.org/10.1093/comjnl/9.1.45openalex-snapshot
The Equivalence of Certain Computations
inferredcites →https://doi.org/10.1145/1045200.1045213openalex-snapshot
Review of "Representation and Meaning: Experiments with Information Processing Systems by Herbert A. Simon and Laurent Siklossy, eds." Prentice-Hall, inc., New Jersey, 1972
inferredcites →https://doi.org/10.1145/1283920.1283924openalex-snapshot
Form and content in computer science
inferredcites →https://doi.org/10.1145/321574.321575openalex-snapshot
Form and Content in Computer Science (1970 ACM turing lecture)
inferredcites →https://doi.org/10.1145/321864.321875openalex-snapshot
Proving Theorems about LISP Functions
inferredcites →https://doi.org/10.1145/368280.368289openalex-snapshot
The arithmetic translator-compiler of the IBM FORTRAN automatic coding system
inferredcites →https://doi.org/10.1145/390016.808470openalex-snapshot
Some transformations for developing recursive programs
inferredcites →https://doi.org/10.1145/800161.805164openalex-snapshot
Translating recursion equations into flow charts
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10720327_17openalex-snapshot
Context-Moving Transformations for Function Verification
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_43openalex-snapshot
On the definition of classes of interpretations
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_75openalex-snapshot
Transforming recursion equations to algorithms
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_89openalex-snapshot
Improving memory utilization in transforming recursive programs
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_33openalex-snapshot
The vienna development method (VDM)
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_32openalex-snapshot
An axiomatic approach to the Korenjak - Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_2openalex-snapshot
Some universal algebraic and model theoretic results in computer science
inferred← citeshttps://doi.org/10.1007/3-540-15975-4_38openalex-snapshot
Optimizing almost-tail-recursive prolog programs
inferred← citeshttps://doi.org/10.1007/3-540-15975-4_47openalex-snapshot
Transforming recursive programs for execution on parallel machines
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_4openalex-snapshot
Lifetime analysis for procedure parameters
inferred← citeshttps://doi.org/10.1007/3-540-31288-9_20openalex-snapshot
Imperative Specification Programming
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_7openalex-snapshot
Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing
inferred← citeshttps://doi.org/10.1007/3-540-53162-9_45openalex-snapshot
A matching process modulo a theory of categorical products
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_219openalex-snapshot
Calculating software generators from solution specifications
inferred← citeshttps://doi.org/10.1007/3-540-59451-5_9openalex-snapshot
Graph algorithms with a functional flavour
inferred← citeshttps://doi.org/10.1007/978-1-4471-3564-7_12openalex-snapshot
Efficient Optimization of Iterative Queries
inferred← citeshttps://doi.org/10.1007/978-3-322-93997-5_9openalex-snapshot
Automatisches Programmieren
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_5openalex-snapshot
The Correctness of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_11openalex-snapshot
A systematics of software engineering: Structure, terminology and classification of techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_18openalex-snapshot
Algebraic Methods for Program Construction: The Project CIP
inferred← citeshttps://doi.org/10.1007/978-3-642-67091-6_6openalex-snapshot
Entwicklungslinien in der Informatik
inferred← citeshttps://doi.org/10.1007/978-3-642-68064-9_7openalex-snapshot
Methoden und Werkzeuge zur Software-Entwicklung: Einordnung und Überblick
inferred← citeshttps://doi.org/10.1007/978-3-642-68828-7_4openalex-snapshot
Computer-Unterstützter Algorithmenentwurf
inferred← citeshttps://doi.org/10.1007/978-3-642-71145-9_11openalex-snapshot
Extraktion und Verifikation von Programmen durch Analyse formaler Beweise
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_31openalex-snapshot
Understanding Lisp Programs is Improving Lisp Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-12405-5_12openalex-snapshot
MACHINE TRANSFORMATION OF ADVICE INTO A HEURISTIC SEARCH PROCEDURE
inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_1openalex-snapshot
Program Construction by Transformations: A Family Tree of Sorting Programs
inferred← citeshttps://doi.org/10.1007/978-94-010-1545-5_21openalex-snapshot
Automatic Synthesis of Snobol Programs
inferred← citeshttps://doi.org/10.1007/bf00264438openalex-snapshot
Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique
inferred← citeshttps://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferred← citeshttps://doi.org/10.1007/bf00571421openalex-snapshot
Calculating the maximum execution time of real-time programs
inferred← citeshttps://doi.org/10.1007/bf01070102openalex-snapshot
Stack and locally finite transformations on structures with reversible transitions
inferred← citeshttps://doi.org/10.1007/bf01744293openalex-snapshot
Infinite trees in normal form and recursive equations having a unique solution
inferred← citeshttps://doi.org/10.1007/bf01744577openalex-snapshot
An axiomatic approach to the Korenjak-Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/bf01806061openalex-snapshot
Compiling lisp programs for parallel execution
inferred← citeshttps://doi.org/10.1007/bf01808954openalex-snapshot
The interprocedural analysis and automatic parallelization of Scheme programs
inferred← citeshttps://doi.org/10.1007/bf01887204openalex-snapshot
Program development in the constructive set theory TK
inferred← citeshttps://doi.org/10.1007/bf01932275openalex-snapshot
A case study in program transformation
inferred← citeshttps://doi.org/10.1007/bf02945368openalex-snapshot
Program transformation by solving equations
inferred← citeshttps://doi.org/10.1007/bf02983374openalex-snapshot
Efficient memo-table management strategies
inferred← citeshttps://doi.org/10.1007/bf03037060openalex-snapshot
Functional programming with streams —Part II—
inferred← citeshttps://doi.org/10.1007/bfb0014672openalex-snapshot
Systematics of transformation rules
inferred← citeshttps://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferred← citeshttps://doi.org/10.1007/bfb0015454openalex-snapshot
A method for the development of correct software
inferred← citeshttps://doi.org/10.1007/bfb0035986openalex-snapshot
A program transformation system for software reuse
inferred← citeshttps://doi.org/10.1007/s001650050050openalex-snapshot
A Minimal Graphical User Interface for the Jape Proof Calculator
inferred← citeshttps://doi.org/10.1007/s001650200006openalex-snapshot
A Collection of Papers and Memoirs Celebrating the Contribution of Rod Burstall to Advances in Computer Science
inferred← citeshttps://doi.org/10.1016/0004-3702(75)90008-9openalex-snapshot
Knowledge and reasoning in program synthesis
inferred← citeshttps://doi.org/10.1016/0004-3702(76)90011-4openalex-snapshot
A partial evaluator, and its use as a programming tool
inferred← citeshttps://doi.org/10.1016/0004-3702(79)90013-4openalex-snapshot
An experiment in knowledge-based automatic programming
inferred← citeshttps://doi.org/10.1016/0004-3702(80)90023-5openalex-snapshot
LAURA, a system to debug student programs
inferred← citeshttps://doi.org/10.1016/0010-4655(85)90133-xopenalex-snapshot
An application of program transformation to supercomputer programming
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90010-7openalex-snapshot
Output driven interpretation of recursive programs, or writing creates and destroys data structures
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90015-6openalex-snapshot
A family of rules for recursion removal
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90016-8openalex-snapshot
On some classes of interpretations
inferred← citeshttps://doi.org/10.1016/0096-0551(89)90027-1openalex-snapshot
Creating efficient programs by exchanging data for procedures
inferred← citeshttps://doi.org/10.1016/0096-0551(91)90006-uopenalex-snapshot
Intermediate container removal
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90010-7openalex-snapshot
Implementing specification freedoms
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90052-4openalex-snapshot
Linearisation: An optimisation for nonlinear functional programs
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90126-ropenalex-snapshot
Parallel-architecture-directed program transformation
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90004-4openalex-snapshot
A complete logic for reasoning about programs via nonstandard model theory I
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90125-9openalex-snapshot
Extraction and verification of programs by analysis of formal proofs
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90086-4openalex-snapshot
Two ways of slicing programs
inferred← citeshttps://doi.org/10.1016/b978-0-08-051054-5.50021-2openalex-snapshot
COMPREHENSIVE BIBLIOGRAPHY OF MACHINE LEARNING
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50014-7openalex-snapshot
Recursive Applicative Program Schemes
inferred← citeshttps://doi.org/10.1016/b978-0-934613-03-3.50022-2openalex-snapshot
Achieving Several Goals Simultaneously**The research reported herein was sponsored by the National Science Foundation under Grant GJ-36146.
inferred← citeshttps://doi.org/10.1016/b978-0-934613-03-3.50025-8openalex-snapshot
An Experiment in Knowledge-based Automatic Programming
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50014-8openalex-snapshot
An Experiment in Knowledge-based Automatic Programming
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50026-4openalex-snapshot
IMPLEMENTING SPECIFICATION FREEDOMS**This research was supported by Defense Advanced Research Projects Agency contract DAHC15 72 C0308. Views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official opinion or policy of DARPA,…
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50040-9openalex-snapshot
Program Abstraction and Instantiation An earlier version of this paper was presented at the Fifth Conference on Software Engineering, San Diego, Calif., March 1981.
inferred← citeshttps://doi.org/10.1016/c2013-0-07694-3openalex-snapshot
Readings in Artificial Intelligence
inferred← citeshttps://doi.org/10.1017/s0956796800001155openalex-snapshot
Total unfolding: theory and applications
inferred← citeshttps://doi.org/10.1017/s0960129505004883openalex-snapshot
Matching with multiplication and exponentiation (extended abstract)
inferred← citeshttps://doi.org/10.1023/b:ause.0000008667.37988.11openalex-snapshot
Syntax-Directed Amorphous Slicing
inferred← citeshttps://doi.org/10.1049/sej.1994.0027openalex-snapshot
A software engineering paradigm for program synthesis
inferred← citeshttps://doi.org/10.1051/ita/1977110200911openalex-snapshot
Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann
inferred← citeshttps://doi.org/10.1051/ita/1984180200911openalex-snapshot
Définitions récursives par cas
inferred← citeshttps://doi.org/10.1051/ita/1986200201491openalex-snapshot
La fonction d'Ackermann : un nouveau mode de dérécursivation
inferred← citeshttps://doi.org/10.1093/combul/21.4.22openalex-snapshot
Program transformation: An introduction and survey
inferred← citeshttps://doi.org/10.1109/empdp.1993.336410openalex-snapshot
Synthesis of the fast Fourier transform algorithm by functional language program transformation
inferred← citeshttps://doi.org/10.1109/iccl.1988.13052openalex-snapshot
The elimination of intermediate containers in the evaluation of first-class array expressions
inferred← citeshttps://doi.org/10.1109/icece.2010.348openalex-snapshot
One Fast Discrete Correlation Algorithm in the Frequency Domain
inferred← citeshttps://doi.org/10.1109/icse-fose59343.2023.00008openalex-snapshot
Large Language Models for Software Engineering: Survey and Open Problems
inferred← citeshttps://doi.org/10.1109/icsm.1991.160319openalex-snapshot
An integrated program representation and toolkit for the maintenance of C programs
inferred← citeshttps://doi.org/10.1109/icstw.2008.30openalex-snapshot
Open Problems in Testability Transformation
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.1109/saci49304.2020.9118814openalex-snapshot
Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema
inferred← citeshttps://doi.org/10.1109/sami48414.2020.9108725openalex-snapshot
Deductive Synthesis of Bubble–Sort Using Multisets
inferred← citeshttps://doi.org/10.1109/scam.2002.1134105openalex-snapshot
VADA: a transformation-based system for variable dependence analysis
inferred← citeshttps://doi.org/10.1109/scam.2010.28openalex-snapshot
Why Source Code Analysis and Manipulation Will Always be Important
inferred← citeshttps://doi.org/10.1109/scam.2018.00009openalex-snapshot
From Start-ups to Scale-ups: Opportunities and Open Problems for Static and Dynamic Program Analysis
inferred← citeshttps://doi.org/10.1109/tevc.2017.2693219openalex-snapshot
Genetic Improvement of Software: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferred← citeshttps://doi.org/10.1109/tse.1982.234953openalex-snapshot
Code Optimization Considerations in List Processing Systems
inferred← citeshttps://doi.org/10.1109/tse.1982.235737openalex-snapshot
Program Specification Applied to a Text Formatter
inferred← citeshttps://doi.org/10.1109/tse.1985.232527openalex-snapshot
Symbolic Semantics and Program Reduction
inferred← citeshttps://doi.org/10.1109/wcre.2001.957831openalex-snapshot
GUSTT: an amorphous slicing system which combines slicing and transformation
inferred← citeshttps://doi.org/10.1145/1006258.1006262openalex-snapshot
Mappings for rapid prototyping
inferred← citeshttps://doi.org/10.1145/109625.109628openalex-snapshot
Parallel-program transformation using a metalanguage
inferred← citeshttps://doi.org/10.1145/109626.109628openalex-snapshot
Parallel-program transformation using a metalanguage
inferred← citeshttps://doi.org/10.1145/115865.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferred← citeshttps://doi.org/10.1145/115865.115894openalex-snapshot
Is there a use for linear logic?
inferred← citeshttps://doi.org/10.1145/115866.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferred← citeshttps://doi.org/10.1145/115866.115894openalex-snapshot
Is there a use for linear logic?
inferred← citeshttps://doi.org/10.1145/1411798.1411809openalex-snapshot
Iterative interpretation of tail-recursive LISP procedures
inferred← citeshttps://doi.org/10.1145/16856.16875openalex-snapshot
Rule-based transformation of relational queries into iterative programs
inferred← citeshttps://doi.org/10.1145/2166.2167openalex-snapshot
Eliminating Redundant Recursive Calls.
inferred← citeshttps://doi.org/10.1145/232627.232645openalex-snapshot
First-class synchronization barriers
inferred← citeshttps://doi.org/10.1145/232629.232645openalex-snapshot
First-class synchronization barriers
inferred← citeshttps://doi.org/10.1145/2351676.2351678openalex-snapshot
The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (keynote paper)
inferred← citeshttps://doi.org/10.1145/2372251.2372253openalex-snapshot
Dynamic adaptive search based software engineering
inferred← citeshttps://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferred← citeshttps://doi.org/10.1145/357153.357154openalex-snapshot
A System for Assisting Program Transformation
inferred← citeshttps://doi.org/10.1145/357162.357171openalex-snapshot
Some Techniques for Recursion Removal from Recursive Functions
inferred← citeshttps://doi.org/10.1145/357233.357235openalex-snapshot
Grammar-Based Definition of Metaprogramming Systems
inferred← citeshttps://doi.org/10.1145/357233.357236openalex-snapshot
Recursion As an Effective Step in Program Development
inferred← citeshttps://doi.org/10.1145/357311.357312openalex-snapshot
Using program transformations to derive line-drawing algorithms
inferred← citeshttps://doi.org/10.1145/359046.359057openalex-snapshot
Syntactic source to source transforms and program manipulation
inferred← citeshttps://doi.org/10.1145/359863.359889openalex-snapshot
Improving programs by the introduction of recursion
inferred← citeshttps://doi.org/10.1145/3635800.3637446openalex-snapshot
A Historical Perspective on Program Transformation and Recent Developments (Invited Contribution)
inferred← citeshttps://doi.org/10.1145/3841644.3842686openalex-snapshot
Introducing Hoare Logic in the Undergraduate CS Curriculum
inferred← citeshttps://doi.org/10.1145/38713.38735openalex-snapshot
A rule-based view of query optimization
inferred← citeshttps://doi.org/10.1145/390016.808470openalex-snapshot
Some transformations for developing recursive programs
inferred← citeshttps://doi.org/10.1145/3916.3986openalex-snapshot
Program abstraction and instantiation
inferred← citeshttps://doi.org/10.1145/42190.42347openalex-snapshot
ACE: an automatic complexity evaluator
inferred← citeshttps://doi.org/10.1145/512976.512983openalex-snapshot
Correctness-preserving program transformations
inferred← citeshttps://doi.org/10.1145/55364.55416openalex-snapshot
Parcel: project for the automatic restructuring and concurrent evaluation of LISP
inferred← citeshttps://doi.org/10.1145/567752.567766openalex-snapshot
Characterization and elimination of redundancy in recursive programs
inferred← citeshttps://doi.org/10.1145/62032.62033openalex-snapshot
On the translation of relational queries into iterative programs
inferred← citeshttps://doi.org/10.1145/62115.62126openalex-snapshot
Restructuring Lisp programs for concurrent execution
inferred← citeshttps://doi.org/10.1145/68127.68133openalex-snapshot
Transformational programming: the derivation of a Prolog interpretation algorithm
inferred← citeshttps://doi.org/10.1145/69624.357209openalex-snapshot
Automatic Program Improvement: Variable Usage Transformations
inferred← citeshttps://doi.org/10.1145/800017.800533openalex-snapshot
Applicative programming and digital design
inferred← citeshttps://doi.org/10.1145/800055.802023openalex-snapshot
Schema recognition for program transformations
inferred← citeshttps://doi.org/10.1145/800055.802039openalex-snapshot
Recursion is more efficient than iteration
inferred← citeshttps://doi.org/10.1145/800055.802044openalex-snapshot
A powerful strategy for deriving efficient programs by transformation
inferred← citeshttps://doi.org/10.1145/800068.802155openalex-snapshot
Toward an algebra of nondeterministic programs
inferred← citeshttps://doi.org/10.1145/800179.810196openalex-snapshot
Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA
inferred← citeshttps://doi.org/10.1145/800223.806759openalex-snapshot
Applicative style programming, program transformation, and list operators
inferred← citeshttps://doi.org/10.1145/800223.806761openalex-snapshot
Transformations of FP program schemes
inferred← citeshttps://doi.org/10.1145/800228.806933openalex-snapshot
Macaroni is better than spaghetti
inferred← citeshttps://doi.org/10.1145/872734.806933openalex-snapshot
Macaroni is better than spaghetti
inferred← citeshttps://doi.org/10.1145/872736.806933openalex-snapshot
Macaroni is better than spaghetti
inferred← citeshttps://doi.org/10.11606/d.45.1979.tde-20230303-170519openalex-snapshot
Sobre eliminação de recursao em programas
inferred← citeshttps://doi.org/10.15407/dopovidi2015.03.122openalex-snapshot
Динаміка вивільнення синтетичного імуностимулятора метилурацилу з полімерної композиції, призначеної для імплантації в умовах in vitro
inferred← citeshttps://doi.org/10.29007/9wm9openalex-snapshot
Transforming Event B Models into Verified C# Implementations
inferred← citeshttps://doi.org/10.3233/aic-1989-2203openalex-snapshot
A Framework for Modeling Programming Knowledge
inferred← citeshttps://doi.org/10.48456/tr-865openalex-snapshot
I/O Optimisation and elimination via partial evaluation
inferred← citeshttps://doi.org/10.5555/800078.802519openalex-snapshot
The evolution of programs: Program abstraction and instantiation
inferred← citeshttps://doi.org/10.5555/800078.802559openalex-snapshot
An interactive tool for program manipulation
inferred← citeshttps://doi.org/10.5555/800091.802922openalex-snapshot
A system for program refinement
inferred← citeshttps://doi.org/10.5555/800253.807679openalex-snapshot
Programming as an evolutionary process
inferred← citeshttps://doi.org/10.6100/ir630369openalex-snapshot
Dealing with dynamism in embedded system design:application scenarios
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.