Automating program analysis
DOI10.1145/42267.42275zbMATH Open0632.68013OpenAlexW2003398205MaRDI QIDQ3769944FDOQ3769944
Authors: Timothy J. Hickey, Jacques Cohen 
Publication date: 1988
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/42267.42275
Recommendations
conditionalsrecursionloopssymbolic manipulationcorrectnessprobabilistic programsfunctional programscomplex data structuresassignmentsattributed probabilistic grammarsbinary tree sortcomputer-aided program analysisperformance compilersemantics of probabilistic programs
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- High Performance Computing for Computational Science - VECPAR 2004
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- 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)
