Last Call for Participation: LOPSTR 2016 - 26th Intl. Symp. on Logic-Based Program Synthesis and Transformation

From: Pedro López García <pedro.lopez_at_imdea.org>
Date: Mon, 15 Aug 2016 09:28:38 +0200

==========================
==========================
==========

LAST CALL FOR PARTICIPATION:

LOPSTR 2016
26th International Symposium on
Logic-Based Program Synthesis and Transformation,
Edinburgh, Scotland UK, September 6-8, 2016
http://www.cliplab.org/Conferences/LOPSTR16/

co-located with

PPDP 2016
18th International Symposium on
Principles and Practice of Declarative Programming,
Edinburgh, Scotland UK, September 5-7, 2016
http://ppdp16.webs.upv.es/

and

SAS 2016
23rd Static Analysis Symposium,
Edinburgh, Scotland UK, September 8-10, 2016
http://staticanalysis.org/sas2016/

==========================
==========================
==========

Registration is open at:
http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/

  ** EARLY REGISTRATION UNTIL AUGUST 15 **

VISA

Please check here: https://www.gov.uk/check-uk-visa whether you
require a visa to visit the UK. If so, contact us as soon as possible
as explained here:
http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/registration.html
Getting a visa can take from 3-6 weeks depending on the nationality
and country from which applying.

We recommend that anyone considering attending who needs a visa
register now and apply now. If you are eventually unable to attend
due to visa issues we will refund your registration fee.

INVITED TALKS

- Greg Morrisett, Cornell University, USA (jointly with PPDP'16):
  Challenges in Compiling Coq.

- Francesco Logozzo, Facebook, USA (jointly with PPDP'16):
  Abstract interpretation for taint analysis at scale.
- Martin Vechev, ETH Zurich, Switzerland (jointly with SAS'16):
  Learning from Programs: Probabilistic Models, Program Analysis and
Synthesis.

ACCEPTED PAPERS

- Symbolic Abstract Contract Synthesis in a Rewriting Framework.
  María Alpuente, Daniel Pardo and Alicia Villanueva.

- Coinductive Soundness of Corecursive Type Class Resolution.
  Frantisek Farka, Ekaterina Komendantskaya, Kevin Hammond and Peng Fu.

- MiniZinc with Strings.
  Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter
  J. Stuckey and Guido Tack.

- On the Completeness of Selective Unification in Concolic Testing of
  Logic Programs.
  Fred Mesnard, Etienne Payet and German Vidal.

- Verification of Time-Aware Business Processes using Constrained Horn
Clauses.
  Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto
  Pettorossi and Maurizio Proietti.

- Tuning Fuzzy Logic Programs with Symbolic Execution.
  Gines Moreno, Jaime Penabad and German Vidal.

- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient
  Generators for Closed Simply-Typed Lambda Terms and Normal Forms.
  Paul Tarau.

- A New Functional-Logic Compiler for Curry: Sprite.
  Sergio Antoy and Andy Jost.

- Towards Reversible Computation in Erlang.
  Naoki Nishida, Adrian Palacios and German Vidal.

- Slicing Concurrent Constraint Programs.
  Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte and Catuscia
  Palamidessi.

- Scaling Bounded Model Checking By Transforming Programs With Arrays.
  Anushri Jana, Uday Khedker, Advaita Datar, R Venkatesh and Niyas C.

- Hierarchical Shape Abstraction of Free-List Memory Allocators.
  Bin Fang and Mihaela Sighireanu.

- A Productivity Checker for Logic Programming.
  Ekaterina Komendantskaya, Patricia Johann and Martin Möhrmann.

- Automata Theory Approach to Predicate Intuitionistic Logic.
  Maciej Zielenkiewicz and Aleksy Schubert.

- Nominal Unification of Higher Order Expressions with Recursive Let.
  Manfred Schmidt-Schauss, Temur Kutsia, Jordi Levy and Mateu Villaret.

- A Formal, Resource Consumption-Preserving Translation of Actors to
Haskell.
  Elvira Albert, Nikolaos Bezirgiannis, Frank De Boer and Enrique
Martin-Martin.

- Partial Evaluation of Order-sorted Equational Programs modulo Axioms.
  María Alpuente, Angel Cuenca, Santiago Escobar and Jose Meseguer.

- lpopt: A Rule Optimization Tool for Answer Set Programming.
  Manuel Bichler, Michael Morak and Stefan Woltran.

- CurryCheck: Checking Properties of Curry Programs.
  Michael Hanus.

- Intuitionistic Logic Programming for SQL.
  Fernando Saenz-Perez.

Hope to see you in Edinburgh!

Manuel Hermengildo and
Pedro Lopez-Garcia
LOPSTR 2016 Co-chairs

Received on Mon Aug 15 2016 - 09:40:35 CEST

This archive was generated by hypermail 2.3.0 : Mon Sep 23 2019 - 07:15:09 CEST