Automating program analysis
From MaRDI portal
Publication:3769944
DOI10.1145/42267.42275zbMath0632.68013MaRDI 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
correctness; recursion; loops; conditionals; symbolic manipulation; probabilistic programs; functional programs; complex data structures; assignments; attributed probabilistic grammars; binary tree sort; computer-aided program analysis; performance compiler; semantics of probabilistic programs
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Amortized complexity verified, \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis, Automatic average-case analysis of algorithms, Closed-form upper bounds in static cost analysis, Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs, Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis