A. Adje, O. Bouisseau, J. Goubault-larrecq, E. Goubault, and S. Putot, Static Analysis of Programs with Imprecise Probabilistic Inputs, VSTTE, 2013.
DOI : 10.1007/978-3-642-54108-7_2
URL : https://hal.archives-ouvertes.fr/hal-00942126

P. Billingsley, Probability and measure, 2008.

R. Bloem, K. Chatterjee, T. Henzinger, and B. Jobstmann, Better Quality in Synthesis through Quantitative Objectives, CAV, pp.140-156, 2009.
DOI : 10.1007/978-3-642-02658-4_14

P. Cerný, K. Chatterjee, T. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs, CAV, pp.243-259, 2011.

P. Cerný and T. Henzinger, From boolean to quantitative synthesis, EMSOFT, 2011.

K. Chatterjee, T. Henzinger, B. Jobstmann, and R. Singh, Measuring and synthesizing systems in probabilistic environments, CAV, pp.380-395, 2010.

S. Chaudhuri, M. Clochard, and A. Solar-lezama, Bridging boolean and quantitative synthesis using smoothed proof search, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, 2014.
DOI : 10.1145/2535838.2535859
URL : https://hal.archives-ouvertes.fr/hal-00920955

S. Chaudhuri and A. Solar-lezama, Smooth interpretation, PLDI, pp.279-291, 2010.
DOI : 10.1145/1806596.1806629

S. Chaudhuri and A. Solar-lezama, Smoothing a Program Soundly and Robustly, CAV, pp.277-292, 2011.
DOI : 10.1007/s10107-004-0552-5

S. Chaudhuri and A. Solar-lezama, Euler: A System for Numerical Optimization of Programs, CAV, 2012.
DOI : 10.1007/978-3-642-31424-7_57

G. Claret, S. Rajamani, A. Nori, A. Gordon, and J. Borgström, Bayesian inference using data flow analysis, Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013, pp.92-102, 2013.
DOI : 10.1145/2491411.2491423

P. Cousot and M. Monerau, Probabilistic Abstract Interpretation, ESOP, pp.169-193, 2012.
DOI : 10.1007/978-3-642-28869-2_9

A. Donzé, B. Krogh, and A. Rajhans, Parameter Synthesis for Hybrid Systems with an Application to Simulink Models, HSCC, 2009.
DOI : 10.1007/978-3-540-78929-1_25

T. Henzinger and H. Wong-toi, Using HyTech to synthesize control parameters for a steam boiler, Formal Methods for Industrial Applications, pp.265-282, 1995.
DOI : 10.1007/BFb0027241

S. Jambawalikar and P. Kumar, A Note on Approximate Minimum Volume Enclosing Ellipsoid of Ellipsoids, 2008 International Conference on Computational Sciences and Its Applications, pp.478-487, 2008.
DOI : 10.1109/ICCSA.2008.24

S. Jha and S. Seshia, Synthesis of optimal fixed-point implementations of numerical software routines, NSV, 2013.

S. Jha, S. Seshia, and A. Tiwari, Synthesis of optimal switching logic for hybrid systems, Proceedings of the ninth ACM international conference on Embedded software, EMSOFT '11, pp.107-116, 2011.
DOI : 10.1145/2038642.2038660

J. Katoen, A. Mciver, L. Meinicke, and C. Morgan, Linear-Invariant Generation for Probabilistic Programs:, SAS, pp.390-406, 2010.
DOI : 10.1007/978-3-642-15769-1_24

A. Mccallum, K. Schultz, and S. Singh, Factorie: Probabilistic programming via imperatively defined factor graphs, NIPS, pp.1249-1257, 2009.

D. Monniaux, Abstract Interpretation of Probabilistic Semantics, SAS, pp.322-339, 2000.
DOI : 10.1007/978-3-540-45099-3_17

D. Monniaux, Backwards Abstract Interpretation of Probabilistic Programs, ESOP, 2001.
DOI : 10.1007/3-540-45309-1_24

J. A. Nelder and R. Mead, A simplex method for function minimization . The computer journal, p.308, 1965.

A. Nori and R. Sharma, Termination proofs from tests, Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013, pp.246-256, 2013.
DOI : 10.1145/2491411.2491413
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.5699

A. Platzer, Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics, 2010.

S. Seshia, Sciduction, Proceedings of the 49th Annual Design Automation Conference on, DAC '12, pp.356-365, 2012.
DOI : 10.1145/2228360.2228425

R. Sharma, S. Gupta, B. Hariharan, A. Aiken, P. Liang et al., A Data Driven Approach for Algebraic Loop Invariants, ESOP, pp.574-592, 2013.
DOI : 10.1007/978-3-642-37036-6_31

R. Sharma, S. Gupta, B. Hariharan, A. Aiken, and A. Nori, Verification as Learning Geometric Concepts, SAS, pp.388-411, 2013.
DOI : 10.1007/978-3-642-38856-9_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7748

R. Singh and A. Solar-lezama, Synthesizing data structure manipulations from storyboards, Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, SIGSOFT/FSE '11, pp.289-299, 2011.
DOI : 10.1145/2025113.2025153

M. Smith, Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions, Electronic Notes in Theoretical Computer Science, vol.220, issue.3, pp.43-59, 2008.
DOI : 10.1016/j.entcs.2008.11.018

A. Solar-lezama, Program Synthesis by Sketching, 2008.

A. Solar-lezama, Program sketching, International Journal on Software Tools for Technology Transfer, vol.24, issue.1, pp.5-6475, 2013.
DOI : 10.1007/s10009-012-0249-7

S. Srivastava, S. Gulwani, and J. Foster, From program verification to program synthesis, POPL, pp.313-326, 2010.

M. Vechev and E. Yahav, Deriving linearizable fine-grained concurrent objects, PLDI, pp.125-135, 2008.
DOI : 10.1145/1379022.1375598
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.1634

M. Vechev, E. Yahav, G. Yorsh, J. Winn, and T. Minka, Abstraction-guided synthesis of synchronization Probabilistic programming with infer .NET. Machine Learning Summer School lecture notes, POPL, pp.327-338, 2009.