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