Full Description
This book constitutes the thoroughly refereed post-conference proceedings of the 24th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2014, held in Canterbury, UK, in September 2014. The 18 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 34 submissions. The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. The papers are organized along a set of thematic tracks: program analysis and transformation, constraint handling rules, termination analysis, security, program testing and verification, program synthesis, program derivation, semantic issues in logic programming and program transformation and optimization.
Contents
Invited Talks.- Obscuring Code: Unveiling and Veiling Information in Programs.- Synthesizing Functions from Relations in Leon.- Program Analysis and Transformation.- Analyzing array manipulating programs by program transformation.- Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction.- Constraint Handling Rules.- Confluence Modulo Equivalence in Constraint Handling Rules.- Exhaustive Execution of CHR through Source-to-Source Transformation.- A Formal Semantics for the Cognitive Architecture ACT-R.- CHRAnimation: An Animation Tool for Constraint Handling Rules.- Termination Analysis.- Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems.- Security.-Partial Evaluation for Java Malware Detection.- Access control and obligations in the category-based metamodel: a rewritebased Semantics.- Program Testing and Verification.-Concolic Execution and Test-Case Generation in Prolog.- Liveness properties in CafeOBJ-a case study for meta-level specifications.- Program Synthesis.- A Hybrid Method for the Verification and Synthesis of Parameterized Self-Stabilizing Protocols.- Drill & Join: A method for inductive program synthesis.- Program Derivation.- Functional Kleene Closures.- Semantic Issues in Logic Programming.- On completeness of logic programs.- Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies.- Program Transformation and Optimization.- Declarative Compilation for Constraint Logic Programming.- Pre-indexed Terms for Prolog.
