Accelerating loops with arrays

DOI10.1007/978-3-032-32589-1_9MaRDI QIDQ7411161zbMATH OpenFDO

Authors Florian Frohn, Jürgen Giesl

Publication date 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-32589-1_9

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A calculus for modular loop acceleration
• A new acceleration-based combination framework for array properties
• Aligators for Arrays (Tool Paper)
• Decision procedures for flat array properties
• Definability of accelerated relations in a theory of arrays and its applications
• Fast acceleration of ultimately periodic relations
• scientific article; zbMATH DE number 5613976 (Why is no real title available?)
• Iterating Octagons
• Loop verification with invariants and contracts
• On iterating linear transformations over recognizable sets of integers
• Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
• PTIME computation of transitive closures of octagonal relations
• Reasoning Algebraically About P-Solvable Loops
• Satisfiability modulo exponential integer arithmetic
• The \textsc{Golem} Horn solver
• Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Procee
• Under-approximating loops in C programs for fast counterexample detection
• What's decidable about arrays with sums?

This page was built for publication: Accelerating loops with arrays

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