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