SPEED

DOI10.1145/1480881.1480898zbMath1315.68095MaRDI 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 analysis; counter instrumentation; quantitative functions; symbolic complexity bounds

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q55: Semantics in the theory of computing

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

A general framework for static profiling of parametric resource usage, Unnamed Item, Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach, Analysis of Executable Software Models, Type-based amortized resource analysis with integers and arrays, Oracle-guided scheduling for controlling granularity in implicitly parallel languages, Unnamed Item, Semantic foundations for cost analysis of pipeline-optimized programs, Integrating deployment architectures and resource consumption in timed object-oriented models, Resource-usage-aware configuration in software product lines, 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, A Coq Library for Internal Verification of Running-Times, Attribute-Based Signatures for Circuits from Bilinear Map, More Precise Yet Widely Applicable Cost Analysis, Deciding Fast Termination for Probabilistic VASS with Nondeterminism, Efficient Type-Checking for Amortised Heap-Space Analysis

Uses Software