ABC: algebraic bound computation for loops

DOI10.1007/978-3-642-17511-4_7MaRDI QIDQ3066094zbMATH OpenOpenAlexFDO

Authors Régis Blanc, Thibaud Hottelier, Laura Kovács, Thomas A. Henzinger

Publication date 7 January 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/186096/files/LPAR09_Kovacs.pdf

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Symbolic computation and algebraic computation (68W30)

Recommendations

• Symbolic Loop Bound Computation for WCET Analysis
• SPEED: precise and efficient static estimation of program computational complexity
• Algebra-Based Reasoning for Loop Synthesis
• Abstract acceleration of general linear loops
• On the inference of resource usage upper and lower bounds

Cited in

(7)

• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
• Certified abstract cost analysis
• Symbolic Loop Bound Computation for WCET Analysis
• Computing exact loop bounds for bounded program verification
• scientific article; zbMATH DE number 7204445 (Why is no real title available?)
• Type-based analysis of logarithmic amortised complexity
• Algebraic program analysis

Describes a project that uses

Uses Software

• JAMA
• RComp
• Valigator
• Scala
• Mathematica
• ABC
• JAMPACK

This page was built for publication: ABC: algebraic bound computation for loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066094)