WST 2021 - 1st Call for Papers

--===============8221717519582557554==
Content-Type: multipart/alternative; boundary="0000000000002866ad05b7fbd5fd"

--0000000000002866ad05b7fbd5fd
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
     WST 2021 - Call for Papers
     17th International Workshop on Termination
  http://costa.fdi.ucm.es/wst2021

    July 16, 2021, Pittsburgh, PA, United States
      Co-located with CADE-28
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=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.


IMPORTANT DATES:

  * submission deadline:  April 18, 2021
  * notification:         May 23, 2021
  * final version due:    June 13, 2021
  * workshop:             July 16, 2021


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


SUBMISSION GUIDELINES:

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=3Dwst2021

Please, use LaTeX and the LIPIcs style file

     http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz

to prepare your submission.


PROGRAM COMMITTEE:

  * Martin Avanzini - INRIA Sophia, Antipolis
  * 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

--0000000000002866ad05b7fbd5fd
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div dir=3D"ltr"><div><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</font></div><div><font =
face=3D"monospace"><span style=3D"white-space:pre-wrap">		</span> =C2=A0 =
=C2=A0 =C2=A0WST 2021 - Call for Papers</font></div><div><font face=3D"mono=
space"><span style=3D"white-space:pre-wrap">	</span> =C2=A0 =C2=A0 =C2=A017=
th International Workshop on Termination</font></div><div><font face=3D"mon=
ospace"><span style=3D"white-space:pre-wrap">		</span> =C2=A0 <a href=3D"ht=
tp://costa.fdi.ucm.es/wst2021" target=3D"_blank">http://costa.fdi.ucm.es/ws=
t2021</a></font></div><div><font face=3D"monospace"><br></font></div><div><=
font face=3D"monospace"><span style=3D"white-space:pre-wrap">	</span> =C2=
=A0 =C2=A0 July 16, 2021, Pittsburgh, PA, United States</font></div><div><f=
ont face=3D"monospace"><span style=3D"white-space:pre-wrap">		</span> =C2=
=A0 =C2=A0 =C2=A0 Co-located with CADE-28</font></div><div><font face=3D"mo=
nospace">=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D</font=
></div><div><font face=3D"monospace"><br></font></div><div><font face=3D"mo=
nospace">The Workshop on Termination (WST) traditionally brings together, i=
n an</font></div><div><font face=3D"monospace">informal =C2=A0 setting, =C2=
=A0researchers =C2=A0 interested =C2=A0 in =C2=A0 all =C2=A0aspects =C2=A0 =
of</font></div><div><font face=3D"monospace">termination, =C2=A0whether =C2=
=A0this =C2=A0interest =C2=A0be =C2=A0practical =C2=A0or =C2=A0theoretical,=
</font></div><div><font face=3D"monospace">primary =C2=A0or =C2=A0derived. =
=C2=A0 The =C2=A0workshop =C2=A0 also =C2=A0provides =C2=A0a =C2=A0ground =
=C2=A0for</font></div><div><font face=3D"monospace">cross-fertilization of =
ideas from the different communities interested</font></div><div><font face=
=3D"monospace">in termination (e.g., working on computational mechanisms, p=
rogramming</font></div><div><font face=3D"monospace">languages, =C2=A0softw=
are =C2=A0engineering, =C2=A0 constraint =C2=A0solving, =C2=A0etc.).=C2=A0 =
The</font></div><div><font face=3D"monospace">friendly =C2=A0atmosphere =C2=
=A0enables =C2=A0fruitful =C2=A0exchanges =C2=A0leading =C2=A0to =C2=A0join=
t</font></div><div><font face=3D"monospace">research and subsequent publica=
tions.</font></div><div><font face=3D"monospace"><br></font></div><div><fon=
t face=3D"monospace"><br></font></div><div><font face=3D"monospace">IMPORTA=
NT DATES:</font></div><div><font face=3D"monospace"><br></font></div><div><=
font face=3D"monospace">=C2=A0 * submission deadline: =C2=A0April 18, 2021<=
/font></div><div><font face=3D"monospace">=C2=A0 * notification: =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 May 23, 2021</font></div><div><font face=3D"monospace">=
=C2=A0 * final version due: =C2=A0 =C2=A0June 13, 2021</font></div><div><fo=
nt face=3D"monospace">=C2=A0 * workshop: =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0=
 =C2=A0 July 16, 2021</font></div><div><font face=3D"monospace"><br></font>=
</div><div><font face=3D"monospace"><br></font></div><div><font face=3D"mon=
ospace">TOPICS:</font></div><div><font face=3D"monospace"><br></font></div>=
<div><font face=3D"monospace">The 17th International Workshop =C2=A0on Term=
ination welcomes contributions</font></div><div><font face=3D"monospace">on=
 =C2=A0all aspects =C2=A0of termination.=C2=A0 In particular, =C2=A0papers =
