Towards automatic resource bound analysis for OCaml
From MaRDI portal
Publication:5370874
DOI10.1145/3009837.3009842zbMath1380.68123arXiv1611.00692OpenAlexW2547267640MaRDI 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
Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (18)
Higher-Ranked Annotation Polymorphic Dependency Analysis ⋮ ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Verified Root-Balanced Trees ⋮ Selectively-amortized resource bounding ⋮ Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ Amortized complexity verified ⋮ Attribute-Based Signatures for Circuits from Bilinear Map ⋮ A Transformational Approach to Resource Analysis with Typed-norms Inference ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Unnamed Item ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops ⋮ Two decades of automatic amortized resource analysis ⋮ Type-based analysis of logarithmic amortised complexity ⋮ Runtime complexity analysis of logically constrained rewriting
Uses Software
This page was built for publication: Towards automatic resource bound analysis for OCaml
