Towards automatic resource bound analysis for OCaml
From MaRDI portal
Publication:5370874
DOI10.1145/3009837.3009842zbMath1380.68123arXiv1611.00692MaRDI QIDQ5370874
Shu-Chun Weng, Ankush Das, Jan Hoffmann
Publication date: 20 October 2017
Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.00692
static analysis; type systems; type inference; amortized analysis; LP-solving; resource-bound analysis
68N15: Theory of programming languages
68N20: Theory of compilers and interpreters
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
A Transformational Approach to Resource Analysis with Typed-norms Inference, Unnamed Item, Higher-Ranked Annotation Polymorphic Dependency Analysis, Verified Root-Balanced Trees, Denotational semantics as a foundation for cost recurrence extraction for functional languages, Unnamed Item, Two decades of automatic amortized resource analysis, Type-based analysis of logarithmic amortised complexity, Unnamed Item, Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits, Amortized complexity verified, ATLAS: automated amortised complexity analysis of self-adjusting data structures, Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution, Inferring expected runtimes of probabilistic integer programs using expected sizes, Automatic complexity analysis of integer programs via triangular weakly non-linear loops, Runtime complexity analysis of logically constrained rewriting, Selectively-amortized resource bounding, Attribute-Based Signatures for Circuits from Bilinear Map
Uses Software
