interesting article with relation to decorations

["Kreinovich, Vladik" <vladik@xxxxxxxx>]

The latest (August 2012) issue of Communications ACM, the main magazine of ACM, one of the main Computer Science organizations, has an article "Continuity and Robustness of Programs". This article describes techniques that, based on a step-by-step description of an algorithm as a sequence of steps, proves that the resulting functions is continuous -- exactly one of the objectives of using decorations. 

The algorithms presented in this paper go beyond proving continuity, to proving that the resulting function is Lipschitz-continuous, and to computing the corresponding Lipschitz constant. 

The article is attached. 

The continuity part of this article (attached) is a based on the paper "Continuity Analysis of Programs" published in the Proceedings of the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages POPL'2010, Madrid, Spain, January 20-22, 2010, pp. 57-70; this paper is available at http://research.microsoft.com/en-us/um/people/sumitg/pubs/popl10_continuity.pdf

Attachment: chaudhuri.pdf
Description: chaudhuri.pdf