Automating program analysis
From MaRDI portal
Publication:3769944
Recommendations
Cited in
(15)- Weakest precondition reasoning for expected run-times of probabilistic programs
- Closed-form upper bounds in static cost analysis
- A probabilistic analysis of loop programs
- Function composition and automatic average case analysis
- Probabilistic analysis of programs: a weak limit approach
- Some methods of automatic analysis and controllable transformation of programs
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- scientific article; zbMATH DE number 1574486 (Why is no real title available?)
- scientific article; zbMATH DE number 3225739 (Why is no real title available?)
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- High Performance Computing for Computational Science - VECPAR 2004
- Type-based complexity analysis of probabilistic functional programs
- Control flow refinement and symbolic computation of average case bound
- Amortized complexity verified
- Automatic average-case analysis of algorithms
This page was built for publication: Automating program analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769944)