LOPSTR 19: 29TH INTERNATIONAL SYMPOSIUM ON LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION

This page contains an index consisting of author-provided keywords.

(
(Constraint) Logic Programming	A General Framework for Static Cost Analysis of Parallel Logic Programs
A
Abstract Interpretation	Computing Abstract Distances in Logic Programs Incremental Analysis of Logic Programs with Assertions and Open Predicates
Answer Set Programming	Synthesizing Imperative Code from Answer Set Programming Specifications
ASP	Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
Assertion-based Debugging and Validation	An Integrated Approach to Assertion-Based Random Testing in Prolog
Assertions	Incremental Analysis of Logic Programs with Assertions and Open Predicates
B
Blockchain	Blockchain Superoptimizer
box model	The Prolog debugger and declarative programming
C
Calculus	A Calculus for Concurrent and Sequential Programming
Checking	10 Years of the Higher-Order Model Checking Project
clone detection	Generalization-driven semantic clone detection in CLP (Extended Abstract)
CLP	Generalization-driven semantic clone detection in CLP (Extended Abstract)
Code Generation	Synthesizing Imperative Code from Answer Set Programming Specifications
complete lattices	Computing Abstract Distances in Logic Programs
Complexity Analysis	A General Framework for Static Cost Analysis of Parallel Logic Programs
compositionality	Natural language compositionality in Coq
Concurrent	A Calculus for Concurrent and Sequential Programming
conditional term rewriting systems	Semi-Inversion of Conditional Constructor Term Rewriting Systems
constraint solving	Solving Proximity Constraints
Constraints	Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
Coq	Natural language compositionality in Coq
D
data specification	An Optional Static Type System for Prolog
database design	A Port Graph Rewriting Approach to Relational Database Modelling
declarative diagnosis / algorithmic debugging	The Prolog debugger and declarative programming
declarative programming	The Prolog debugger and declarative programming
denotational semantics	On fixpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics
distances	Computing Abstract Distances in Logic Programs
E
Ethereum	Blockchain Superoptimizer
Event Calculus	Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
Event driven hybrid systems	Trace analysis using an Event-driven Interval Temporal Logic
F
Finite state machines	Trace analysis using an Event-driven Interval Temporal Logic
functional dependency	A Port Graph Rewriting Approach to Relational Database Modelling
G
Generic Code	Incremental Analysis of Logic Programs with Assertions and Open Predicates
goal-directed execution	Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
graph transformation	A Port Graph Rewriting Approach to Relational Database Modelling
H
Higher-Order	10 Years of the Higher-Order Model Checking Project
Higher-order logic	Logic-Based Synthesis of Fair Voting Rules Using Composable Modules
I
Incremental Static Analysis	Incremental Analysis of Logic Programs with Assertions and Open Predicates
induction principles	On fixpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics
Interval logic	Trace analysis using an Event-driven Interval Temporal Logic
inversion	Semi-Inversion of Conditional Constructor Term Rewriting Systems
L
logic programming	Computing Abstract Distances in Logic Programs An Integrated Approach to Assertion-Based Random Testing in Prolog Incremental Analysis of Logic Programs with Assertions and Open Predicates The Prolog debugger and declarative programming
M
metrics	Computing Abstract Distances in Logic Programs
minimal cover	A Port Graph Rewriting Approach to Relational Database Modelling
Model	10 Years of the Higher-Order Model Checking Project
Modular design	Logic-Based Synthesis of Fair Voting Rules Using Composable Modules
N
natural language	Natural language compositionality in Coq
Nominal C-Unification	A Certified Functional Nominal C-Unification Algorithm
Nominal Terms	A Certified Functional Nominal C-Unification Algorithm
O
optional type system	An Optional Static Type System for Prolog
P
Parallelism	A General Framework for Static Cost Analysis of Parallel Logic Programs
partial and total correctness	On fixpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics
Partial Evaluation	Synthesizing Imperative Code from Answer Set Programming Specifications
port graph	A Port Graph Rewriting Approach to Relational Database Modelling
progam transformation	Generalization-driven semantic clone detection in CLP (Extended Abstract)
program semantics	Computing Abstract Distances in Logic Programs
Program Synthesis	Logic-Based Synthesis of Fair Voting Rules Using Composable Modules Synthesizing Imperative Code from Answer Set Programming Specifications
Program Transformation	Synthesizing Imperative Code from Answer Set Programming Specifications Semi-Inversion of Conditional Constructor Term Rewriting Systems
Programming	A Calculus for Concurrent and Sequential Programming
Prolog	An Integrated Approach to Assertion-Based Random Testing in Prolog A General Framework for Static Cost Analysis of Parallel Logic Programs An Optional Static Type System for Prolog
Prolog (programming language)	The Prolog debugger and declarative programming
Property-based Testing	An Integrated Approach to Assertion-Based Random Testing in Prolog
proximity relations	Solving Proximity Constraints
R
relational databases	A Port Graph Rewriting Approach to Relational Database Modelling
Resource Usage Analysis	A General Framework for Static Cost Analysis of Parallel Logic Programs
Runtime Verification	Trace analysis using an Event-driven Interval Temporal Logic
S
semi-inversion	Semi-Inversion of Conditional Constructor Term Rewriting Systems
SMT	Blockchain Superoptimizer
Social choice	Logic-Based Synthesis of Fair Voting Rules Using Composable Modules
Specifications	Incremental Analysis of Logic Programs with Assertions and Open Predicates
Static Analysis	Computing Abstract Distances in Logic Programs An Integrated Approach to Assertion-Based Random Testing in Prolog A General Framework for Static Cost Analysis of Parallel Logic Programs
static verification	An Optional Static Type System for Prolog
Superoptimization	Blockchain Superoptimizer
Symbolic Execution	Synthesizing Imperative Code from Answer Set Programming Specifications
T
type theory	Natural language compositionality in Coq
U
unification	Solving Proximity Constraints
V
verification	On fixpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics
Verification of Functional Specifications	A Certified Functional Nominal C-Unification Algorithm

Disclaimer | Powered by EasyChair Smart Program