Logic-Based Program Synthesis and Transformation : 29th International Symposium, LOPSTR 2019, Porto, Portugal, October 8-10, 2019, Revised selected papers / Maurizio Gabbrielli (ed.).

Print version record.

Intro -- Preface -- Organization -- Invited Papers -- Reversibilization in Functional and Concurrent Programming -- Horn Clauses and Tree Automata for Imperative Program Verification -- Contents -- Static Analysis -- 1 On fixpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics -- 1 Introduction -- 2 Basic notions in denotational semantics -- 3 Termination specification -- 4 Fixpoint induction principle -- 5 Impossibility to prove termination by fixpoint induction with a denotational semantics -- 6 Iteration induction principle

7 Impossibility to prove termination by iteration induction -- 8 Generalized iteration induction principle -- 9 Proving total correctness by generalized iteration induction -- 10 Parameter dependency -- 11 Recursive non-termination -- 12 Proving termination by a variant/convergence function -- 13 Equivalence of the termination proof by generalized iteration induction and by variant/convergence function principle -- 14 Extension to total correctness -- 15 Application to the while iteration -- 16 Conclusion -- Acknowledgements -- References

A General Framework for Static Cost Analysis of Parallel Logic Programs -- 1 Introduction -- 2 Overview of the Approach -- 3 The Parametric Cost Relations Framework for Sequential Programs -- 4 Our Extended Resource Analysis Framework for Parallel Programs -- 4.1 Solving Cost Recurrence Relations Involving max Operation -- 5 Implementation and Experimental Results -- 6 Related Work -- 7 Conclusions -- References -- Incremental Analysis of Logic Programs with Assertions and Open Predicates -- 1 Introduction -- 2 Background -- 3 An Approach to Modular Generic Programming: Traits

4 Goal-Dependent Abstract Interpretation -- 4.1 Goal-Dependent Program Analysis -- 5 Incremental Analysis of Programs with Assertions -- 5.1 The Incremental Analyzer of Programs with Assertions -- 5.2 Use Cases -- 6 Experiments -- 7 Related Work -- 8 Conclusions -- A Assertions -- References -- Computing Abstract Distances in Logic Programs -- 1 Introduction -- 2 Background and Notation -- 3 Distances in Abstract Domains -- 3.1 Distances in Lattices and Abstract Domains -- 3.2 Distances in Logic Programming Domains -- 4 Distances Between Analyses -- 5 Experimental Evaluation -- 6 Related Work

7 Conclusions -- References -- Program Synthesis -- Synthesizing Imperative Code from Answer Set Programming Specifications -- 1 Introduction -- 2 Background -- 3 Motivating Example -- 4 Synthesizing Code for Graph Coloring -- 5 Synthesis Assumptions -- 6 Synthesis Task -- 6.1 Syntax-Directed Translation -- 6.2 Synthesis Procedure -- 6.3 Transformation Rules -- 6.4 Efficiency of the Synthesized Code -- 6.5 Proof of Correctness -- 7 Conclusion -- References -- Verified Construction of Fair Voting Rules -- 1 Introduction -- 2 Concepts and Definitions from Social Choice Theory

3 Composable Modules and Compositional Structures

Includes bibliographical references and index.

This book constitutes the thoroughly refereed post-conference proceedings of the 29th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2019, held in Porto, Portugal, in October 2019. The 15 revised full papers were carefully reviewed and selected from 32 submissions. In addition to the 15 papers, this volume includes 2 invited papers. 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.