scientific article; zbMATH DE number 7215283
From MaRDI portal
Amir M. Ben-Amram, Geoff W. Hamilton
Publication date: 26 June 2020
Full work available at URL: https://arxiv.org/abs/1906.10047
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Factorization forests of finite height
- A characterization of time complexity by simple loop programs
- Undecidable problems in unreliable computations.
- On the computational complexity of imperative programming languages
- Computing polynomial program invariants
- Complexity and resource bound analysis of imperative programs using difference constraints
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Size-Change Abstraction and Max-Plus Automata
- A flow calculus of mwp -bounds for complexity analysis
- Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
- Factorization Forests
- Mechanical program analysis
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
- Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
- The size-change principle for program termination
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
- Ranking Functions for Linear-Constraint Loops
- Static Complexity Analysis of Higher Order Programs
- Verification, Model Checking, and Abstract Interpretation
- Numerical invariants via abstract machines
- Deductive verification in decidable fragments with Ivy
