Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
type: Item
instance of: scholarly article
title: Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
DOI: 10.1007/978-3-031-10769-6_41
author: Florian Frohn
author: Jürgen Giesl
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7628217
describes a project that uses: TPDB
describes a project that uses: StarExec
describes a project that uses: FLATA
describes a project that uses: iRankFinder
describes a project that uses: PURRS
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-031-10769-6 41
OpenAlex ID: W4289104025
cites work: Lower-bound synthesis using loop specialization and Max-SMT
cites work: Iterating Octagons
cites work: Fast Acceleration of Ultimately Periodic Relations
cites work: Lower Runtime Bounds for Integer Programs
cites work: A Calculus for Modular Loop Acceleration
cites work: Under-approximating loops in C programs for fast counterexample detection
Recommended article: An LTL Proof System for Runtime Verification
Recommended article: Proving Non-looping Non-termination Automatically
Recommended article: Proving Termination of Rewrite Systems Using Bounds
Recommended article: Verification of a class of loop programs without using loop invariants
Recommended article: Q3804237
Recommended article: Termination proofs for ground rewrite systems -- interpretations and derivational complexity
Recommended article: Verification and falsification of programs with loops using predicate abstraction
Recommended article: Loop-free verification of termination of derivation for a fragment of dynamic logic
description: scientific article; zbMATH DE number 7628217