Algebraic program analysis
From MaRDI portal
Publication:832153
DOI10.1007/978-3-030-81685-8_3zbMath1493.68115OpenAlexW3185017891MaRDI QIDQ832153
John Cyphert, Zachary Kincaid, Thomas W. Reps
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81685-8_3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reflections on termination of linear loops
- Affine relationships among variables of a program
- Algebraic structures for transitive closure
- On iterating linear transformations over recognizable sets of integers
- PTIME computation of transitive closures of octagonal relations
- Graphs, dioids and semirings. New models and algorithms.
- Weighted pushdown systems and their application to interprocedural dataflow analysis
- A Modular Static Analysis Approach to Affine Loop Invariants Detection
- Newtonian program analysis via tensor product
- Definability of Accelerated Relations in a Theory of Arrays and Its Applications
- Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
- Newtonian program analysis
- Loop Summarization and Termination Analysis
- ABC: Algebraic Bound Computation for Loops
- Variance analyses from invariance analyses
- Integer Vector Addition Systems with States
- Loop Summarization Using Abstract Transformers
- Fast Acceleration of Ultimately Periodic Relations
- Combining Widening and Acceleration in Linear Relation Analysis
- Iterating Octagons
- A Unified Approach to Path Problems
- Fast Algorithms for Solving Path Problems
- Regular Algebra Applied to Path-finding Problems
- A program data flow analysis procedure
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Symbolic execution and program testing
- Accelerating Interpolants
- Automatic modular abstractions for linear constraints
- Abstract Interpretation Frameworks
- Compositional Shape Analysis by Means of Bi-Abduction
- Accelerating Interpolation-Based Model-Checking
- Some classifications of context-free languages
- Inclusion relations among families of context-free languages
- Flat Parametric Counter Automata
This page was built for publication: Algebraic program analysis
