Complexity and resource bound analysis of imperative programs using difference constraints
From MaRDI portal
Recommendations
- Resource analysis of complex programs with cost equations
- On the inference of resource usage upper and lower bounds
- Speeding up the constraint-based method in difference logic
- Resource analysis driven by (conditional) termination proofs
- SPEED: precise and efficient static estimation of program computational complexity
Cites work
- A combination framework for tracking partition sizes
- A new look at the automatic synthesis of linear ranking functions
- Amortized Computational Complexity
- Automatic numeric abstractions for heap-manipulating programs
- Complexity and resource bound analysis of imperative programs using difference constraints
- Cost analysis of object-oriented bytecode programs
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Multivariate amortized resource analysis
- On the Foundations of Quantitative Information Flow
- Resource analysis of complex programs with cost equations
- Size-Change Abstraction and Max-Plus Automata
- SPEED: precise and efficient static estimation of program computational complexity
- Verification, Model Checking, and Abstract Interpretation
Cited in
(23)- Certified abstract cost analysis
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Selectively-amortized resource bounding
- Exponential automatic amortized resource analysis
- The polynomial complexity of vector addition systems with states
- Run-time complexity bounds using squeezers
- Complexity and resource bound analysis of imperative programs using difference constraints
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings
- Speeding up the constraint-based method in difference logic
- Relational cost analysis in a functional-imperative setting
- Tight polynomial bounds for loop programs in polynomial space
- scientific article; zbMATH DE number 7204445 (Why is no real title available?)
- Tight polynomial worst-case bounds for loop programs
- Type-based analysis of logarithmic amortised complexity
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Asymptotic complexity estimates for probabilistic programs and their VASS abstractions
- Polynomial loops: beyond termination
- Control-flow refinement for complexity analysis of probabilistic programs in \textsf{KoAT} (short paper)
- Targeting completeness: automated complexity analysis of integer programs
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Lower-bound synthesis using loop specialization and Max-SMT
This page was built for publication: Complexity and resource bound analysis of imperative programs using difference constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398171)
