Solving invariant generation for unsolvable loops
Automatically generating invariants, key to computer-aided analysis of probabilistic and
deterministic programs and compiler optimisation, is a challenging open problem. Whilst the …
deterministic programs and compiler optimisation, is a challenging open problem. Whilst the …
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis
This paper presents a program analysis method that generates program summaries
involving polynomial arithmetic. Our approach builds on prior techniques that use solvable …
involving polynomial arithmetic. Our approach builds on prior techniques that use solvable …
[HTML][HTML] Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
We present a new procedure to infer size bounds for integer programs automatically. Size
bounds are important for the deduction of bounds on the runtime complexity or in general …
bounds are important for the deduction of bounds on the runtime complexity or in general …
[HTML][HTML] Automatic complexity analysis of integer programs via triangular weakly non-linear loops
There exist several results on deciding termination and computing runtime bounds for
triangular weakly non-linear loops (twn-loops). We show how to use results on such …
triangular weakly non-linear loops (twn-loops). We show how to use results on such …
[HTML][HTML] (Un) Solvable loop analysis
Automatically generating invariants, key to computer-aided analysis of probabilistic and
deterministic programs and compiler optimisation, is a challenging open problem. Whilst the …
deterministic programs and compiler optimisation, is a challenging open problem. Whilst the …
A Machine Learning-based Approach for Solving Recurrence Relations and its use in Cost Analysis of Logic Programs
L Rustenholz, M Klemen, MÁ Carreira-Perpiñán… - arXiv preprint arXiv …, 2024 - arxiv.org
Automatic static cost analysis infers information about the resources used by programs
without actually running them with concrete data, and presents such information as functions …
without actually running them with concrete data, and presents such information as functions …
[HTML][HTML] A calculus for modular loop acceleration and non-termination proofs
Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)
termination of programs. To this end, a variety of acceleration techniques have been …
termination of programs. To this end, a variety of acceleration techniques have been …
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
There exist several results on deciding termination and computing runtime bounds for
triangular weakly non-linear loops (twn-loops). We show how to use results on such …
triangular weakly non-linear loops (twn-loops). We show how to use results on such …
Synthesizing ranking functions for loop programs via SVM
Termination of programs is probably the most famous undecidable problem in computer
science. Despite this undecidability result, a lot of effort has been spent on improving …
science. Despite this undecidability result, a lot of effort has been spent on improving …
[图书][B] Compositional, Monotone, and Non-linear Program Analysis
J Cyphert - 2023 - search.proquest.com
The presence of bugs in deployed software can lead to great economic and or human cost.
One strategy for mitigating these losses is to prove the functional correctness of programs …
One strategy for mitigating these losses is to prove the functional correctness of programs …