SPEED: precise and efficient static estimation of program computational complexity
From MaRDI portal
(Redirected from Publication:5261512)
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55)
Recommendations
Cited in
(37)- A type-based complexity analysis of object oriented programs
- Certified abstract cost analysis
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
- Selectively-amortized resource bounding
- Run-time complexity bounds using squeezers
- Loop summarization using state and transition invariants
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
- A new order-theoretic characterisation of the polytime computable functions
- A multi-domain incremental analysis engine and its application to incremental resource analysis
- Complexity and resource bound analysis of imperative programs using difference constraints
- Time analysis of actor programs
- Resource analysis of complex programs with cost equations
- A Coq library for internal verification of running-times
- Attribute-based signatures for circuits from bilinear map
- Quantitative interprocedural analysis
- A flow calculus of \(mwp\)-bounds for complexity analysis
- ABC: algebraic bound computation for loops
- More precise yet widely applicable cost analysis
- Deciding fast termination for probabilistic VASS with nondeterminism
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
- SPEED: Symbolic Complexity Bound Analysis
- Efficient Type-Checking for Amortised Heap-Space Analysis
- A general framework for static profiling of parametric resource usage
- Integrating deployment architectures and resource consumption in timed object-oriented models
- Computing exact loop bounds for bounded program verification
- scientific article; zbMATH DE number 7204445 (Why is no real title available?)
- Control flow refinement and symbolic computation of average case bound
- Convex invariant refinement by control node splitting: a heuristic approach
- Analysis of executable software models
- Complexity verification using guided theorem enumeration
- Type-based amortized resource analysis with integers and arrays
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages
- scientific article; zbMATH DE number 7649967 (Why is no real title available?)
- Semantic foundations for cost analysis of pipeline-optimized programs
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Worst-case input generation for concurrent programs under non-monotone resource metrics
- Resource-usage-aware configuration in software product lines
This page was built for publication: SPEED: precise and efficient static estimation of program computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261512)
