Proving programs robust
2011pp. 102–112
Citations Over TimeTop 1% of 2011 papers
Abstract
We present a program analysis for verifying quantitative robustness properties of programs, stated generally as: "If the inputs of a program are perturbed by an arbitrary amount epsilon, then its outputs change at most by (K . epsilon), where K can depend on the size of the input but not its value." Robustness properties generalize the analytic notion of continuity---e.g., while the function ex is continuous, it is not robust. Our problem is to verify the robustness of a function P that is coded as an imperative program, and can use diverse data types and features such as branches and loops.
Related Papers
- → Robust Optimization Method for the Economic Term in Chemical Process Design and Planning(2001)29 cited
- → Robust solutions for vehicle routing problems via evolutionary multiobjective optimization(2009)12 cited
- → A new methodology for searching robust Pareto optimal solutions with MOEAs(2008)8 cited
- Research on Video Format Conversion Algorithms(2006)
- → Explicit sets with ideal robustness are achievable in combinatorial optimization problems with cost uncertainty(2023)