On the public citation graph

Experiments with proof plans for induction

https://doi.org/10.1007/bf00249016
0 signed · 94 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/3-540-16780-3_97openalex-snapshot
Formulation of induction formulas in verification of prolog programs
inferredcites →https://doi.org/10.1007/978-3-642-96868-6_139openalex-snapshot
Meta-Level Inference
inferredcites →https://doi.org/10.1007/bf00244511openalex-snapshot
Meta-level inference: Two applications
inferredcites →https://doi.org/10.1007/bfb0012826openalex-snapshot
The use of explicit plans to guide inductive proofs
inferredcites →https://doi.org/10.1016/0004-3702(74)90026-5openalex-snapshot
Planning in a hierarchy of abstraction spaces
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.48456/tr-143openalex-snapshot
Experience with Isabelle A generic theorem prover

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10720076_1openalex-snapshot
Searching for a Solution to Program Verification=Equation Solving in CCS
inferred← citeshttps://doi.org/10.1007/11829263_5openalex-snapshot
Best-First Rippling
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_23openalex-snapshot
A Semantics for Proof Plans with Applications to Interactive Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_43openalex-snapshot
Proof Planning with Multiple Strategies
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_12openalex-snapshot
Proof Development with Ωmega
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_7openalex-snapshot
A Critique of Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_33openalex-snapshot
The Design of the CADE-16 Inductive Theorem Prover Contest
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_134openalex-snapshot
The use of proof plans in formal methods
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_119openalex-snapshot
A science of reasoning: Extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_84openalex-snapshot
Extensions to the rippling-out tactic for guiding inductive proofs
inferred← citeshttps://doi.org/10.1007/3-540-55602-8openalex-snapshot
Automated Deduction—CADE-11
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_174openalex-snapshot
Using middle-out reasoning to control the synthesis of tail-recursive programs
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_175openalex-snapshot
The use of proof plans to sum series
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_183openalex-snapshot
Automatic program optimization through proof transformation
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_191openalex-snapshot
Tactic-based theorem proving and knowledge-based forward chaining: An experiment with Nuprl and Ontic
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_17openalex-snapshot
Negation and control in automatically generated logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_29openalex-snapshot
Proof plans for the correction of false conjectures
inferred← citeshttps://doi.org/10.1007/3-540-58467-6_32openalex-snapshot
Formal methods for automated program improvement
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_16openalex-snapshot
A model of costs and benefits of meta-level computation
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_96openalex-snapshot
Using a logical and categorical approach for the validation of fault-tolerant systems
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_71openalex-snapshot
Internal analogy in theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_54openalex-snapshot
Using rippling for equational reasoning
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_66openalex-snapshot
When to prove theorems by analogy?
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_48openalex-snapshot
Analytica — An experiment in combining theorem proving and symbolic computation
inferred← citeshttps://doi.org/10.1007/3-540-63233-6_508openalex-snapshot
Solution-relevant abstractions constrain retrieval and adaptation
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_2openalex-snapshot
A Science of Reasoning (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3540634932_8openalex-snapshot
External analogy in inductive theorem proving
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_3openalex-snapshot
Synthesis and Transformation of Logic Programs from Constructive, Inductive Proof
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_37openalex-snapshot
A Rippling-Based Difference Reduction Technique to Automatically Prove Security Protocol Goals
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-17172-7_6openalex-snapshot
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
inferred← citeshttps://doi.org/10.1007/978-94-009-1675-3_5openalex-snapshot
A Calculus for and Termination of Rippling
inferred← citeshttps://doi.org/10.1007/978-94-010-0550-0_7openalex-snapshot
Model-Guided Proof Planning
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_7openalex-snapshot
The Use of Proof Plans for Normalization
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_16openalex-snapshot
Concepts in Proof Planning
inferred← citeshttps://doi.org/10.1007/bf00244462openalex-snapshot
A calculus for and termination of rippling
inferred← citeshttps://doi.org/10.1007/bf01383983openalex-snapshot
Lazy techniques for fully expansive theorem proving
inferred← citeshttps://doi.org/10.1007/bfb0013060openalex-snapshot
The use of planning critics in mechanizing inductive proofs
inferred← citeshttps://doi.org/10.1007/bfb0031802openalex-snapshot
Experiments in automating hardware verification using inductive proof planning
inferred← citeshttps://doi.org/10.1007/bfb0054255openalex-snapshot
System description: An interface between CLAM and HOL
inferred← citeshttps://doi.org/10.1007/bfb0055131openalex-snapshot
An interface between CLAM and HOL
inferred← citeshttps://doi.org/10.1007/s00165-004-0054-5openalex-snapshot
Discovering applications of higher order functions through proof planning
inferred← citeshttps://doi.org/10.1007/s001970050035openalex-snapshot
Beweisen durch Analogie
inferred← citeshttps://doi.org/10.1007/s10459-015-9592-2openalex-snapshot
Learning how the electron transport chain works: independent and interactive effects of instructional strategies and learners’ characteristics
inferred← citeshttps://doi.org/10.1007/s10817-006-9034-1openalex-snapshot
An Integrated Approach to High Integrity Software Verification
inferred← citeshttps://doi.org/10.1007/s10817-009-9125-xopenalex-snapshot
On Process Equivalence = Equation Solving in CCS
inferred← citeshttps://doi.org/10.1007/s10817-010-9193-yopenalex-snapshot
Conjecture Synthesis for Inductive Theories
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90079-qopenalex-snapshot
Rippling: A heuristic for guiding inductive proofs
inferred← citeshttps://doi.org/10.1016/0167-6423(96)00003-2openalex-snapshot
Steps towards mechanizing program transformations using PVS
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90029-9openalex-snapshot
Logic program synthesis
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50008-5openalex-snapshot
A Lazy Approach to Fully-Expansive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50015-2openalex-snapshot
Boyer-Moore Automation for the HOL System
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50015-1openalex-snapshot
The Automation of Proof by Mathematical Induction
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00076-4openalex-snapshot
Knowledge-based proof planning
inferred← citeshttps://doi.org/10.1017/s0890060400000986openalex-snapshot
Proof planning: A methodology for developing AI systems incorporating design issues
inferred← citeshttps://doi.org/10.1017/s0956796899003391openalex-snapshot
Transparent optimisation of rewriting combinators
inferred← citeshttps://doi.org/10.1023/a:1005843328643openalex-snapshot
The Heine–Borel Challenge Problem. In Honor of Woody Bledsoe
inferred← citeshttps://doi.org/10.1023/a:1005936130801openalex-snapshot
Analogy in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1023/a:1005969312327openalex-snapshot
Recursive Program Optimization through Inductive Synthesis Proof Transformation
inferred← citeshttps://doi.org/10.1023/a:1006023127567openalex-snapshot
A Skeptic's Approach to Combining HOL and Maple
inferred← citeshttps://doi.org/10.1023/a:1006079212546openalex-snapshot
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation
inferred← citeshttps://doi.org/10.1023/a:1008763422061openalex-snapshot
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm
inferred← citeshttps://doi.org/10.1023/a:1018943603394openalex-snapshot
Automating the synthesis of decision procedures in a constructive metatheory
inferred← citeshttps://doi.org/10.1080/08839519108927927openalex-snapshot
EXTENDING THE PROOF PLAN METHODOLOGY TO COMPUTER CONFIGURATION PROBLEMS
inferred← citeshttps://doi.org/10.1098/rsta.1994.0114openalex-snapshot
A subsumption architecture for theorem proving?
inferred← citeshttps://doi.org/10.1098/rsta.2018.0040openalex-snapshot
Discussing Hilbert's 24th problem
inferred← citeshttps://doi.org/10.1109/32.469458openalex-snapshot
Verifying a logic-synthesis algorithm and implementation: a case study in software verification
inferred← citeshttps://doi.org/10.1109/kbse.1995.490132openalex-snapshot
Automating changes of data type in functional programs
inferred← citeshttps://doi.org/10.1145/1185448.1185579openalex-snapshot
Computer science students' difficulties with proofs by induction
inferred← citeshttps://doi.org/10.1145/1345169.1345175openalex-snapshot
Cooperative reasoning for automatic software verification
inferred← citeshttps://doi.org/10.1145/1352135.1352142openalex-snapshot
A conceptual approach to teaching induction for computer science
inferred← citeshttps://doi.org/10.1145/1352322.1352142openalex-snapshot
A conceptual approach to teaching induction for computer science
inferred← citeshttps://doi.org/10.1145/1593105.1593221openalex-snapshot
Induction as a tool for conceptual coherence in computer science
inferred← citeshttps://doi.org/10.1145/289121.289122openalex-snapshot
Logical framework based program development
inferred← citeshttps://doi.org/10.1609/aimag.v20i1.1442openalex-snapshot
Automated Deduction: Looking Ahead
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.25148/etd.fi08121912openalex-snapshot
An Innovative Approach to Teaching Structural Induction for Computer Science
inferred← citeshttps://doi.org/10.29007/5wptopenalex-snapshot
Refinement and Term Synthesis in Loop Invariant Generation
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0073openalex-snapshot
A Generic Tableau Prover and its Integration with Isabelle
inferred← citeshttps://doi.org/10.3929/ethz-a-006860117openalex-snapshot
VSTTE 2010 workshop proceedings
inferred← citeshttps://doi.org/10.5220/0002159603500354openalex-snapshot
PROOF GRANULARITY AS AN EMPIRICAL PROBLEM?
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.