Targeting completeness: automated complexity analysis of integer programs
From MaRDI portal
Cites work
- Algebraic numbers in Isabelle/HOL
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Automatic Generation of Polynomial Loop Invariants
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- Complexity and resource bound analysis of imperative programs using difference constraints
- Computer Aided Verification
- COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
- Control-flow refinement for complexity analysis of probabilistic programs in \textsf{KoAT} (short paper)
- Cost analysis of object-oriented bytecode programs
- scientific article; zbMATH DE number 194935 (Why is no real title available?)
- scientific article; zbMATH DE number 7559471 (Why is no real title available?)
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- Invariant generation for multi-path loops with polynomial assignments
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
- Lower-bound synthesis using loop specialization and Max-SMT
- Multiphase-linear ranking functions and their relation to recurrent sets
- On multiphase-linear ranking functions
- On the positivity problem for simple linear recurrence sequences
- Polynomial loops: beyond termination
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- Ranking functions for linear-constraint loops
- Ranking Templates for Linear Loops
- Reasoning Algebraically About P-Solvable Loops
- Resource analysis driven by (conditional) termination proofs
- Resource analysis of complex programs with cost equations
- Solving invariant generation for unsolvable loops
- Symbolic termination analysis of solvable loops
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- Termination of Integer Linear Programs
- Termination of linear loops over the integers
- Termination of triangular Integer loops is decidable
- Termination of triangular polynomial loops
- Tight worst-case bounds for polynomial loop programs
- Towards automatic resource bound analysis for OCaml
- Two decades of automatic amortized resource analysis
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Targeting completeness: automated complexity analysis of integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254724)
