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