Steffen, Bernhard Optimal run time optimization proved by a new look at abstract interpretations. (English) Zbl 0614.68012 TAPSOFT ’87, Proc. Int. Conf. Software development, Pisa/Italy 1987, Vol. 1: Trees in algebra and programming, Lect. Notes Comput. Sci. 249, 52-68 (1987). For the entire collection see Zbl 0605.00015. Cited in 1 ReviewCited in 3 Documents MSC: 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:run time optimization algorithm; Kildall’s iterative method for data flow analysis; Morel/Renvoise’s partial redundancy elimination algorithm; Herbrand interpretation Citations:Zbl 0605.00015 × Cite Format Result Cite Review PDF