The Termination and Complexity Competition

Giesl, Jürgen; Rubio, Albert; Sternagel, Christian; Waldmann, Johannes; Yamada, Akihisa

doi:10.1007/978-3-030-17502-3_10

Cited by 45 publications

(32 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It supports the SMT-LIB input format [8] and the native formats of the tools KoAT [10] and T2 [11]. We evaluated it on the benchmark suite from the Termination and Complexity Competition (TermComp [23]) consisting of 1222 programs (TPDB [38], category Termination of Integer Transition Systems). All experiments were executed on StarExec [37] with a timeout of 60 seconds per example.…”

Section: Methodsmentioning

confidence: 99%

Proving Non-Termination via Loop Acceleration

Frohn

Giesl

2019

2019 Formal Methods in Computer Aided Design (FMCAD)

View full text Add to dashboard Cite

We present the first approach to prove non-termination of integer programs that is based on loop acceleration. If our technique cannot show non-termination of a loop, it tries to accelerate it instead in order to find paths to other non-terminating loops automatically. The prerequisites for our novel loop acceleration technique generalize a simple yet effective non-termination criterion. Thus, we can use the same program transformations to facilitate both non-termination proving and loop acceleration. In particular, we present a novel invariant inference technique that is tailored to our approach. An extensive evaluation of our fully automated tool LoAT shows that it is competitive with the state of the art.

show abstract

Section: Methodsmentioning

confidence: 99%

Proving Non-Termination via Loop Acceleration

Frohn

Giesl

2019

2019 Formal Methods in Computer Aided Design (FMCAD)

View full text Add to dashboard Cite

show abstract

“…To evaluate our approach, we extracted 1511 loops with conjunctive guards from the category Termination of Integer Transition Systems of the Termination Problems Database [34], the benchmark collection which is used at the annual Termination and Complexity Competition [18], as follows:…”

Section: Implementation and Experimentsmentioning

confidence: 99%

A Calculus for Modular Loop Acceleration

Frohn

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)termination of programs operating on integers. To this end, a variety of acceleration techniques has been proposed. However, all of them are monolithic: Either they accelerate a loop successfully or they fail completely. In contrast, we present a calculus that allows for combining acceleration techniques in a modular way and we show how to integrate many existing acceleration techniques into our calculus. Moreover, we propose two novel acceleration techniques that can be incorporated into our calculus seamlessly. An empirical evaluation demonstrates the applicability of our approach.⋆ This work has been funded by DFG grant 389792660 as part of TRR 248 (see https://perspicuous-computing.science).

show abstract

“…The goal of these methods is generally to increase the class of systems that can be automatically judged terminating (or proven nonterminating), and reduce the time needed to do so. There is an annual Termination Competition aimed at stimulating such improvements [Giesl et al 2019]. These methods have some drawbacks that would hinder their use for strong FP:…”

Section: Other Related Workmentioning

confidence: 99%

Strong functional pearl: Harper’s regular-expression matcher in Cedille

Stump

Jenkins

Spahn

et al. 2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

This paper describes an implementation of Harper's continuation-based regular-expression matcher as a strong functional program in Cedille; i.e., Cedille statically confirms termination of the program on all inputs. The approach uses neither dependent types nor termination proofs. Instead, a particular interface dubbed a recursion universe is provided by Cedille, and the language ensures that all programs written against this interface terminate. Standard polymorphic typing is all that is needed to check the code against the interface. This answers a challenge posed by Bove, Krauss, and Sozeau. CCS Concepts: • Software and its engineering → Functional languages; Recursion; • Theory of computation → Regular languages.

show abstract

The Termination and Complexity Competition

Cited by 45 publications

References 45 publications

Proving Non-Termination via Loop Acceleration

Proving Non-Termination via Loop Acceleration

A Calculus for Modular Loop Acceleration

Strong functional pearl: Harper’s regular-expression matcher in Cedille

Contact Info

Product

Resources

About