The following pages link to PURRS (Q17604):
Displaying 9 items.
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- An integrated approach to high integrity software verification (Q861714) (← links)
- Mechanisation of the AKS algorithm (Q2031415) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- A Calculus for Modular Loop Acceleration (Q5039502) (← links)
