PURRS

swMATH5465MaRDI QIDQ17604FDOQ17604

Author name not available (Why is that?)

Official website: http://www.cs.unipr.it/purrs/

Cited In (17)

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

This page was built for software: PURRS