Mechanical program analysis
From MaRDI portal
Cited in
(41)- Automatic average-case analysis of algorithms
- An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences
- Automated higher-order complexity analysis
- PAN: A portable, parallel Prolog: Its design, realisation and performance.
- Function composition and automatic average case analysis
- Certified abstract cost analysis
- Exponential automatic amortized resource analysis
- Run-time complexity bounds using squeezers
- A multi-domain incremental analysis engine and its application to incremental resource analysis
- Time analysis of actor programs
- Closed-form upper bounds in static cost analysis
- A transformational approach to parametric accumulated-cost static profiling
- 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
- More precise yet widely applicable cost analysis
- Calculating statically maximum log memory used by multi-threaded transactional programs
- A transformational approach to resource analysis with typed-norms
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- A complexity calculus for recursive tree algorithms
- A general framework for static profiling of parametric resource usage
- On the edge of decidability in complexity analysis of loop programs
- A transformational approach to resource analysis with typed-norms inference
- Tight polynomial bounds for loop programs in polynomial space
- Verified Root-Balanced Trees
- A general framework for static cost analysis of parallel logic programs
- Denotational semantics as a foundation for cost recurrence extraction for functional languages
- Resource analysis driven by (conditional) termination proofs
- Tight polynomial worst-case bounds for loop programs
- An experimental logic based on the fundamental deduction principle
- scientific article; zbMATH DE number 7649967 (Why is no real title available?)
- Regular path clauses and their application in solving loops
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Amortized complexity verified
- Typable fragments of polynomial automatic amortized resource analysis
- Probabilistic output analysis by program manipulation
- Worst-case input generation for concurrent programs under non-monotone resource metrics
- Cost analysis of object-oriented bytecode programs
- Synthesis with asymptotic resource bounds
- Lower-bound synthesis using loop specialization and Max-SMT
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
This page was built for publication: Mechanical program analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4062612)
