Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)

DOI10.1007/978-3-031-10769-6_41OpenAlexW4289104025MaRDI QIDQ2104557

Jürgen Giesl, Florian Frohn

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_41

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

LoAT

Uses Software

• FLATA
• PURRS
• StarExec
• TPDB
• GitHub
• iRankFinder

Cites Work

• Under-approximating loops in C programs for fast counterexample detection
• Lower-bound synthesis using loop specialization and Max-SMT
• Lower Runtime Bounds for Integer Programs
• Fast Acceleration of Ultimately Periodic Relations
• Iterating Octagons
• A Calculus for Modular Loop Acceleration

This page was built for publication: Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)