Termination-Portal.org - User contributions [en]

19th International Workshop on Termination

2023-08-14T12:37:46Z

Epayet:

August 24-25, 2023, [https://www.uibk.ac.at/uz-obergurgl/index.html.en University Center Obergurgl], Austria. [https://goo.gl/maps/2Z2ekhg4ftbnLj5o7 (Google Map)]

As part of [http://cl-informatik.uibk.ac.at/events/osr-2023/ Obergurgl Summer on Rewriting 2023] and
co-located with [http://cl-informatik.uibk.ac.at/iwc/2023/ IWC 2023].

==Background==

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 19th International Workshop on Termination (WST 2023) continues
the successful workshops held in
St. Andrews (1993),
La Bresse (1995),
Ede ([http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 1997]),
Dagstuhl ([http://verify.rwth-aachen.de/giesl/WST99.html 1999]),
Utrecht ([http://www.cs.tau.ac.il/~nachumd/wst/index.html 2001]),
Valencia ([http://users.dsic.upv.es/~rdp03/wst/ 2003]),
Aachen ([http://www-i2.informatik.rwth-aachen.de/WST04/ 2004]),
Seattle ([https://www.illc.uva.nl/LogicList/newsitem.php?id=1416 2006]),
Paris ([http://www.lsv.fr/Events/rdp07/wst.html 2007]),
Leipzig ([http://www.imn.htwk-leipzig.de/~waldmann/wst09/cfp/WST09_cfp.pdf 2009]),
Edinburgh ([http://www.floc-conference.org/WST-home.html 2010]),
Obergurgl ([http://cl-informatik.uibk.ac.at/users/georg/events/wst2012/ 2012]),
Bertinoro ([http://www.imn.htwk-leipzig.de/WST2013/ 2013]),
Vienna ([http://easychair.org/smart-program/VSL2014/WST-index.html 2014]),
Obergurgl ([http://cl-informatik.uibk.ac.at/events/wst-2016/ 2016]),
Oxford ([http://wst2018.webs.upv.es/ 2018]),
virtually ([http://costa.fdi.ucm.es/wst2021/ 2021]), and
Haifa ([https://sws.cs.ru.nl/WST2022 2022]).

==Workshop Topics==

The 19th 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):

* termination and complexity analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, probabilistic programs, etc.)
* abstraction methods in termination analysis
* certification of termination and complexity proofs
* challenging termination problems
* comparison and classification of termination methods
* implementation of termination and complexity 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
* well-founded relations and well-quasi-orders

==Termination 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.
In 2023, the Termination Competition will run shortly before WST. Tool/benchmark authors are invited to submit a short tool paper and give a presentation on the workshop.

==Keynote Speaker==

[https://quave.cs.uni-saarland.de/benjamin-kaminski/ Benjamin Kaminski], Saarland U.
Termination of Probabilistic Programs

Abstract
Unlike for ordinary programs, termination of probabilistic programs is more nuanced: A probabilistic program can terminate with probability 1 while still needing infinitely many computation steps in expectation. We will explore the complexity landscape of probabilistic program termination and present proof rules for proving both almost-sure termination (i.e. termination with probability 1) as well as positive almost-sure termination (i.e. termination within finite expected time). Time permitting, we will furthermore dive into open problems on termination of weighted programs – a generalization of probabilistic programs where branches can be associated with more general weights from a semiring.

==Program==

===Thursday 24 August===

'''Session 1''': Keynote & Probabilistic Termination (Chair: Akihisa Yamada)
{|
|-
|style="vertical-align:top;"|14:00
| Benjamin Kaminski:
'''Termination of Probabilistic Programs (invited talk)'''
|-
|style="vertical-align:top;"|15:00
| Jan-Christoph Kassing and Jürgen Giesl:
'''Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting''' [https://doi.org/10.48550/arXiv.2307.10002 (paper)]
|-
|style="vertical-align:top;"|15:30
| coffee break
|}

'''Session 2''': Termination of Term Rewriting (Chair: Johannes Waldmann)
{|
|style="vertical-align:top;"|16:00
| Fabian Mitterwallner, Aart Middeldorp and René Thiemann:
'''Linear Termination over N is Undecidable''' [https://doi.org/10.48550/arXiv.2307.14805 (paper)]
|-
|style="vertical-align:top;"|16:30
| Teppei Saito and Nao Hirokawa:
'''Generalizing Weighted Path Orders''' [https://doi.org/10.48550/arXiv.2307.13973 (paper)]
|-
|style="vertical-align:top;"|17:00
| René Thiemann and Elias Wenninger:
'''A Verified Efficient Implementation of the Weighted Path Order''' [https://doi.org/10.48550/arXiv.2307.14671 (paper)]
|-
|style="vertical-align:top;"|17:30
| Nao Hirokawa and Aart Middeldorp:
'''Hydra Battles and AC Termination, Revisited''' [https://doi.org/10.48550/arXiv.2307.14036 (paper)]
|-
|18:00
|
----
|}

===Friday 25 August===

'''Session 3''': Termination beyond Term Rewriting (Chair: Carsten Fuhs)
{|
|style="vertical-align:top;"|9:00
| Ayuka Matsumi, Naoki Nishida, Misaki Kojima and Donghoon Shin:
'''On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic''' [https://doi.org/10.48550/arXiv.2307.14094 (paper)]
|-
|style="vertical-align:top;"|9:30
| Liye Guo and Cynthia Kop:
'''Higher-Order LCTRSs and Their Termination''' [https://doi.org/10.48550/arXiv.2307.13519 (paper)]
|-
|style="vertical-align:top;"|10:00
| Jera Hensel and Jürgen Giesl:
'''Automated Termination Proofs for C Programs with Lists''' [https://doi.org/10.48550/arXiv.2307.11024 (paper)]
|-
|style="vertical-align:top;"|10:30
| coffee break
|}

'''Session 4''': Non-Termination (Chair: René Thiemann)
{|
|style="vertical-align:top;"|11:00
| Dieter Hofbauer and Johannes Waldmann:
'''Old and New Benchmarks for Relative Termination of String Rewrite Systems''' [https://doi.org/10.48550/arXiv.2307.14149 (paper)]
|-
|style="vertical-align:top;"|11:30
| Florian Frohn and Jürgen Giesl:
'''Proving Non-Termination by Acceleration Driven Clause Learning''' [https://doi.org/10.48550/arXiv.2307.09839 (paper)]
|-
|style="vertical-align:top;"|12:00
| [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet]:
'''Binary Non-Termination in Term Rewriting and Logic Programming''' [https://doi.org/10.48550/arXiv.2307.11549 (paper)]
|-
|style="vertical-align:top;"|12:30
| lunch
|}

'''Session 5''': Complexity Analysis and Probabilistic termCOMP (Chair: Benjamin Kaminski)
{|
|style="vertical-align:top;"|14:00
| Nils Lommen, Eleanore Meyer and Jürgen Giesl:
'''Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops''' [https://doi.org/10.48550/arXiv.2307.10061 (paper)]
|-
|style="vertical-align:top;"|14:30
| Cynthia Kop and Deivid Vale:
'''Complexity Analysis for Call-by-Value Higher-Order Rewriting''' [https://doi.org/10.48550/arXiv.2307.13426 (paper)]
|-
|style="vertical-align:top;"|15:00
| '''0th Probabilistic termCOMP'''
|-
|style="vertical-align:top;"|15:30
| coffee break
|}

'''Session 6''': termCOMP 2023 and business meeting (Chair: Akihisa Yamada)
{|
|style="vertical-align:top;"|16:00
| Nils Lommen, Eleanore Meyer and Jürgen Giesl:
'''KoAT: An Automatic Complexity Analysis Tool for Integer Programs'''
|-
|style="vertical-align:top;"|16:15
| Florian Frohn and Jürgen Giesl:
'''Proving Non-Termination and Lower Runtime Bounds via ADCL with LoAT'''
|-
|style="vertical-align:top;"|16:30
| Jürgen Giesl, Daniel Cloerkes, Stefan Dollase, Florian Frohn, Carsten Fuhs, Jera Hensel, Jan-Christoph Kassing, Nils Lommen and Eleanore Meyer:
'''AProVE 2023'''
|-
|style="vertical-align:top;"|16:45
| Fred Mesnard and [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet]:
'''NTI+cTI: a Logic Programming Termination Analyzer'''
|-
|style="vertical-align:top;"|17:00
| Dieter Hofbauer:
'''MultumNonMulta entering Term Rewriting'''
|-
|style="vertical-align:top;"|17:15
| Akihisa Yamada:
'''Results of the Termination Competition 2023'''
|-
|style="vertical-align:top;"|17:30
| '''business meeting'''
|}

==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
[https://easychair.org/my/conference?conf=wst2023 the submission page].

Please use LaTeX and
[https://www.dagstuhl.de/en/publishing/series/details/LIPIcs the LIPIcs style file]
to prepare your submission.

==Important Dates==

* title and abstract submission: <s>June 1</s>
* paper submission: <s>June 8</s>
* notification: <s>June 15</s>
* final version: <s>July 27</s>
* workshop: August 24-25

==Program Committee==

* [http://www-sop.inria.fr/members/Martin.Avanzini/ Martin Avanzini], INRIA Sophia Antipolis
* [https://ffrohn.github.io/ Florian Frohn], RWTH Aachen
* [https://www.dcs.bbk.ac.uk/~carsten/ Carsten Fuhs], Birkbeck, U. London
* [https://raulgut.github.io/ Raúl Gutiérrez], U. Politécnica de Madrid
* [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet], U. La Réunion
* [https://costa.fdi.ucm.es/~arubio/ Albert Rubio], Complutense U. Madrid
* [http://cl-informatik.uibk.ac.at/users/thiemann/ René Thiemann], U. Innsbruck
* [https://deividrvale.github.io/ Deivid Vale], Radboud U. Nijmegen
* [https://www.imn.htwk-leipzig.de/~waldmann/index.html Johannes Waldmann], HTWK Leipzig
* [https://akihisayamada.github.io/ Akihisa Yamada], AIST Tokyo Waterfront (chair)

19th International Workshop on Termination

2023-08-14T12:36:14Z

Epayet:

August 24-25, 2023, [https://www.uibk.ac.at/uz-obergurgl/index.html.en University Center Obergurgl], Austria. [https://goo.gl/maps/2Z2ekhg4ftbnLj5o7 (Google Map)]

As part of [http://cl-informatik.uibk.ac.at/events/osr-2023/ Obergurgl Summer on Rewriting 2023] and
co-located with [http://cl-informatik.uibk.ac.at/iwc/2023/ IWC 2023].

==Background==

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 19th International Workshop on Termination (WST 2023) continues
the successful workshops held in
St. Andrews (1993),
La Bresse (1995),
Ede ([http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 1997]),
Dagstuhl ([http://verify.rwth-aachen.de/giesl/WST99.html 1999]),
Utrecht ([http://www.cs.tau.ac.il/~nachumd/wst/index.html 2001]),
Valencia ([http://users.dsic.upv.es/~rdp03/wst/ 2003]),
Aachen ([http://www-i2.informatik.rwth-aachen.de/WST04/ 2004]),
Seattle ([https://www.illc.uva.nl/LogicList/newsitem.php?id=1416 2006]),
Paris ([http://www.lsv.fr/Events/rdp07/wst.html 2007]),
Leipzig ([http://www.imn.htwk-leipzig.de/~waldmann/wst09/cfp/WST09_cfp.pdf 2009]),
Edinburgh ([http://www.floc-conference.org/WST-home.html 2010]),
Obergurgl ([http://cl-informatik.uibk.ac.at/users/georg/events/wst2012/ 2012]),
Bertinoro ([http://www.imn.htwk-leipzig.de/WST2013/ 2013]),
Vienna ([http://easychair.org/smart-program/VSL2014/WST-index.html 2014]),
Obergurgl ([http://cl-informatik.uibk.ac.at/events/wst-2016/ 2016]),
Oxford ([http://wst2018.webs.upv.es/ 2018]),
virtually ([http://costa.fdi.ucm.es/wst2021/ 2021]), and
Haifa ([https://sws.cs.ru.nl/WST2022 2022]).

==Workshop Topics==

The 19th 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):

* termination and complexity analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, probabilistic programs, etc.)
* abstraction methods in termination analysis
* certification of termination and complexity proofs
* challenging termination problems
* comparison and classification of termination methods
* implementation of termination and complexity 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
* well-founded relations and well-quasi-orders

==Termination 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.
In 2023, the Termination Competition will run shortly before WST. Tool/benchmark authors are invited to submit a short tool paper and give a presentation on the workshop.

==Keynote Speaker==

[https://quave.cs.uni-saarland.de/benjamin-kaminski/ Benjamin Kaminski], Saarland U.
Termination of Probabilistic Programs

Abstract
Unlike for ordinary programs, termination of probabilistic programs is more nuanced: A probabilistic program can terminate with probability 1 while still needing infinitely many computation steps in expectation. We will explore the complexity landscape of probabilistic program termination and present proof rules for proving both almost-sure termination (i.e. termination with probability 1) as well as positive almost-sure termination (i.e. termination within finite expected time). Time permitting, we will furthermore dive into open problems on termination of weighted programs – a generalization of probabilistic programs where branches can be associated with more general weights from a semiring.

==Program==

===Thursday 24 August===

'''Session 1''': Keynote & Probabilistic Termination (Chair: Akihisa Yamada)
{|
|-
|style="vertical-align:top;"|14:00
| Benjamin Kaminski:
'''Termination of Probabilistic Programs (invited talk)'''
|-
|style="vertical-align:top;"|15:00
| Jan-Christoph Kassing and Jürgen Giesl:
'''Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting''' [https://doi.org/10.48550/arXiv.2307.10002 (paper)]
|-
|style="vertical-align:top;"|15:30
| coffee break
|}

'''Session 2''': Termination of Term Rewriting (Chair: Johannes Waldmann)
{|
|style="vertical-align:top;"|16:00
| Fabian Mitterwallner, Aart Middeldorp and René Thiemann:
'''Linear Termination over N is Undecidable''' [https://doi.org/10.48550/arXiv.2307.14805 (paper)]
|-
|style="vertical-align:top;"|16:30
| Teppei Saito and Nao Hirokawa:
'''Generalizing Weighted Path Orders''' [https://doi.org/10.48550/arXiv.2307.13973 (paper)]
|-
|style="vertical-align:top;"|17:00
| René Thiemann and Elias Wenninger:
'''A Verified Efficient Implementation of the Weighted Path Order''' [https://doi.org/10.48550/arXiv.2307.14671 (paper)]
|-
|style="vertical-align:top;"|17:30
| Nao Hirokawa and Aart Middeldorp:
'''Hydra Battles and AC Termination, Revisited''' [https://doi.org/10.48550/arXiv.2307.14036 (paper)]
|-
|18:00
|
----
|}

===Friday 25 August===

'''Session 3''': Termination beyond Term Rewriting (Chair: Carsten Fuhs)
{|
|style="vertical-align:top;"|9:00
| Ayuka Matsumi, Naoki Nishida, Misaki Kojima and Donghoon Shin:
'''On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic''' [https://doi.org/10.48550/arXiv.2307.14094 (paper)]
|-
|style="vertical-align:top;"|9:30
| Liye Guo and Cynthia Kop:
'''Higher-Order LCTRSs and Their Termination''' [https://doi.org/10.48550/arXiv.2307.13519 (paper)]
|-
|style="vertical-align:top;"|10:00
| Jera Hensel and Jürgen Giesl:
'''Automated Termination Proofs for C Programs with Lists''' [https://doi.org/10.48550/arXiv.2307.11024 (paper)]
|-
|style="vertical-align:top;"|10:30
| coffee break
|}

'''Session 4''': Non-Termination (Chair: René Thiemann)
{|
|style="vertical-align:top;"|11:00
| Dieter Hofbauer and Johannes Waldmann:
'''Old and New Benchmarks for Relative Termination of String Rewrite Systems''' [https://doi.org/10.48550/arXiv.2307.14149 (paper)]
|-
|style="vertical-align:top;"|11:30
| Florian Frohn and Jürgen Giesl:
'''Proving Non-Termination by Acceleration Driven Clause Learning''' [https://doi.org/10.48550/arXiv.2307.09839 (paper)]
|-
|style="vertical-align:top;"|12:00
| [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet]:
'''Binary Non-Termination in Term Rewriting and Logic Programming''' [https://doi.org/10.48550/arXiv.2307.11549 (paper)]
|-
|style="vertical-align:top;"|12:30
| lunch
|}

'''Session 5''': Complexity Analysis and Probabilistic termCOMP (Chair: Benjamin Kaminski)
{|
|style="vertical-align:top;"|14:00
| Nils Lommen, Eleanore Meyer and Jürgen Giesl:
'''Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops''' [https://doi.org/10.48550/arXiv.2307.10061 (paper)]
|-
|style="vertical-align:top;"|14:30
| Cynthia Kop and Deivid Vale:
'''Complexity Analysis for Call-by-Value Higher-Order Rewriting''' [https://doi.org/10.48550/arXiv.2307.13426 (paper)]
|-
|style="vertical-align:top;"|15:00
| '''0th Probabilistic termCOMP'''
|-
|style="vertical-align:top;"|15:30
| coffee break
|}

'''Session 6''': termCOMP 2023 and business meeting (Chair: Akihisa Yamada)
{|
|style="vertical-align:top;"|16:00
| Nils Lommen, Eleanore Meyer and Jürgen Giesl:
'''KoAT: An Automatic Complexity Analysis Tool for Integer Programs'''
|-
|style="vertical-align:top;"|16:15
| Florian Frohn and Jürgen Giesl:
'''Proving Non-Termination and Lower Runtime Bounds via ADCL with LoAT'''
|-
|style="vertical-align:top;"|16:30
| Jürgen Giesl, Daniel Cloerkes, Stefan Dollase, Florian Frohn, Carsten Fuhs, Jera Hensel, Jan-Christoph Kassing, Nils Lommen and Eleanore Meyer:
'''AProVE 2023'''
|-
|style="vertical-align:top;"|16:45
| Fred Mesnard and Etienne Payet:
'''NTI+cTI: a Logic Programming Termination Analyzer'''
|-
|style="vertical-align:top;"|17:00
| Dieter Hofbauer:
'''MultumNonMulta entering Term Rewriting'''
|-
|style="vertical-align:top;"|17:15
| Akihisa Yamada:
'''Results of the Termination Competition 2023'''
|-
|style="vertical-align:top;"|17:30
| '''business meeting'''
|}

==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
[https://easychair.org/my/conference?conf=wst2023 the submission page].

Please use LaTeX and
[https://www.dagstuhl.de/en/publishing/series/details/LIPIcs the LIPIcs style file]
to prepare your submission.

==Important Dates==

* title and abstract submission: <s>June 1</s>
* paper submission: <s>June 8</s>
* notification: <s>June 15</s>
* final version: <s>July 27</s>
* workshop: August 24-25

==Program Committee==

* [http://www-sop.inria.fr/members/Martin.Avanzini/ Martin Avanzini], INRIA Sophia Antipolis
* [https://ffrohn.github.io/ Florian Frohn], RWTH Aachen
* [https://www.dcs.bbk.ac.uk/~carsten/ Carsten Fuhs], Birkbeck, U. London
* [https://raulgut.github.io/ Raúl Gutiérrez], U. Politécnica de Madrid
* [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet], U. La Réunion
* [https://costa.fdi.ucm.es/~arubio/ Albert Rubio], Complutense U. Madrid
* [http://cl-informatik.uibk.ac.at/users/thiemann/ René Thiemann], U. Innsbruck
* [https://deividrvale.github.io/ Deivid Vale], Radboud U. Nijmegen
* [https://www.imn.htwk-leipzig.de/~waldmann/index.html Johannes Waldmann], HTWK Leipzig
* [https://akihisayamada.github.io/ Akihisa Yamada], AIST Tokyo Waterfront (chair)

Logic Programming

2020-11-19T04:56:27Z

Epayet:

This page is to record the current status of discussion
on cleaning up the Logic Programming Category of the Termination Competition.

(Discussion should take place on the termtools mailing list.)

== Syntax/Semantics for Input/Output ==

The set of queries, for which termination should be analyzed, is
given by a comment of the form "%query: <predicate>(<arguments>).".
Here, <predicate> is the root symbol of all queries to analyze
while <arguments> is a comma-separated list of argument indicators
which specify whether the argument at the particular position must
be a ground term or can be an arbitrary term. There are three pairs
of argument indicators in use (historically grown) where the first
indicator specifies ground arguments and the second specifies
arbitrary arguments: i and o (for input and output), b and f (for
bound and free), and g and a (for ground and any).
Example:

%query: p(i,o).

This means all queries :- p(s,t). where s is a ground term
and t can be any term.
If the root symbol has no arguments, the parantheses are omitted.
Example:

%query: p.

== Problematic Examples ==

The following examples are empty:
* LP/talp/apt/dc_mod.pl
* LP/talp/apt/gt_mod.pl

The following examples contain non-trivial built-in predicates that are potentially
handled in very different ways by the individual tools (leading to potentially
different termination status):
* LP/lpexamples/factorial.pl
* LP/lpexamples/fib-oi.pl
* LP/lpexamples/fib.pl
* LP/lpexamples/hanoi.pl
* LP/lpexamples/kay4.pl
* LP/lpexamples/numbervars.pl
* LP/lpexamples/primes.pl
* LP/lpexamples/tautology.pl
* LP/lpexamples/totient.pl
* LP/talp/apt/curry_ap.pl
* LP/talp/apt/dc_mod.pl
* LP/talp/apt/dc_schema.pl
* LP/talp/apt/gt_mod.pl
* LP/talp/apt/gtsolve.pl
* LP/talp/apt/mergesort_ap_variant.pl
* LP/talp/maria/aiakl.pl
* LP/talp/maria/ann.pl
* LP/talp/maria/bid.pl
* LP/talp/maria/boyer.pl
* LP/talp/maria/browse.pl
* LP/talp/maria/deriv-oii.pl
* LP/talp/maria/deriv.pl
* LP/talp/maria/fib.pl
* LP/talp/maria/grammar.pl
* LP/talp/maria/grammar2.pl
* LP/talp/maria/hanoiapp.pl
* LP/talp/maria/mmatrix.pl
* LP/talp/maria/money.pl
* LP/talp/maria/occur.pl
* LP/talp/maria/peephole.pl
* LP/talp/maria/progeom.pl
* LP/talp/maria/qplan.pl
* LP/talp/maria/qsortapp.pl
* LP/talp/maria/query.pl
* LP/talp/maria/rdtok.pl
* LP/talp/maria/read.pl
* LP/talp/maria/serialize.pl
* LP/talp/maria/tak.pl
* LP/talp/maria/tictactoe.pl
* LP/talp/maria/warplan.pl
* LP/talp/taboch/permute2.pl
* LP/talp/taboch/queens.pl
* LP/terminweb/old-terminweb/mergesort.pl
* LP/terminweb/old-terminweb/queens.pl
* LP/terminweb/old-terminweb/quicksort.pl

== Questions ==

* should empty examples be removed?
* how to handle built-ins that the tool does not support?
* do we want to have a (sub-)category "pure logic programs"?

== Unification with or without Occurs Check ==

Currently, there are some examples in the LP-Prolog category where
termination depends on whether unification is performed with or
without the occurs check. Following the treatment of overflows in
the Java categories, in such cases both YES and NO answers (with
consistent proofs) are valid.

== Participants ==

The following is a list of participants to this category
* [[Tools:AProVE]]
* [[Tools:NTI]]

[[Category:Categories]]

Tools:NTI

2017-08-20T12:51:06Z

Epayet: Created page with " <!-- Please fill in the data so that your tool can be added to some default categories and a simple tool page can be created. You may extend that tool pa..."

{{Tool
|shortname=NTI
|longname=Non-Termination Inference
|homepage=http://lim.univ-reunion.fr/staff/epayet/Research/NTI/NTI.html
|country=France
|university=University of Reunion
|developers=Etienne Payet
|publication=
}}

People:Etienne Payet

2017-08-20T12:41:02Z

Epayet: Created page with " <!-- Please fill in the data so that you can be added to some default categories and a simple user page can be created. You may extend that user page you..."

{{Person
|firstname=Etienne
|middlenames=
|lastname=Payet
|titles=
|email=etienne.payet@univ-reunion.fr
|homepage=http://lim.univ-reunion.fr/staff/epayet/
|country=France
|university=University of Reunion
|department=Department of Computer Science
|role= Professor 
}}