Automating program analysis
From MaRDI portal
Publication:3769944
DOI10.1145/42267.42275zbMath0632.68013OpenAlexW2003398205MaRDI QIDQ3769944
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
correctnessrecursionloopsconditionalssymbolic manipulationprobabilistic programsfunctional programscomplex data structuresassignmentsattributed probabilistic grammarsbinary tree sortcomputer-aided program analysisperformance compilersemantics of probabilistic programs
Related Items
Closed-form upper bounds in static cost analysis, Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis, Automatic average-case analysis of algorithms, Amortized complexity verified, Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs, \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis