Smoothing a program soundly and robustly

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6806 LNCS, Issue , 2011, Pages 277-292

  Chaudhuri, Swarat ^a   Solar Lezama, Armando ^b  

^a RICE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEME; CONTINUOUS TRANSITIONS; CORRECTNESS PROPERTIES; FILTER NOISE; GAUSSIAN FUNCTIONS; GAUSSIAN SMOOTHING; GRADIENT DESCENT; INPUT SPACE; INPUT VARIABLES; LOCAL OPTIMIZATIONS; NUMERICAL SEARCH; PROGRAM ANALYSIS; SMOOTH FUNCTIONS; SYMBOLIC CALCULATION;

ABSTRACTING; APPROXIMATION ALGORITHMS; COMPUTER AIDED ANALYSIS; CONVOLUTION; GAUSSIAN DISTRIBUTION; SEMANTICS; SIGNAL PROCESSING;

PROGRAM INTERPRETERS;

EID: 79960375739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22110-1_22     Document Type: Conference Paper

References (12)

1. Burnim, J., Juvekar, S., Sen, K.: Wise: Automated test generation for worst-case complexity. In: ICSE, pp. 463-473 (2009)
2. Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity analysis of programs. In: POPL (2010)
3. Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving programs robust (2011)
4. Chaudhuri, S., Solar-Lezama, A.: Smooth interpretation. In: PLDI (2010)
5. Chen, L., Miné, A., Wang, J., Cousot, P.: Interval polyhedra: An abstract domain to infer interval linear relationships. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 309-325. Springer, Heidelberg (2009)
6. Chen, L., Miné, A., Wang, J., Cousot, P.: An abstract domain to discover interval linear equalities. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 112-128. Springer, Heidelberg (2010)
7. Chen, X.: Convergence of the BFGS method for LC convex constrained optimization. SIAM J. Control and Optim. 14, 2063 (1996)
8. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977)
9. DeMillo, R., Lipton, R.: Defining software by continuous, smooth functions. IEEE Transactions on Software Engineering 17(4), 383-384 (1991)
10. Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pacific Journal of Optimization 2(1), 35-58 (2006)
11. Nesterov, Y.: Smooth minimization of non-smooth functions. Mathematical Programming 103(1), 127-152 (2005)
12. Russ, J.: The image processing handbook. CRC Press, Boca Raton (2007)