Mechanical program analysis
From MaRDI portal
Publication:4062612
DOI10.1145/361002.361016zbMath0306.68008OpenAlexW2003295303MaRDI QIDQ4062612
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361002.361016
Related Items (37)
Synthesis with asymptotic resource bounds ⋮ Lower-bound synthesis using loop specialization and Max-SMT ⋮ A Transformational Approach to Resource Analysis with Typed-Norms ⋮ Verified Root-Balanced Trees ⋮ Function composition and automatic average case analysis ⋮ Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs ⋮ Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types ⋮ Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation ⋮ Inference of Field-Sensitive Reachability and Cyclicity ⋮ A General Framework for Static Cost Analysis of Parallel Logic Programs ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ A general framework for static profiling of parametric resource usage ⋮ Time analysis of actor programs ⋮ Resource Analysis driven by (Conditional) Termination Proofs ⋮ Unnamed Item ⋮ Closed-form upper bounds in static cost analysis ⋮ Exponential automatic amortized resource analysis ⋮ Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis ⋮ Algebraic simplification in computer algebra: an analysis of bottom-up algorithms ⋮ Unnamed Item ⋮ Automatic average-case analysis of algorithms ⋮ A complexity calculus for recursive tree algorithms ⋮ Run-time complexity bounds using squeezers ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ Amortized complexity verified ⋮ ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS ⋮ An experimental logic based on the fundamental deduction principle ⋮ A Transformational Approach to Parametric Accumulated-Cost Static Profiling ⋮ A Transformational Approach to Resource Analysis with Typed-norms Inference ⋮ More Precise Yet Widely Applicable Cost Analysis ⋮ Certified abstract cost analysis ⋮ Unnamed Item ⋮ An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences ⋮ Cost analysis of object-oriented bytecode programs ⋮ Automated higher-order complexity analysis ⋮ A multi-domain incremental analysis engine and its application to incremental resource analysis ⋮ PAN: A portable, parallel Prolog: Its design, realisation and performance.
This page was built for publication: Mechanical program analysis
