Cited in
(17)- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- Mechanisation of the AKS algorithm
- COSTA
- FLATA
- An integrated approach to high integrity software verification
- Aligators
- TPDB
- net.datastructures
- ACE
- LoAT
- A calculus for modular loop acceleration
- More precise yet widely applicable cost analysis
- iRankFinder
- Closed-form upper bounds in static cost analysis
- Lower runtime bounds for integer programs
- Cost analysis of object-oriented bytecode programs
This page was built for software: PURRS
