LoAT

swMATH23213MaRDI QIDQ34997

No author found.

Source code repository: https://github.com/aprove-developers/LoAT

Described by source

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

Related Items (6)

Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ A Calculus for Modular Loop Acceleration ⋮ Lower-bound synthesis using loop specialization and Max-SMT ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Lower Runtime Bounds for Integer Programs ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops

This page was built for software: LoAT