Logic-Based Program Synthesis and Transformation
Description
The symposium cover all aspects of logic-based program development, stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. This year LOPSTR extends its traditional topics to include also logic-based program development based on integration of sub-symbolic and symbolic models, on machine learning techniques and on differential semantics. The papers are grouped into the following topics: static analysis, program synthesis, constraints and unification, debugging and verification, and program transformation.
More details
Other editions
Additional editions
Content
Reversibilization in Functional and Concurrent Programming.- Horn clauses and tree automata for imperative program verification.- On xpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics.- A General Framework for Static Cost Analysis of Parallel Logic Programs.- Incremental Analysis of Logic Programs with Assertions and Open Predicates.- Computing Abstract Distances in Logic Programs.- Synthesizing Imperative Code from Answer Set Programming Specifications.- Verified Construction of Fair Voting Rules.- Solving Proximity Constraints.- A Certified Functional Nominal C-Unification Algorithm.- Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming.- An Integrated Approach to Assertion-Based Random Testing in Prolog.-Trace analysis using an Event-driven Interval Temporal Logic.- The Prolog debugger and declarative programming.- A Port Graph Rewriting Approach to Relational Database Modelling.- Generalization-driven semantic clone detection in CLP.- Semi-Inversion of Conditional Constructor Term Rewriting Systems.
