On the public citation graph

Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development

https://doi.org/10.1007/b98187
0 signed · 90 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/10720327_6openalex-snapshot
Mode Analysis Domains for Typed Logic Programs
inferredcites →https://doi.org/10.1007/3-540-15976-2_6openalex-snapshot
An experiment in partial evaluation: The generation of a compiler generator
inferredcites →https://doi.org/10.1007/3-540-45142-0_6openalex-snapshot
A Model for Inter-module Analysis and Optimizing Compilation
inferredcites →https://doi.org/10.1007/3-540-45575-2_40openalex-snapshot
Pos(T ): Analyzing Dependencies in Typed Logic Programs
inferredcites →https://doi.org/10.1007/3-540-45653-8_19openalex-snapshot
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
inferredcites →https://doi.org/10.1007/3-540-45653-8_49openalex-snapshot
Binding-Time Annotations without Binding-Time Analysis
inferredcites →https://doi.org/10.1007/3-540-48294-6_8openalex-snapshot
Binding-Time Analysis for Both Static and Dynamic Expressions
inferredcites →https://doi.org/10.1007/3-540-50940-2_43openalex-snapshot
Binding time analysis for polymorphically typed higher order languages
inferredcites →https://doi.org/10.1007/3-540-52592-0_56openalex-snapshot
Automatic autoprojection of higher order recursive equations
inferredcites →https://doi.org/10.1007/3-540-57880-3_19openalex-snapshot
Polymorphic binding-time analysis
inferredcites →https://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferredcites →https://doi.org/10.1007/3-540-61580-6_4openalex-snapshot
A uniform approach for compile-time and run-time specialization
inferredcites →https://doi.org/10.1007/3540543961_22openalex-snapshot
Efficient type inference for higher-order binding-time analysis
inferredcites →https://doi.org/10.1007/978-1-4471-3166-3_16openalex-snapshot
Dependent Sums Express Separation of Binding Times
inferredcites →https://doi.org/10.1007/978-1-4471-3560-9_15openalex-snapshot
Logimix: A Self-Applicable Partial Evaluator for Prolog
inferredcites →https://doi.org/10.1007/978-3-540-24599-5_18openalex-snapshot
Termination Analysis with Types Is More Accurate
inferredcites →https://doi.org/10.1007/bf03037258openalex-snapshot
Binding-time analysis for both static and dynamic expressions
inferredcites →https://doi.org/10.1007/bf03037396openalex-snapshot
Declarative error diagnosis
inferredcites →https://doi.org/10.1007/bfb0053561openalex-snapshot
A polyvariant binding-time analysis for off-line partial deduction
inferredcites →https://doi.org/10.1016/0004-3702(84)90017-1openalex-snapshot
A polymorphic type system for prolog
inferredcites →https://doi.org/10.1016/0743-1066(92)90032-xopenalex-snapshot
Deriving descriptions of possible values of program variables by means of abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(92)90034-zopenalex-snapshot
Static analysis of logic programs for independent and parallelism
inferredcites →https://doi.org/10.1016/s0304-3975(00)00048-7openalex-snapshot
Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity
inferredcites →https://doi.org/10.1016/s0743-1066(96)00068-4openalex-snapshot
The execution algorithm of mercury, an efficient purely declarative logic programming language
inferredcites →https://doi.org/10.1016/s1571-0661(05)80637-1openalex-snapshot
Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs
inferredcites →https://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferredcites →https://doi.org/10.1017/s0956796800000769openalex-snapshot
Efficient analyses for realistic off-line partial evaluation
inferredcites →https://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferredcites →https://doi.org/10.1145/154630.154636openalex-snapshot
Binding-time analysis and the taming of C pointers
inferredcites →https://doi.org/10.1145/178243.178479openalex-snapshot
Type analysis of Prolog using type graphs
inferredcites →https://doi.org/10.1145/200994.201001openalex-snapshot
Closure analysis in constraint form
inferredcites →https://doi.org/10.1145/258916.258934openalex-snapshot
Module-sensitive program specialisation
inferredcites →https://doi.org/10.21236/ada270597openalex-snapshot
Set Based Analysis of ML Programs
inferredcites →https://doi.org/10.7551/mitpress/4301.003.0029openalex-snapshot
Code generation for Mercury
inferredcites →https://doi.org/10.7551/mitpress/4304.003.0042openalex-snapshot
Binding-Time Analysis for Mercury

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11506676_11openalex-snapshot
Schema-Guided Synthesis of Imperative Programs by Constraint Solving
inferred← citeshttps://doi.org/10.1007/11506676_13openalex-snapshot
Constructive Specifications for Compositional Units
inferred← citeshttps://doi.org/10.1007/11506676_15openalex-snapshot
On Termination of Binary CLP Programs
inferred← citeshttps://doi.org/10.1007/11506676_4openalex-snapshot
Fully Automatic Binding-Time Analysis for Prolog
inferred← citeshttps://doi.org/10.1007/11562931_15openalex-snapshot
Abduction of Linear Arithmetic Constraints
inferred← citeshttps://doi.org/10.1007/11609773_1openalex-snapshot
Closure Operators for ROBDDs
inferred← citeshttps://doi.org/10.1007/11680093_11openalex-snapshot
Experiments in Context-Sensitive Analysis of Modular Programs
inferred← citeshttps://doi.org/10.1007/11680093_8openalex-snapshot
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
inferred← citeshttps://doi.org/10.1007/11804192_1openalex-snapshot
A Software Component Model and Its Preliminary Formalisation
inferred← citeshttps://doi.org/10.1007/11916277_27openalex-snapshot
Context-Sensitive Multivariant Assertion Checking in Modular Programs
inferred← citeshttps://doi.org/10.1007/11941439_5openalex-snapshot
Heyting Domains for Constraint Abduction
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_11openalex-snapshot
Specialising Interpreters Using Offline Partial Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-30472-2_6openalex-snapshot
Teaching How to Derive Correct Concurrent Programs from State-Based Specifications and Code Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_6openalex-snapshot
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
inferred← citeshttps://doi.org/10.1007/978-3-540-69611-7_21openalex-snapshot
Partial Evaluation of Pointcuts
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_5openalex-snapshot
Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_29openalex-snapshot
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-00515-2_12openalex-snapshot
On Negative Unfolding in the Answer Set Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-00515-2_9openalex-snapshot
Fast Offline Partial Evaluation of Large Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-03226-4_10openalex-snapshot
An Overview of AI Research in Italy
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_8openalex-snapshot
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-12592-8_3openalex-snapshot
A Transformational Approach for Proving Properties of the CHR Constraint Store
inferred← citeshttps://doi.org/10.1007/978-3-642-12592-8_7openalex-snapshot
On Inductive and Coinductive Proofs via Unfold/Fold Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_7openalex-snapshot
Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_18openalex-snapshot
Synthesis of Trigger Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-20715-0_3openalex-snapshot
Query-Driven Coordination of Multiple Answer Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-27269-1_13openalex-snapshot
Modular Termination Analysis of Java Bytecode and Its Application to phoneME Core Libraries
inferred← citeshttps://doi.org/10.1007/978-3-642-30473-6_10openalex-snapshot
Generation of Test Data Structures Using Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_15openalex-snapshot
Probabilistic Termination of CHRiSM Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_8openalex-snapshot
Using Real Relaxations during Program Specialization
inferred← citeshttps://doi.org/10.1007/978-3-642-45284-0_12openalex-snapshot
Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_47openalex-snapshot
VeriMAP: A Tool for Verifying Programs through Transformations
inferred← citeshttps://doi.org/10.1007/s10817-005-6546-zopenalex-snapshot
Termination of Floating-Point Computations
inferred← citeshttps://doi.org/10.1007/s10990-008-9030-8openalex-snapshot
Efficient and flexible access control via Jones-optimal logic program specialisation
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.027openalex-snapshot
Algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.062openalex-snapshot
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
inferred← citeshttps://doi.org/10.1016/j.ic.2014.01.005openalex-snapshot
Fast offline partial evaluation of logic programs
inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.014openalex-snapshot
Synthesis of positive logic programs for checking a class of definitions with infinite quantification
inferred← citeshttps://doi.org/10.1016/j.infsof.2009.04.010openalex-snapshot
Decompilation of Java bytecode to Prolog by partial evaluation
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105866openalex-snapshot
Combining model finder and genetic programming into a general purpose automatic program synthesizer
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.006openalex-snapshot
Theorema: Towards computer-aided mathematical theory exploration
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.030openalex-snapshot
Synthesis of list algorithms by mechanical proving
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.04.002openalex-snapshot
Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
inferred← citeshttps://doi.org/10.1016/j.jss.2015.08.017openalex-snapshot
Backwards reasoning for model transformations: Method and applications
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.017openalex-snapshot
Program verification via iterated specialization
inferred← citeshttps://doi.org/10.1016/j.scico.2016.11.002openalex-snapshot
Semantics-based generation of verification conditions via program specialization
inferred← citeshttps://doi.org/10.1016/j.scico.2017.12.006openalex-snapshot
Some trade-offs in reducing the overhead of assertion run-time checks via static analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.005openalex-snapshot
Determinization of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.012openalex-snapshot
Analyzing fractional Horn constraint systems
inferred← citeshttps://doi.org/10.1017/s1471068407003043openalex-snapshot
Calculating modules in contextual logic program refinement
inferred← citeshttps://doi.org/10.1017/s1471068409990263openalex-snapshot
Efficient local unfolding with ancestor stacks
inferred← citeshttps://doi.org/10.1017/s1471068410000025openalex-snapshot
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
inferred← citeshttps://doi.org/10.1017/s1471068410000177openalex-snapshot
Transformations of logic programs on infinite lists
inferred← citeshttps://doi.org/10.1017/s1471068411000147openalex-snapshot
SAT-based termination analysis using monotonicity constraints over the integers
inferred← citeshttps://doi.org/10.1017/s1471068416000417openalex-snapshot
Semantic code browsing
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.