investigating</font></div><div><font face=3D"monospace">applications =C2=A0=
of =C2=A0termination =C2=A0(for example =C2=A0in =C2=A0complexity =C2=A0ana=
lysis,</font></div><div><font face=3D"monospace">program =C2=A0 analysis =
=C2=A0and =C2=A0 transformation, =C2=A0theorem =C2=A0 proving, =C2=A0progra=
m</font></div><div><font face=3D"monospace">correctness, modeling computati=
onal systems, etc.) =C2=A0are very welcome.</font></div><div><font face=3D"=
monospace"><br></font></div><div><font face=3D"monospace">Topics of interes=
t include (but are not limited to):</font></div><div><font face=3D"monospac=
e"><br></font></div><div><font face=3D"monospace">=C2=A0 * abstraction meth=
ods in termination analysis</font></div><div><font face=3D"monospace">=C2=
=A0 * certification of termination and complexity proofs</font></div><div><=
font face=3D"monospace">=C2=A0 * challenging termination problems</font></d=
iv><div><font face=3D"monospace">=C2=A0 * comparison and classification of =
termination methods</font></div><div><font face=3D"monospace">=C2=A0 * comp=
lexity analysis in any domain</font></div><div><font face=3D"monospace">=C2=
=A0 * implementation of termination methods</font></div><div><font face=3D"=
monospace">=C2=A0 * non-termination analysis and loop detection</font></div=
><div><font face=3D"monospace">=C2=A0 * normalization and infinitary normal=
ization</font></div><div><font face=3D"monospace">=C2=A0 * operational term=
ination of logic-based systems</font></div><div><font face=3D"monospace">=
=C2=A0 * ordinal notation and subrecursive hierarchies</font></div><div><fo=
nt face=3D"monospace">=C2=A0 * SAT, SMT, and constraint solving for (non-)t=
ermination analysis</font></div><div><font face=3D"monospace">=C2=A0 * scal=
ability and modularity of termination methods</font></div><div><font face=
=3D"monospace">=C2=A0 * termination analysis in any domain (lambda calculus=
, declarative</font></div><div><font face=3D"monospace">=C2=A0 =C2=A0 progr=
amming, rewriting, transition systems, etc.)</font></div><div><font face=3D=
"monospace">=C2=A0 * well-founded relations and well-quasi-orders</font></d=
iv><div><font face=3D"monospace"><br></font></div><div><font face=3D"monosp=
ace"><br></font></div><div><font face=3D"monospace">SUBMISSION GUIDELINES:<=
/font></div><div><font face=3D"monospace"><br></font></div><div><font face=
=3D"monospace">Submissions =C2=A0are =C2=A0short =C2=A0papers/extended abst=
racts =C2=A0which =C2=A0should =C2=A0not</font></div><div><font face=3D"mon=
ospace">exceed 5 pages.=C2=A0 There will be no formal reviewing.=C2=A0 In p=
articular, we</font></div><div><font face=3D"monospace">welcome =C2=A0short=
 =C2=A0versions of =C2=A0recently =C2=A0published =C2=A0articles and =C2=A0=
papers</font></div><div><font face=3D"monospace">submitted =C2=A0elsewhere.=
=C2=A0 The =C2=A0program =C2=A0committee =C2=A0checks =C2=A0relevance =C2=
=A0and</font></div><div><font face=3D"monospace">provides additional feedba=
ck for =C2=A0each submission. The accepted papers</font></div><div><font fa=
ce=3D"monospace">will be made available electronically before the workshop.=
</font></div><div><font face=3D"monospace"><br></font></div><div><font face=
=3D"monospace">Papers should be submitted electronically via the submission=
 page:</font></div><div><font face=3D"monospace"><br></font></div><div><fon=
t face=3D"monospace">=C2=A0 =C2=A0 =C2=A0<a href=3D"https://easychair.org/c=
onferences/?conf=3Dwst2021" target=3D"_blank">https://easychair.org/confere=
nces/?conf=3Dwst2021</a></font></div><div><font face=3D"monospace"><br></fo=
nt></div><div><font face=3D"monospace">Please, use LaTeX and the LIPIcs sty=
le file</font></div><div><font face=3D"monospace"><br></font></div><div><fo=
nt face=3D"monospace">=C2=A0 =C2=A0 =C2=A0<a href=3D"http://drops.dagstuhl.=
de/styles/lipics/lipics-authors.tgz" target=3D"_blank">http://drops.dagstuh=
l.de/styles/lipics/lipics-authors.tgz</a></font></div><div><font face=3D"mo=
nospace"><br></font></div><div><font face=3D"monospace">to prepare your sub=
mission.</font></div><div><font face=3D"monospace"><br></font></div><div><f=
ont face=3D"monospace"><br></font></div><div><font face=3D"monospace">PROGR=
AM COMMITTEE:</font></div><div><font face=3D"monospace"><br></font></div><d=
iv><font face=3D"monospace">=C2=A0 * Martin Avanzini - INRIA Sophia, Antipo=
lis</font></div><div><font face=3D"monospace">=C2=A0 * Carsten Fuhs - Birkb=
eck, U. of London</font></div><div><font face=3D"monospace">=C2=A0 * Samir =
Genaim (chair) - U. Complutense de Madrid</font></div><div><font face=3D"mo=
nospace">=C2=A0 * J=C3=BCrgen Giesl - RWTH Aachen</font></div><div><font fa=
ce=3D"monospace">=C2=A0 * Matthias Heizmann - U. of Freiburg</font></div><d=
iv><font face=3D"monospace">=C2=A0 * Cynthia Kop - Radboud U. Nijmegen</fon=
t></div><div><font face=3D"monospace">=C2=A0 * Salvador Lucas - U. Polit=C3=
=A8cnica de Val=C3=A8ncia</font></div><div><font face=3D"monospace">=C2=A0 =
* =C3=89tienne Payet - U. de La R=C3=A9union</font></div><div><font face=3D=
"monospace">=C2=A0 * Albert Rubio - =C2=A0U. Complutense de Madrid</font></=
div><div><font face=3D"monospace">=C2=A0 * Ren=C3=A9 Thiemann - U. of Innsb=
ruck</font></div><div><font face=3D"monospace">=C2=A0 * Johannes Waldmann -=
 HTWK Leipzig</font></div><div><font face=3D"monospace"><br></font></div><d=
iv><br></div></div></div>

--0000000000002866ad05b7fbd5fd--


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


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

_______________________________________________
hol-info mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/hol-info

--===============8221717519582557554==--