Chaudhuri, Swarat; Clochard, Martin; Solar-Lezama, Armando Bridging Boolean and quantitative synthesis using smoothed proof search. (English) Zbl 1284.68169 Proceedings of the 41st ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’14, San Diego, CA, USA, January 22–24, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2544-8). 207-220 (2014). Cited in 3 Documents MSC: 68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) 68Q55 Semantics in the theory of computing 68Q60 Specification and verification (program logics, model checking, etc.) 68Q87 Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) Keywords:abstract interpretation; probabilistic programs; probabilistic verification; program smoothing; synthesis PDFBibTeX XMLCite \textit{S. Chaudhuri} et al., in: Proceedings of the 41st ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL '14, San Diego, CA, USA, January 22--24, 2014. New York, NY: Association for Computing Machinery (ACM). 207--220 (2014; Zbl 1284.68169) Full Text: DOI