PURRS
From MaRDI portal
Software:17604
swMATH5465MaRDI QIDQ17604FDOQ17604
Author name not available (Why is that?)
Cited In (9)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- More Precise Yet Widely Applicable Cost Analysis
- Closed-form upper bounds in static cost analysis
- An integrated approach to high integrity software verification
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- Mechanisation of the AKS algorithm
- Lower Runtime Bounds for Integer Programs
- Cost analysis of object-oriented bytecode programs
- A Calculus for Modular Loop Acceleration
This page was built for software: PURRS
