WST 2020 Call for Papers
Samir Genaim <[email protected]> Wed, 1 Jan 2020 10:30:27 +0100
| Newsgroups | gmane.comp.lang.ml.mlton.user |
|---|---|
| Message-ID | <CABUq9nUVj-F5gizentiFX6qs-Eh9748AcHKd-63MQbthMCYiZg__23991.6462612868$1577891542$gmane$org@mail.gmail.com> |
--===============5400253438145238924==
Content-Type: multipart/alternative; boundary="0000000000003b87a1059b10bc2c"
--0000000000003b87a1059b10bc2c
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=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
WST 2020 - Call for Papers
17th International Workshop on Termination
http://costa.fdi.ucm.es/wst2020
July 4-5, 2020, Paris, France
co-located with IJCAR and FSCD 2020.
=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=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
The Workshop on Termination (WST) traditionally brings together, in an
informal setting, researchers interested in all aspects of termination,
whether this interest be practical or theoretical, primary or derived.
The workshop also provides a ground for cross-fertilization of ideas from
the different communities interested in termination (e.g., working on
computational mechanisms, programming languages, software engineering,
constraint solving, etc.). The friendly atmosphere enables fruitful
exchanges leading to joint research and subsequent publications.
The workshop is co-located with IJCAR and FSCD 2020.
https://ijcar2020.org/ https://fscd2020.org/
IMPORTANT DATES:
* submission deadline: April 12, 2020
* notification: May 10, 2020
* final version due: May 31, 2020
* workshop: July 4-5, 2020
TOPICS: The 17th International Workshop on Termination welcomes
contributions on all aspects of termination. In particular, papers
investigating applications of termination (for example in complexity
analysis, program analysis and transformation, theorem proving, program
correctness, modeling computational systems, etc.) are very welcome.
Topics of interest include (but are not limited to):
* abstraction methods in termination analysis
* certification of termination and complexity proofs
* challenging termination problems
* comparison and classification of termination methods
* complexity analysis in any domain
* implementation of termination methods
* non-termination analysis and loop detection
* normalization and infinitary normalization
* operational termination of logic-based systems
* ordinal notation and subrecursive hierarchies
* SAT, SMT, and constraint solving for (non-)termination analysis
* scalability and modularity of termination methods
* termination analysis in any domain (lambda calculus, declarative
programming, rewriting, transition systems, etc.)
* well-founded relations and well-quasi-orders
COMPETITION: Since 2003, the catalytic effect of WST to stimulate
new research on termination has been enhanced by the celebration
of the Termination Competition and its continuously developing
problem databases containing thousands of programs as challenges
for termination analysis in different categories, see
http://termination-portal.org/wiki/Termination_Competition
In 2020, the Termination Competition will run shortly before WST and
the main venues (IJCAR-FSCD), and the results will be presented at
IJCAR or FSCD.
PROGRAM COMMITTEE:
Martin Avanzini - INRIA Sophia, Antipolis
Florian Frohn - Max-Planck-Institut f=C3=BCr Informatik, Saarbr=C3=BCcken
Carsten Fuhs - Birkbeck, U. of London
Samir Genaim (chair) - U. Complutense de Madrid
J=C3=BCrgen Giesl - RWTH Aachen
Matthias Heizmann - U. of Freiburg
Cynthia Kop - Radboud U. Nijmegen
Salvador Lucas - U. Polit=C3=A8cnica de Val=C3=A8ncia
=C3=89tienne Payet - U. de La R=C3=A9union
Albert Rubio - U. Complutense de Madrid
Ren=C3=A9 Thiemann - U. of Innsbruck
Johannes Waldmann - HTWK Leipzig
INVITED SPEAKERS:
tba
SUBMISSION: Submissions are short papers/extended abstracts which
should not exceed 5 pages. There will be no formal reviewing. In
particular, we welcome short versions of recently published articles
and papers submitted elsewhere. The program committee checks relevance
and provides additional feedback for each submission. The accepted
papers will be made available electronically before the workshop.
Papers should be submitted electronically via the submission page:
https://easychair.org/conferences/?conf=3Dwst2020
Please, use LaTeX and the LIPIcs style file
http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz
to prepare your submission.
--=20
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to [email protected].
--0000000000003b87a1059b10bc2c
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr"><font face=3D"monospace">=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=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0WST 2020 =
- Call for Papers<br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 17th International Workshop on Termination<br>=C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 <=
a href=3D"http://costa.fdi.ucm.es/wst2020" target=3D"_blank">http://costa.f=
di.ucm.es/wst2020</a><br><br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0July 4-5, 2020, Paris, France<=
br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 co-located with IJCAR and FSCD 2020.<br>=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=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<br><br>The Workshop on Termin=
ation (WST) traditionally brings together, in an<br>informal setting, resea=
rchers interested in all aspects of termination,<br>whether this interest b=
e practical or theoretical, primary or derived.<br>The workshop also provid=
es a ground for cross-fertilization of ideas from<br>the different communit=
ies interested in termination (e.g., working on<br>computational mechanisms=
, programming languages, software engineering,<br>constraint solving, etc.)=
. The friendly atmosphere enables fruitful<br>exchanges leading to joint re=
search and subsequent publications.<br><br>The workshop is co-located with =
IJCAR and FSCD 2020.<br><br>=C2=A0 =C2=A0 <a href=3D"https://ijcar2020.org/=
" target=3D"_blank">https://ijcar2020.org/</a> =C2=A0<a href=3D"https://fsc=
d2020.org/" target=3D"_blank">https://fscd2020.org/</a><br><br>IMPORTANT DA=
TES:<br><br>=C2=A0 * submission deadline: =C2=A0April 12, 2020<br>=C2=A0 * =
notification: =C2=A0 =C2=A0 =C2=A0 =C2=A0 May 10, 2020<br>=C2=A0 * final ve=
rsion due: =C2=A0 =C2=A0May 31, 2020<br>=C2=A0 * workshop: =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 July 4-5, 2020<br><br>TOPICS: The 17th Internat=
ional Workshop on Termination welcomes<br>contributions on all aspects of t=
ermination. In particular, papers<br>investigating applications of terminat=
ion (for example in complexity<br>analysis, program analysis and transforma=
tion, theorem proving, program<br>correctness, modeling computational syste=
ms, etc.) are very welcome.<br><br>Topics of interest include (but are not =
limited to):<br><br>=C2=A0 * abstraction methods in termination analysis<br=
>=C2=A0 * certification of termination and complexity proofs<br>=C2=A0 * ch=
allenging termination problems<br>=C2=A0 * comparison and classification of=
termination methods<br>=C2=A0 * complexity analysis in any domain<br>=C2=
=A0 * implementation of termination methods<br>=C2=A0 * non-termination ana=
lysis and loop detection<br>=C2=A0 * normalization and infinitary normaliza=
tion<br>=C2=A0 * operational termination of logic-based systems<br>=C2=A0 *=
ordinal notation and subrecursive hierarchies<br>=C2=A0 * SAT, SMT, and co=
nstraint solving for (non-)termination analysis<br>=C2=A0 * scalability and=
modularity of termination methods<br>=C2=A0 * termination analysis in any =
domain (lambda calculus, declarative<br>=C2=A0 =C2=A0 programming, rewritin=
g, transition systems, etc.)<br>=C2=A0 * well-founded relations and well-qu=
asi-orders<br><br>COMPETITION: Since 2003, the catalytic effect of WST to s=
timulate<br>new research on termination has been enhanced by the celebratio=
n<br>of the Termination Competition and its continuously developing<br>prob=
lem databases containing thousands of programs as challenges<br>for termina=
tion analysis in different categories, see<br><br>=C2=A0 =C2=A0 <a href=3D"=
http://termination-portal.org/wiki/Termination_Competition" target=3D"_blan=
k">http://termination-portal.org/wiki/Termination_Competition</a><br><br>In=
2020, the Termination Competition will run shortly before WST and<br>the m=
ain venues (IJCAR-FSCD), and the results will be presented at<br>IJCAR or F=
SCD.<br><br><br>PROGRAM COMMITTEE:<br><br> Martin Avanzini - INRIA Sophia, =
Antipolis<br> Florian Frohn - Max-Planck-Institut f=C3=BCr Informatik, Saar=
br=C3=BCcken<br> Carsten Fuhs - Birkbeck, U. of London<br> Samir Genaim (ch=
air) - U. Complutense de Madrid<br> J=C3=BCrgen Giesl - RWTH Aachen<br> Mat=
thias Heizmann - U. of Freiburg<br> Cynthia Kop - Radboud U. Nijmegen<br> S=
alvador Lucas - U. Polit=C3=A8cnica de Val=C3=A8ncia<br> =C3=89tienne Payet=
- U. de La R=C3=A9union<br> Albert Rubio - =C2=A0U. Complutense de Madrid<=
br> Ren=C3=A9 Thiemann - U. of Innsbruck<br> Johannes Waldmann - HTWK Leipz=
ig<br><br>INVITED SPEAKERS:<br>=C2=A0 =C2=A0 =C2=A0tba<br><br>SUBMISSION: S=
ubmissions are short papers/extended abstracts which<br>should not exceed 5=
pages. There will be no formal reviewing. In<br>particular, we welcome sho=
rt versions of recently published articles<br>and papers submitted elsewher=
e. The program committee checks relevance<br>and provides additional feedba=
ck for each submission. The accepted<br>papers will be made available elect=
ronically before the workshop.<br><br>Papers should be submitted electronic=
ally via the submission page:<br><br>=C2=A0 =C2=A0 =C2=A0<a href=3D"https:/=
/easychair.org/conferences/?conf=3Dwst2020" target=3D"_blank">https://easyc=
hair.org/conferences/?conf=3Dwst2020</a><br><br>Please, use LaTeX and the L=
IPIcs style file<br><br>=C2=A0 =C2=A0 =C2=A0<a href=3D"http://drops.dagstuh=
l.de/styles/lipics/lipics-authors.tgz" target=3D"_blank">http://drops.dagst=
uhl.de/styles/lipics/lipics-authors.tgz</a><br><br>to prepare your submissi=
on.</font><br></div>
<p></p>
-- <br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:[email protected]">mlton-user+unsu=
[email protected]</a>.<br />
--0000000000003b87a1059b10bc2c--
--===============5400253438145238924==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
--===============5400253438145238924==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
_______________________________________________
MLton-user mailing list
[email protected]; [email protected]
https://lists.sourceforge.net/lists/listinfo/mlton-user
--===============5400253438145238924==--