Overview of LOPSTR 2018

---

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 28th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2018) will be held at the Goethe-University Frankfurt am Main, Germany. 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 and Manchester. LOPSTR 2018 will be co-located with PPDP 2018 (International Symposium on Principles and Practice of Declarative Programming) and WFLP 2018 (International Workshop on Functional and Logic Programming).

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. Both full papers and extended abstracts describing applications in 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
• 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 chairs in case of questions).

LOPSTR 2018 cooperates with:

                 

The program is available here.

Important Dates

---

Abstract submission:	June 26, 2018
Paper/Extended abstract submission:	June 30, 2018
Notification:	July 30, 2018
Camera-ready (for electronic pre-proceedings):	August 15, 2018
Symposium:	4-6 September, 2018

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:

    \pagestyle{plain}
    \usepackage{lineno}
    \linenumbers

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 2018.

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).

NEWS The LOPSTR 2018 best paper award has be assigned to Salvador Lucas for the paper "Proving Program Properties as First-Order Satisfiability".

Contact

---