The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers.
The 29th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2019) will be held at the Porto, Portugal. Previous symposia were held in Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, Manchester and Frankfurt. LOPSTR 2019 will be co-located with the Symposium on Formal Methods, FM'19 and a part of the FM Week.
Topics of interest cover all aspects of logic-based program development, all 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. Both full papers and extended abstracts describing applications in all these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: synthesis, transformation, specialization, composition, optimization, inversion, specification, analysis and verification, testing and certification, program and model manipulation, machine learning for program development, integration of sub-symbolic and symbolic models, differential semantics, transformational techniques in SE, applications and tools.
Survey papers that present some aspects of the above topics from a new perspective, and application papers that describe experience with industrial applications are also welcome.
Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions).


Invited Speakers

John Gallagher - Roskilde University, Denmark
Naoki Kobayashi - The University of Tokyo, Japan (joint with PPDP)
German Vidal - Polytechnic University of Valencia, Spain (joint with PPDP)

Accepted papers

  • Mauricio Ayala-Rincon, Maribel Fernández, Gabriel Silva and Daniele Nantes-Sobrinho. A Certified Functional Nominal C-Unification Algorithm
  • Maximiliano Klemen, Pedro Lopez-Garcia, John P. Gallagher, Jose F. Morales and Manuel V. Hermenegildo. A General Framework for Static Cost Analysis of Parallel Logic Programs
  • Janos Varga, Maribel Fernandez and Bruno Pinaud. A Port Graph Rewriting Approach toRelational Database Modelling
  • Ignacio Casso, Jose F. Morales and Manuel V. Hermenegildo. An Integrated Approach to Assertion-Based Random Testing in Prolog
  • Isabel Wingen and Philipp Koerner. An Optional Static Type System for Prolog
  • Julian Nagele and Maria Anna Schett. Blockchain Superoptimizer
  • Ignacio Casso, Jose F. Morales, Pedro López and Manuel Hermenegildo. Computing Abstract Distances in Logic Programs
  • Wim Vanhoof and Gonzague Yernaux. Generalization-driven semantic clone detection in CLP (Extended Abstract)
  • Isabel Garcia-Contreras, Jose F. Morales and Manuel V. Hermenegildo. Incremental Analysis of Logic Programs with Assertions and Open Predicates
  • Karsten Diekhoff, Michael Kirsten and Jonas Krämer. Logic- Based Synthesis of Fair Voting Rules Using Composable Modules
  • Joaquin Arias, Zhuo Chen, Manuel Carro and Gopal Gupta. Modeling and Reasoning in Event Calculus Using Goal- Directed Constraint Answer Set Programming
  • Erkki Luuk. Natural language compositionality in Coq
  • Patrick Cousot. On fixpoint/iteration/variant induction principles for proving total correctness of programs with denotational semantics
  • Maja Kirkeby and Robert Glück. Semi-Inversion of Conditional Constructor Term Rewriting Systems
  • Temur Kutsia and Cleo Pau. Solving Proximity Constraints
  • Sarat Chandra Varanasi, Elmer Salazar, Neeraj Mittal and Gopal Gupta. Synthesizing Imperative Code from Answer Set Programming Specifications
  • Włodek Drabent. The Prolog debugger and declarative programming
  • María-Del-Mar Gallardo and Laura Panizo. Trace analysis using an Event-driven Interval Temporal Logic


Sabine Broda - University of Porto, Portugal
Manuel Carro - Technical University of Madrid and IMDEA, Spain
Ugo Dal Lago - University of Bologna, Italy
Daniel De Schreye - KU Leuven, Belgium
Santiago Escobar - Polytechnic University of Valencia, Spain
Moreno Falaschi - University of Siena, Italy
Laurent Fribourg - CNRS, France
Maurizio Gabbrielli - (Chair) University of Bologna, Italy
Arnaud Gotlieb - SIMULA Research Laboratory, Norway
Gopal Gupta - The University of Texas at Dallas, U.S.A
Andy King - University of Kent, U.K.
Herbert Kuchen - University of Muenster, Germany
Jacopo Mauro - University of Southern Denmark, Denmark
Hernan Melgratti - University of Buenos Aires, Argentina
Maria Chiara Meo - University G. D'Annunzio, Chieti Pescara, Italy
Carlos Olarte - Federal University of Rio Grande do Norte, Brazil
Hirohisa Seki - Nagoya Institute of Technology, Japan
Caterina Urban - INRIA, France
Herbert Wiklicky - Imperial College London, U.K.

Important Dates

Submission Deadlines

Title and abstract: 25 June, 2019 (AoE)
Paper submission: 30 June, 2019 (AoE)
Author notification: 24 July 2019 (AoE)

Participation Deadlines

Final paper version (for electronic pre-proceedings): 7 Aug, 30 Aug 2019
Conference: 8–10 October 2019

Submission Guidelines

Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in the Lecture Notes in Computer Science style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. So, for LaTeX, we recommend that authors use:

Submissions cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via the Easychair submission website for LOPSTR 2019 - Submission link on Easychair.

Best Paper Award and Prize

A best paper award will be granted, which will include a 500 EUR prize provided by Springer. This award will be given to the best paper submitted to the conference, based on the relevance, originality, and technical quality. The program committee may split the award among two or more papers, also considering authorship (e.g., student paper).


Registration is available at the FM registration portal (Early registration ends on Sep 10th, 2019.)


The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings.


Program Chair

Maurizio Gabbrielli
Department of Computer Science and Engineering
University of Bologna

Publicity Chair

Tong Liu
Department of Computer Science and Engineering
University of Bologna