Abstract acceleration of general linear loops

DOI10.1145/2535838.2535843zbMath1284.68188arXiv1311.0768OpenAlexW2095810701MaRDI QIDQ5408447

Peter Schrammel, Sriram Sankaranarayanan, Bertrand Jeannet

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.0768

zbMATH Keywords

verificationlinear transformationaccelerationstatic analysisconvex polyhedraJordan normal formabstract interpretationmatrix abstract domain

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Linear transformations, semilinear transformations (15A04) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

A Calculus for Modular Loop Acceleration ⋮ \textsc{Diffy}: inductive reasoning of array programs using difference invariants ⋮ Backward symbolic execution with loop folding ⋮ Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration ⋮ Termination of linear loops under commutative updates ⋮ Unnamed Item ⋮ Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration ⋮ Lower Runtime Bounds for Integer Programs

Uses Software

• Octagon

This page was built for publication: Abstract acceleration of general linear loops