KoAT

MaRDI QIDQ55527swMATHFDO

Official website https://aprove-developers.github.io/ExpectedUpperBounds/

Source code repository https://github.com/aprove-developers/KoAT2-Releases/tree/probabilistic

Described by source

• Inferring expected runtimes of probabilistic integer programs using expected sizes

Cited in

(12)

• Automatic complexity analysis of integer programs via triangular weakly non-linear loops
• Learning probabilistic termination proofs
• Latticed \(k\)-induction with an application to probabilistic programs
• TERMINATOR
• TPDB
• Nagoya Termination Tool
• RAML
• LogMapBaseFunction
• TcT
• Amber
• iRankFinder
• NaTT

This page was built for software: KoAT