Bridging boolean and quantitative synthesis using smoothed proof search

ACM SIGPLAN Notices

Volumn 49, Issue 1, 2014, Pages 207-220

  Chaudhuri, Swarat ^a   Clochard, Martin ^b   Solar Lezama, Armando ^c  

^a RICE UNIVERSITY   (United States)

^b INRIA SACLAY   (France)

^c IDEI   (France)

Author keywords

Abstract Interpretation; Probabilistic Programs; Probabilistic Verification; Program Smoothing; Synthesis

Indexed keywords

EID: 84894043651     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (35)

1. A. Adje, O. Bouisseau, J. Goubault-Larrecq, E. Goubault, and S. Putot. Static analysis of programs with imprecise probabilistic inputs. In VSTTE, 2013.
2. Patrick Billingsley. Probability and measure. John Wiley & Sons, 2008.
3. R. Bloem, K. Chatterjee, T. Henzinger, and B. Jobstmann. Better quality in synthesis through quantitative objectives. In CAV, pages 140-156, 2009.
4. P. Cerný, K. Chatterjee, T. Henzinger, A. Radhakrishna, and R. Singh. Quantitative synthesis for concurrent programs. In CAV, pages 243-259, 2011.
5. P. Cerný and T. Henzinger. From boolean to quantitative synthesis. In EMSOFT, 2011.
6. K. Chatterjee, T. Henzinger, B. Jobstmann, and R. Singh. Measuring and synthesizing systems in probabilistic environments. In CAV, pages 380-395, 2010.
7. S. Chaudhuri, M. Clochard, and A. Solar-Lezama. Bridging boolean and quantitative synthesis using smoothed proof search. Technical report, Rice University, 2014.
8. S. Chaudhuri and A. Solar-Lezama. Smooth interpretation. In PLDI, pages 279-291, 2010.
9. S. Chaudhuri and A. Solar-Lezama. Smoothing a program soundly and robustly. In CAV, pages 277-292, 2011.
10. S. Chaudhuri and A. Solar-Lezama. Euler: A system for numerical optimization of programs. In CAV, 2012.
11. G. Claret, S. Rajamani, A. Nori, A. Gordon, and J. Borgström. Bayesian inference using data flow analysis. In ESEC/SIGSOFT FSE, pages 92-102, 2013.
12. P. Cousot and M. Monerau. Probabilistic abstract interpretation. In ESOP, pages 169-193, 2012.
13. A. Donzé, B. Krogh, and A. Rajhans. Parameter synthesis for hybrid systems with an application to Simulink models. In HSCC, 2009.
14. T. Henzinger and H. Wong-Toi. Using HyTech to synthesize control parameters for a steam boiler. In Formal Methods for Industrial Applications, pages 265-282, 1995.
15. S. Jambawalikar and P. Kumar. A note on approximate minimum volume enclosing ellipsoid of ellipsoids. In ICCSA, pages 478-487, 2008.
16. S. Jha and S. Seshia. Synthesis of optimal fixed-point implementations of numerical software routines. In NSV, 2013.
17. S. Jha, S. Seshia, and A. Tiwari. Synthesis of optimal switching logic for hybrid systems. In EMSOFT, pages 107-116, 2011.
18. J. Katoen, A. McIver, L. Meinicke, and C. Morgan. Linear-invariant generation for probabilistic programs: Automated support for proofbased methods. In SAS, pages 390-406, 2010.
19. A. McCallum, K. Schultz, and S. Singh. Factorie: Probabilistic programming via imperatively defined factor graphs. In NIPS, pages 1249-1257, 2009.
20. D. Monniaux. Abstract interpretation of probabilistic semantics. In SAS, pages 322-339, 2000.
21. D. Monniaux. Backwards abstract interpretation of probabilistic programs. In ESOP, 2001.
22. J.A. Nelder and R. Mead. A simplex method for function minimization. The computer journal, 7(4):308, 1965.
23. A. Nori and R. Sharma. Termination proofs from tests. In ESEC/SIGSOFT FSE, pages 246-256, 2013.
24. A. Platzer. Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics. Springer-Verlag, 2010.
25. S. Seshia. Sciduction: combining induction, deduction, and structure for verification and synthesis. In DAC, pages 356-365, 2012.
26. R. Sharma, S. Gupta, B. Hariharan, A. Aiken, P. Liang, and A. Nori. A data driven approach for algebraic loop invariants. In ESOP, pages 574-592, 2013.
27. R. Sharma, S. Gupta, B. Hariharan, A. Aiken, and A. Nori. Verification as learning geometric concepts. In SAS, pages 388-411, 2013.
28. R. Singh and A. Solar-Lezama. Synthesizing data structure manipulations from storyboards. In SIGSOFT FSE, pages 289-299, 2011.
29. M. Smith. Probabilistic abstract interpretation of imperative programs using truncated normal distributions. Electron. Notes Theor. Comput. Sci., 220(3):43-59, 2008.
30. A. Solar-Lezama. Program Synthesis by Sketching. PhD thesis, UC Berkeley, 2008.
31. Armando Solar-Lezama. Program sketching. STTT, 15(5-6):475-495, 2013.
32. S. Srivastava, S. Gulwani, and J. Foster. From program verification to program synthesis. In POPL, pages 313-326, 2010.
33. M. Vechev and E. Yahav. Deriving linearizable fine-grained concurrent objects. In PLDI, pages 125-135, 2008.
34. M. Vechev, E. Yahav, and G. Yorsh. Abstraction-guided synthesis of synchronization. In POPL, pages 327-338, 2010.
35. J. Winn and T. Minka. Probabilistic programming with infer .NET. Machine Learning Summer School lecture notes, available at http://research.microsoft. com/-minka/papers/mlss2009, 2009.