SPEED

DOI10.1145/1480881.1480898zbMath1315.68095OpenAlexW2109863363MaRDI QIDQ5261512

Trishul Chilimbi, Krishna K. Mehra, Sumit Gulwani

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

zbMATH Keywords

termination analysiscounter instrumentationquantitative functionssymbolic complexity bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (26)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Selectively-amortized resource bounding ⋮ A type-based complexity analysis of object oriented programs ⋮ Complexity and resource bound analysis of imperative programs using difference constraints ⋮ A general framework for static profiling of parametric resource usage ⋮ Time analysis of actor programs ⋮ Resource-usage-aware configuration in software product lines ⋮ Semantic foundations for cost analysis of pipeline-optimized programs ⋮ Unnamed Item ⋮ Type-based amortized resource analysis with integers and arrays ⋮ Oracle-guided scheduling for controlling granularity in implicitly parallel languages ⋮ Integrating deployment architectures and resource consumption in timed object-oriented models ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Run-time complexity bounds using squeezers ⋮ Loop summarization using state and transition invariants ⋮ Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach ⋮ Analysis of Executable Software Models ⋮ A Coq Library for Internal Verification of Running-Times ⋮ Attribute-Based Signatures for Circuits from Bilinear Map ⋮ More Precise Yet Widely Applicable Cost Analysis ⋮ Certified abstract cost analysis ⋮ Unnamed Item ⋮ Efficient Type-Checking for Amortised Heap-Space Analysis ⋮ 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

Uses Software

• SPEED
• aiT
• CSSV

This page was built for publication: SPEED