SPEED: precise and efficient static estimation of program computational complexity
DOI10.1145/1480881.1480898zbMATH Open1315.68095OpenAlexW2109863363MaRDI QIDQ5261512FDOQ5261512
Authors: Sumit Gulwani, Krishna K. Mehra, Trishul Chilimbi 
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1480881.1480898
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cited In (29)
- Loop summarization using state and transition invariants
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages
- Title not available (Why is that?)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
- Type-based amortized resource analysis with integers and arrays
- Analysis of Executable Software Models
- Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
- Run-time complexity bounds using squeezers
- A multi-domain incremental analysis engine and its application to incremental resource analysis
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism
- ABC: algebraic bound computation for loops
- A general framework for static profiling of parametric resource usage
- A type-based complexity analysis of object oriented programs
- A Coq Library for Internal Verification of Running-Times
- Complexity and resource bound analysis of imperative programs using difference constraints
- Selectively-amortized resource bounding
- Semantic foundations for cost analysis of pipeline-optimized programs
- Title not available (Why is that?)
- Certified abstract cost analysis
- Resource-usage-aware configuration in software product lines
- Time analysis of actor programs
- A new order-theoretic characterisation of the polytime computable functions
- Integrating deployment architectures and resource consumption in timed object-oriented models
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Attribute-Based Signatures for Circuits from Bilinear Map
- More precise yet widely applicable cost analysis
- SPEED: Symbolic Complexity Bound Analysis
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
Uses Software
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)
