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

--===============2042338669==
Content-Type: multipart/alternative; boundary=001a11412bdcace329053a16e24a

--001a11412bdcace329053a16e24a
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D

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/

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D

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=C3=ADa 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=C3=B6hrmann.

- 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=C3=ADa 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

--001a11412bdcace329053a16e24a
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D</div><div><br></div>=
<div>LAST CALL FOR PARTICIPATION:</div><div><br></div><div>LOPSTR 2016=C2=
=A0</div><div>26th International Symposium on=C2=A0</div><div>Logic-Based P=
rogram Synthesis and Transformation,</div><div>Edinburgh, Scotland UK, Sept=
ember 6-8, 2016</div><div><a href=3D"http://www.cliplab.org/Conferences/LOP=
STR16/">http://www.cliplab.org/Conferences/LOPSTR16/</a></div><div><br></di=
v><div>co-located with</div><div><br></div><div>PPDP 2016</div><div>18th In=
ternational Symposium on</div><div>Principles and Practice of Declarative P=
rogramming,</div><div>Edinburgh, Scotland UK, September 5-7, 2016</div><div=
><a href=3D"http://ppdp16.webs.upv.es/">http://ppdp16.webs.upv.es/</a></div=
><div><br></div><div>and</div><div><br></div><div>SAS 2016</div><div>23rd S=
tatic Analysis Symposium,</div><div>Edinburgh, Scotland UK, September 8-10,=
 2016</div><div><a href=3D"http://staticanalysis.org/sas2016/">http://stati=
canalysis.org/sas2016/</a></div><div><br></div><div>=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D</div><div><br></div><div>Registration is open at:</div><div><a hr=
ef=3D"http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/">http://confere=
nces.inf.ed.ac.uk/ppdp-lopstr-sas-2016/</a></div><div><br></div><div>=C2=A0=
 ** EARLY REGISTRATION UNTIL AUGUST 15 **</div><div><br></div><div>VISA</di=
v><div><br></div><div>Please check here: <a href=3D"https://www.gov.uk/chec=
k-uk-visa">https://www.gov.uk/check-uk-visa</a> whether you</div><div>requi=
re a visa to visit the UK. If so, contact us as soon as possible</div><div>=
as explained here:</div><div><a href=3D"http://conferences.inf.ed.ac.uk/ppd=
p-lopstr-sas-2016/registration.html">http://conferences.inf.ed.ac.uk/ppdp-l=
opstr-sas-2016/registration.html</a></div><div>Getting a visa can take from=
 3-6 weeks depending on the nationality</div><div>and country from which ap=
