Cited in
(11)- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- \textsc{LTL} falsification in infinite-state systems
- PURRS
- TERMINATOR
- Ultimate Automizer
- TPDB
- KITTeL
- LoAT
- KoAT
- Synthesizing ranking functions for loop programs via SVM
This page was built for software: iRankFinder
