A probabilistic analysis of loop programs

Meyer, 1967, The complexity of loop programs, 465 Brainerd, 1974 Rogers, 1967 Swamy, 1981 Phillips, 1981 Fachini, 1986, A hierarchy of loop programs over binary trees, Int. J. Comput. Math., 19, 3, 10.1080/00207168608803501 Ibarra, 1985, The equivalence problem and correctness formulas for a simple class of programs, Inform. Control, 65, 18, 10.1016/S0019-9958(85)80018-8 Ibarra, 1985, On simple programs with primitive conditional statements, Inform. Control, 65, 42, 10.1016/S0019-9958(85)80019-X Farkas, 1988, On the programs-as-formulas interpretation of parallel programs in Peano arithmetic, Ann. Pure Appl. Logic, 37, 111, 10.1016/0168-0072(88)90024-3 Farkas, 1985, A type structure for parallel programs Iyengar, 1982, A measure of logical complexity of programs, Comput. Lang., 7, 147, 10.1016/0096-0551(82)90003-0 Pritsker, 1966, GERT: Graphical evaluation review technique I, J. Ind. Engng, 17, 267 Pritsker, 1966, GERT: Graphical evaluation review technique II, J. Ind. Engng, 17, 293 Sharir, 1984, Verification of probabilistic programs, SIAM J. Comput., 13, 292, 10.1137/0213021 Stetter, 1984, A measure of program complexity, Comput. Lang., 9, 203, 10.1016/0096-0551(84)90006-7 Szabo, 1987, On some arithmetically expressible properties of programs, Mathematical Problems in Computation Theory. Banach Center Publ., 21, 383