plying.</div><div><br></div><div>We recommend that anyone considering atten=
ding who needs a visa</div><div>register now and apply now.=C2=A0 If you ar=
e eventually unable to attend</div><div>due to visa issues we will refund y=
our registration fee.</div><div><br></div><div>INVITED TALKS</div><div><br>=
</div><div>- Greg Morrisett, Cornell University, USA (jointly with PPDP&#39=
;16):=C2=A0</div><div>=C2=A0 Challenges in Compiling Coq.</div><div><br></d=
iv><div>- Francesco Logozzo, Facebook, USA (jointly with PPDP&#39;16):</div=
><div>=C2=A0 Abstract interpretation for taint analysis at scale.</div><div=
><span class=3D"" style=3D"white-space:pre">	</span></div><div>- Martin Vec=
hev, ETH Zurich, Switzerland (jointly with SAS&#39;16):=C2=A0</div><div>=C2=
=A0 Learning from Programs: Probabilistic Models, Program Analysis and Synt=
hesis.=C2=A0</div><div><br></div><div>ACCEPTED PAPERS</div><div><br></div><=
div>- Symbolic Abstract Contract Synthesis in a Rewriting Framework.=C2=A0<=
/div><div>=C2=A0 Mar=C3=ADa Alpuente, Daniel Pardo and Alicia Villanueva. =
=C2=A0</div><div><br></div><div>- Coinductive Soundness of Corecursive Type=
 Class Resolution.</div><div>=C2=A0 Frantisek Farka, Ekaterina Komendantska=
ya, Kevin Hammond and Peng Fu.</div><div><br></div><div>- MiniZinc with Str=
ings.=C2=A0</div><div>=C2=A0 Roberto Amadini, Pierre Flener, Justin Pearson=
, Joseph D. Scott, Peter</div><div>=C2=A0 J. Stuckey and Guido Tack.</div><=
div><br></div><div>- On the Completeness of Selective Unification in Concol=
ic Testing of</div><div>=C2=A0 Logic Programs.</div><div>=C2=A0 Fred Mesnar=
d, Etienne Payet and German Vidal.</div><div><br></div><div>- Verification =
of Time-Aware Business Processes using Constrained Horn Clauses.=C2=A0</div=
><div>=C2=A0 Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alber=
to</div><div>=C2=A0 Pettorossi and Maurizio Proietti.</div><div><br></div><=
div>- Tuning Fuzzy Logic Programs with Symbolic Execution.=C2=A0</div><div>=
=C2=A0 Gines Moreno, Jaime Penabad and German Vidal.</div><div><br></div><d=
iv>- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient</div=
><div>=C2=A0 Generators for Closed Simply-Typed Lambda Terms and Normal For=
ms.=C2=A0</div><div>=C2=A0 Paul Tarau.</div><div><br></div><div>- A New Fun=
ctional-Logic Compiler for Curry: Sprite.=C2=A0</div><div>=C2=A0 Sergio Ant=
oy and Andy Jost.</div><div><br></div><div>- Towards Reversible Computation=
 in Erlang.=C2=A0</div><div>=C2=A0 Naoki Nishida, Adrian Palacios and Germa=
n Vidal.</div><div><br></div><div>- Slicing Concurrent Constraint Programs.=
=C2=A0</div><div>=C2=A0 Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte=
 and Catuscia</div><div>=C2=A0 Palamidessi.</div><div><br></div><div>- Scal=
ing Bounded Model Checking By Transforming Programs With Arrays.=C2=A0</div=
><div>=C2=A0 Anushri Jana, Uday Khedker, Advaita Datar, R Venkatesh and Niy=
as C.</div><div><br></div><div>- Hierarchical Shape Abstraction of Free-Lis=
t Memory Allocators.=C2=A0</div><div>=C2=A0 Bin Fang and Mihaela Sighireanu=
.</div><div><br></div><div>- A Productivity Checker for Logic Programming.=
=C2=A0</div><div>=C2=A0 Ekaterina Komendantskaya, Patricia Johann and Marti=
n M=C3=B6hrmann.</div><div><br></div><div>- Automata Theory Approach to Pre=
dicate Intuitionistic Logic.=C2=A0</div><div>=C2=A0 Maciej Zielenkiewicz an=
d Aleksy Schubert.</div><div><br></div><div>- Nominal Unification of Higher=
 Order Expressions with Recursive Let.=C2=A0</div><div>=C2=A0 Manfred Schmi=
dt-Schauss, Temur Kutsia, Jordi Levy and Mateu Villaret.</div><div><br></di=
v><div>- A Formal, Resource Consumption-Preserving Translation of Actors to=
 Haskell.=C2=A0</div><div>=C2=A0 Elvira Albert, Nikolaos Bezirgiannis, Fran=
k De Boer and Enrique Martin-Martin.</div><div><br></div><div>- Partial Eva=
luation of Order-sorted Equational Programs modulo Axioms.=C2=A0</div><div>=
=C2=A0 Mar=C3=ADa Alpuente, Angel Cuenca, Santiago Escobar and Jose Mesegue=
r.</div><div><br></div><div>- lpopt: A Rule Optimization Tool for Answer Se=
t Programming.=C2=A0</div><div>=C2=A0 Manuel Bichler, Michael Morak and Ste=
fan Woltran.</div><div><br></div><div>- CurryCheck: Checking Properties of =
Curry Programs.=C2=A0</div><div>=C2=A0 Michael Hanus.</div><div><br></div><=
div>- Intuitionistic Logic Programming for SQL.</div><div>=C2=A0 Fernando S=
aenz-Perez.</div><div><br></div><div>Hope to see you in Edinburgh!</div><di=
v><br></div><div>Manuel Hermengildo and=C2=A0</div><div>Pedro Lopez-Garcia<=
/div><div>LOPSTR 2016 Co-chairs =C2=A0=C2=A0</div><div><br></div></div>

--001a11412bdcace329053a16e24a--

--===============2042338669==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
Lprolog mailing list
[email protected]
https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog
--===============2042338669==--