KoAT

swMATH39827MaRDI QIDQ55527FDOQ55527

Author name not available (Why is that?)

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
• NaTT
• TERMINATOR
• TPDB
• Nagoya Termination Tool
• RAML
• LogMapBaseFunction
• TcT
• iRankFinder
• Amber

This page was built for software: KoAT