A probabilistic analysis of loop programs

DOI10.1016/0096-0551(89)90019-2MaRDI QIDQ3833599zbMATH OpenOpenAlexFDO

Authors E. J. Farkas, Manfred E. Szabo

Publication date 1989

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(89)90019-2

zbMATH Keywords

computational complexityloop programsMason's ruleprobabilistic analysisstochastic networkstopological equation

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Weakest precondition reasoning for expected run-times of probabilistic programs
• Automating program analysis
• Probabilistic analysis of programs: a weak limit approach
• Runtime analysis of probabilistic programs with unbounded recursion
• Runtime analysis of probabilistic programs with unbounded recursion

Cited in

(5)

• A faithful embedding of parallel computations in star-finite models
• On probabilistic techniques for data flow analysis
• Automating program analysis
• Moment-based invariants for probabilistic loops with non-polynomial assignments
• On frequency analysis of sequential program code execution

This page was built for publication: A probabilistic analysis of loop programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833599)