LoAT

MaRDI QIDQ34997swMATHFDO

Official website https://github.com/aprove-developers/LoAT

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

Described by source

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

Cited in

(14)

• Lower-bound synthesis using loop specialization and Max-SMT
• FLATA
• PURRS
• TERMINATOR
• TPDB
• KITTeL
• FAST
• CAMPY
• A calculus for modular loop acceleration
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Lower bounds for runtime complexity of term rewriting
• Automatic complexity analysis of integer programs via triangular weakly non-linear loops
• iRankFinder
• Lower runtime bounds for integer programs

This page was built for software: LoAT