yusuke1997/dblp-id-title huggingface dataset:
An Unfold Rule for Full Prolog
Abstract Analysis of Universal Properties for tccp
Inferring Argument Size Relationships with CLP(R)
Symbolic Abstract Contract Synthesis in a Rewriting Framework
Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs
Galliwasp: A Goal-Directed Answer Set Solver
Transformational Verification of Parameterized Protocols Using Array Formulas
Transformation Rules for Logic Programs with Goals as Arguments
Logic Programming Synthesis and Transformation - Meta-Programming in Logic. 4th Internation Workshops, LOPSTR'94 and META'94, Pisa, Italy, June 20-21, 1994, Proceedings
An Efficient Staging Algorithm for Binding-Time Analysis
Eliminating Unstable Tests in Floating-Point Programs
Combining Prolog Programs in a Techniques Editing System (Abstract)
Towards Description and Optimization of Abstract Machines in an Extension of Prolog
A Transformation Based in the Equality Between Terms
Logic Program Transformation through Generalization Schemata
Converting One Type-Based Abstract Domain to Another
Applying Sorting Networks to Synthesize Optimized Sorting Libraries
The First-Order Nominal Link
A Transformation System for Definite Programs Based on Termination Analysis
An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract)
Logic-Based Program Synthesis and Transformation, 23rd International Symposium, LOPSTR 2013, Madrid, Spain, September 18-19, 2013, Revised Selected Papers
Efficient Translation of Lazy Functional Logic Programs into Prolog
Probabilistic Termination of CHRiSM Programs
Synthesis of Data Views for Communicating Processes
From Monomorphic to Polymorphic Well-Typings and Beyond
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Improving Logic Programs by Adding Functions
Abstract: Proof Planning with Program Schemas
Memory Policy Analysis for Semantics Specifications in Maude
A New Hybrid Debugging Architecture for Eclipse
Global Search Algorithms and the Constraint Logic Programming Framework (Extended Abstract)
Logic Program Schemas, Constraints, and Semi-unification
Specialization of Concurrent Guarded Multi-set Transformation Rules
Analyzing Array Manipulating Programs by Program Transformation
Logic Programming and Logic Grammars with First-Order Continuations
Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms
Derivation of Concurrent Algorithms in Tempo
Fast Offline Partial Evaluation of Large Logic Programs
A Model of Costs and Benefits of Meta-Level Computation
Improving Homeomorphic Embedding for Online Termination
Confluence of CHR Revisited: Invariants and Modulo Equivalence
Declarative Programming with Function Patterns
Analysing Parallel Complexity of Term Rewriting
Predicate Specialization for Definitional Higher-Order Logic Programs
Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs
lpopt: A Rule Optimization Tool for Answer Set Programming
Pragmatics in the Synthesis of Logic Programs
Annotations for Prolog - A Concept and Runtime Handling
Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
On Correct Program Schemas
Logic-Based Program Synthesis and Transformation - 35th International Symposium, LOPSTR 2025, Rende, Italy, September 9-10, 2025, Proceedings
Partial Deduction in the Framework of Structural Synthesis of Programs
Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra Model
Implementing a Many-Valued Semantics for Logic Programs with Ordered Disjunction Using ASP
Nominal Unification with Letrec and Environment-Variables
Generalizing Extended Execution for Normal Programs
A Comparative Study of Algorithmic Debugging Strategies
Automated Termination Analysis for Logic Programs by Term Rewriting
Logic Based Program Synthesis and Tranformation, 12th International Workshop, LOPSTR 2002, Madrid, Spain, September 17-20,2002, Revised Selected Papers
Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems
Slicing Unconditional Jumps with Unnecessary Control Dependencies
Logic Programming Synthesis and Transformation, 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings
Deletion of Redundant Unary Type Predicates from Logic Programs
A Transformational Semantics of Static Embedded Implications of Normal Logic Programs
A Port Graph Rewriting Approach to Relational Database Modelling
Introspective Metatheoretic Reasoning
Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development
On Inductive Proofs by Extended Unfold/Fold Transformation Rules
Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives
Logic-Based Program Synthesis and Transformation - 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings
From Boolean Equalities to Constraints
Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms
Space Invading Systems Code
Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming
Specifying Prolog trace models with a continuation semantics
Representation and Processing of Instantaneous and Durative Temporal Phenomena
Analysis of Linear Hybrid Systems in CLP
Refining Specifications to Logic Programs
Specialising Meta-level Compositions of Logic Programs
Verifying Smart Contracts in Yul via Transformation to CHC by Interpreter Specialization
Specialising Interpreters Using Offline Partial Deduction
Natural Rewriting for General Term Rewriting Systems
Symbolic Computation and Verification Methods in Maude
Recurrent Pairs Revisited
A Certified Reference Validation Mechanism for the Permission Model of Android
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene
A Module System for Meta-Programming
Transforming Specifications of Observable Behaviour into Programs
The Next 700 Program Transformers
Efficient Compilation of Lazy Narrowing into Prolog
Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000 London, UK, July 24-28, 2000, Selected Papers
Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators
Coinductive Logic Programming with Negation
Logic Program Synthesis and Transformation, Proceedings of LOPSTR 93, International Workshop on Logic Program Synthesis and Transformation, Louvain-la-Neuve, Belgium, 7-9 July 1993
Analysis of Air Traffic Track Data with the AutoBayes Synthesis System
Logic Programming Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Venezia, Italy, September 22-24, 1999, Selected Papers
Adding Concrete Syntax to a Prolog-Based Program Synthesis System (Extended Abstract)
Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis
Generalization-Driven Semantic Clone Detection in CLP
Complexity of Horn Programs
Logimix: A Self-Applicable Partial Evaluator for Prolog
On Correctness of Normal Logic Programs
Tabling Structures for Bottom-Up Logic Programming
Resource-Driven CLP-Based Test Case Generation
Translating Datalog-Like Optimization Queries into ILOG Programs
Scaling Up Algorithmic Debugging with Virtual Execution Trees
A Transformation Tool for Pure Prolog Programs
Synthesis of Modality Definitions and a Theorem Prover for Epistemic Intuitionistic Logic
CARET Analysis of Multithreaded Programs
Proving Termination with (Boolean) Satisfaction
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Generalization in Hierarchies of Online Program Specialization Systems
Making Mercury Programs Tail Recursive
Measuring the Precision of Abstract Interpretations
Logic Program Synthesis and Transformation, Proceedings of LOPSTR 92, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, UK, 2-3 July 1992
Simplification of Database Integrity Constraints Revisited: A Transformational Approach
Formal Validation of Transformation Schemata
Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
String Abstract Domains and Their Combination
Termination of Logic Programs Using Semantic Unification
Run-Time Profiling of Functional Logic Programs
Compositional CLP-Based Test Data Generation for Imperative Languages
A Unifying View of Structural Induction and Computation Induction for Logic Programs
Developing Logic Programs from Specifications Using Stepwise Refinement
Synthesizing Imperative Code from Answer Set Programming Specifications
Deriving Transformations for Logic Programs Using Abstract Interpretation
Scaling Bounded Model Checking by Transforming Programs with Arrays
On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects
Erlang Code Evolution Control
Trace Analysis Using an Event-Driven Interval Temporal Logic
Declarative Semantics of Input Consuming Logic Programs
A model for inter-module analysis and optimizing compilation
S-Semantics-an Example
Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
Action Refinement in Process Algebra and Security Issues
Specialising Fininte Domain Programs Using Polyhedra
Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
A Global Occurrence Counting Analysis for Brane Calculi
Enhancing Partial Deduction via Unfold/Fold Rules
Program Parallelization Using Synchronized Pipelining
Termination Analysis for Tabled Logic Programming
Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies
On Termination of Binary CLP Programs
Testing Your (Static Analysis) Truths
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
Formal Reasoning about Efficient Data Structures: A Case Study in ACL2
Towards the Synthesis of Constraint Propagation Algorithms
Towards a modular binding-time analysis for higher-order Mercury
Synthesis of Proof Procedures for Default Reasoning
On the Transformation of a Prolog Program to a More Efficient Binary Program
Combining Logic Programs and Monadic Second Order Logics by Program Transformation
Integration and Optimization of Rule-Based Constraint Solvers
MiniZinc with Strings
A Rule-Based Approach for Designing and Composing Abstract Domains
Invariant Discovery via Failed Proof Attempts
A Step Towards a Methodology for Mercury Program Construction: A Declarative Semantics for Mercury
Higher-Order Transformation of Logic Programs
Towards Correct Object-Oriented Design Frameworks in Computational Logic
Towards Specification-Guarded Refactoring
Verified Construction of Fair Voting Rules
Refining Exceptions in Four-Valued Logic
Logical Mobility and Locality Types
Improved Termination Analysis of CHR Using Self-sustainability Analysis
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation
Towards Automatic Control for CLP(x) Programs
Confluence Framework: Proving Confluence with CONFident
Abstract Diagnosis of Functional Programs
Constructively Characterizing Fold and Unfold
Logic-Based Program Synthesis and Transformation - 30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7-9, 2020, Proceedings
Protocols between programs and proofs
Convex Hull Abstractions in Specialization of CLP Programs
Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
Continuation Semantics as Horn Clauses
Logic Program Synthesis by Induction over Horn Clauses
Specialization with Constrained Generalization for Software Model Checking
Logic-Based Program Synthesis and Transformation - 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6-8, 2016, Revised Selected Papers
A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs
Terminating Non-disjoint Combined Unification
Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof
Proving Properties of Co-logic Programs with Negation by Program Transformations
CurryCheck: Checking Properties of Curry Programs
Abstract Partial Deduction Challenged
Context Generation from Formal Specifications for C Analysis Tools
An Assertion Language for Slicing Constraint Logic Languages
A Novel EGs-Based Framework for Systematic Propositional-Formula Simplification
Polytool: Proving Termination Automatically Based on Polynomial Interpretations
An Axiomatic Category-Based Access Control Model for Smart Homes
Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines
Logic-Based Program Synthesis and Transformation - 28th International Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers
Automata-Based Computation of Temporal Equilibrium Models
Deciding Knowledge Problems Modulo Classes of Permutative Theories
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations
From Natural Semantics to Abstract Machines
When Size Does Matter
Extending the FSyntax/Hiord Approach with Imperative Notation
Impact of Accuracy Optimization on the Convergence of Numerical Iterative Methods
On Dual Programs in Co-Logic Programming
Compiling Control as Offline Partial Deduction
Unwinding Conditions for Security in Imperative Languages
Semi-inversion of Conditional Constructor Term Rewriting Systems
Induction of Prolog Programs with Markus
Predicate Pairing with Abstraction for Relational Verification
XACML 3.0 in Answer Set Programming
The Prolog Debugger and Declarative Programming
A Term Matching Algorithm and Substitution Generality
Concolic Execution and Test Case Generation in Prolog
A Formal, Resource Consumption-Preserving Translation of Actors to Haskell
The Replacement Operation for CCP Programs
Logic-Based Program Synthesis and Transformation - 21st International Symposium, LOPSTR 2011, Odense, Denmark, July 18-20, 2011. Revised Selected Papers
Logic Based Program Synthesis and Transformation, 15th International Symposium, LOPSTR 2005, London, UK, September 7-9, 2005, Revised Selected Papers
Schema-Guided Synthesis of CLP Programs
Protocols between Programs and Proofs
Abstract Debugging of Logic Program
The Power of Partial Evaluation
Focusing Recursive LLM Descents with Plans Expressed as Logic Programs
Gödel as a Meta-Language for Composing Logic Programs
Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study
Data Type Inference for Logic Programming
A Model for Inter-module Analysis and Optimizing Compilation
Specification-Based Automatic Verification of Prolog Programs
Liveness-Driven Random Program Generation
Interactive Program Derivation Using Program Schemata and Incrementally Generated Strategies
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
Collecting Potential Optimisations
Deterministic Higher-Order Patterns for Program Transformation
Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, LOPSTR 2000, London, UK, July 24-28, 2000
Logical Synthesis of Imperative O. O. Programs
Fully Automatic Binding-Time Analysis for Prolog
On Specification Frameworks and Deductive Synthesis of Logic Programs
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
Negation Elimination for Finite PCFGs
LP with Flexible Grouping and Aggregates Using Modes
Linearization by Program Transformation
Logic-Based Program Synthesis and Transformation - 29th International Symposium, LOPSTR 2019, Porto, Portugal, October 8-10, 2019, Revised Selected Papers
On Inductive and Coinductive Proofs via Unfold/Fold Transformations
Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms
Multivariant Assertion-Based Guidance in Abstract Interpretation
Pre-indexed Terms for Prolog
Logic-Based Program Synthesis and Transformation - 24th International Symposium, LOPSTR 2014, Canterbury, UK, September 9-11, 2014. Revised Selected Papers
Justification Based on Program Transformation
A Declarative Embedding of XQuery in a Functional-Logic Language
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
Guiding Synthesis Proofs
Ideal Refinement of Datalog Programs
Graph Generation to Statically Represent CSP Processes
Specifying Prolog Trace Models with a Continuation Semantics
Program Equivalence, Program Development and Integrity Checking
A Rule-Based Approach to Analyzing Database Schema Objects with Datalog
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
Specialising the Ground Representation in the Logic Programming Language Gödel
Roles of Program Extension
On Negative Unfolding in the Answer Set Semantics
The MEB and CEB Static Analysis for CSP Specifications
Analysis of Rewriting-Based Systems as First-Order Theories
A Reusable Machine-Calculus for Automated Resource Analyses
Confluence Modulo Equivalence in Constraint Handling Rules
Query Optimization in an Object-Oriented Database using Prolog (Extende Abstract)
Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation
Equivalence in Answer Set Programming
CHRAnimation: An Animation Tool for Constraint Handling Rules
Logic Program Synthesis via Proof Planning
Logic-Based Program Synthesis and Transformation, 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers
Drill and Join: A Method for Exact Inductive Program Synthesis
A Proof System for Information Flow Security
Solving Deductive Planning Problems Using Program Analysis and Transformation
A Declarative Pipeline Language for Complex Data Analysis
Partial Evaluation for Java Malware Detection
Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers
Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems
Parallel Assembly Synthesis
Generalised Logic Program Transformation Schemas
Inductive Synthesis of Logic Programs and Inductive Logic Programming
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
Algebraic Specification and Program Development by Stepwise Refinement
A Formal Model for a Linear Time Correctness Condition of Proof Nets of Multiplicative Linear Logic
A Constructor-Based Reachability Logic for Rewrite Theories
A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract)
From Outermost Reduction Semantics to Abstract Machine
Deadlock Detection of Java Bytecode
Termination Analysis of Logic Programs Based on Dependency Graphs
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
A Strategy Language for Graph Rewriting
Guided Unfoldings for Finding Loops in Standard Term Rewriting
On Using Mode Input-output for Transforming Logic Programs
Logic Programming Synthesis and Transformation, 8th International Workshop, LOPSTR'98, Manchester, UK, June 15-19, 1998, Proceedings
A Framework for Guided Test Case Generation in Constraint Logic Programming
Synthesis of Narrowing Programs
Logic Programs with Tests
Functional Kleene Closures
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion
A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear Logic Inference
Clones in Logic Programs and How to Detect Them
Compiling a Functional Logic Language: The Fair Scheme
Constructing Consensus Logic Programs
A Logical Interpretation of Asynchronous Multiparty Compatibility
Applications of Unfolding in Prolog Programming
Inductive Synthesis of Rewrite Rules as Program Synthesis (Extended Abstract)
An Operational Approach to Program Extraction in the Calculus of Constructions
On Completeness of Logic Programs
A formal framework for synthesis and verification of logic programs
Compiling Collapsing Rules in Certain Constructor Systems
Building Proofs in Context
Guiding Program Development Systems by a Connection Based Proof Strategy
Transformation of Left Terminating Programs: the Reordering Problem
CHESS: Systematic Stress Testing of Concurrent Software
Implicit Program Synthesis by a Reversible Metainterpreter
Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation
The Dependency Triple Framework for Termination of Logic Programs
Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables
Typed Norms for Typed Logic Programs
A Rationalisation of the ATMS in Terms of Partial Evaluation
Specifying Compositional Units for Correct Program Development in Computational Logic
Context-Moving Transformations for Function Verification
Experiments in Context-Sensitive Analysis of Modular Programs
Logic-Based Program Synthesis and Transformation, 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms
Incremental Analysis of Logic Programs with Assertions and Open Predicates
Formal Semantics of Temporal Epistemic Reflection
A Generalized Model for Algorithmic Debugging
Intensional Query Answering: An Application of Partial Evaluation
Towards a Normal Form for Mercury Programs
SHIP - A Logic-Based Language and Tool to Program Smart Environments
Formalization and Execution of Linear Algebra: From Theorems to Algorithms
Types vs. PDGs in Information Flow Analysis
Two Variables per Linear Inequality as an Abstract Domain
Automatic Termination Analysis
Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
Marker-Directed Optimization of UnCAL Graph Transformations
Towards Substructural Property-Based Testing
Proving Properties of Co-Logic Programs by Unfold/Fold Transformations
Abstract Interpretation and Recursive Behaviour of Logic Programs
Slicing Concurrent Constraint Programs
Logic-Based Program Synthesis and Transformation, 16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers
Introducing esra, a Relational Language for Modelling Combinatorial Problems
Logic Frameworks for Logic Programs
An Extended Transformation System for CLP Programs
Intuitionistic Logic Programming for SQL
Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers
Logic Program Specialisation: How to Be More Specific (Abstract)
Nominal C-Unification
An Architecture with Multiple Meta-Levels for the Development of Correct Programs
Verification of Time-Aware Business Processes Using Constrained Horn Clauses
Unification Modulo Equational Theories in Languages with Binding Operators (Invited Talk)
Aggregates for CHR through Program Transformation
Partial Evaluation of the "Real Thing"
Logic-Based Program Synthesis and Transformation, 18th International Symposium, LOPSTR 2008, Valencia, Spain, July 17-18, 2008, Revised Selected Papers
CurryInfo: Managing Analysis and Verification Information about Curry Packages
Generating Specialized Interpreters for Modular Structural Operational Semantics
Automated Strategies for Specializing Constraint Logic Programs
Mapping Modular SOS to Rewriting Logic
Proof Nets
Binding-Time Analysis for Mercury
Logic Programming Synthesis and Transformation, 7th International Workshop, LOPSTR'97, Leuven, Belgium, July 10-12, 1997, Proceedings
Temporal Semantics of Meta-Level Architectures for Dynamic Control of Reasoning
Meta-predicate Semantics
Program Transformations Directed by the Evaluation of non Functional Properties (Extended Abstract)
Rewriting Induction for Higher-Order Constrained Term Rewriting Systems
On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors
Non-tranformational termination analysis of logic programs, based on general term-orderings
Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency
Natural Language to Logica: Towards Interactive and Explainable Data Analytics
Analysing Logic Programs by Reasoning Backwards
Verification by Testing for Recursive Program Schemes
Partial Deduction of Disjunctive Logic Programs: A Declarative Approach