{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:59:55Z","timestamp":1740131995387,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tcad.2018.2857320","type":"journal-article","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T19:47:02Z","timestamp":1532116022000},"page":"2381-2392","source":"Crossref","is-referenced-by-count":2,"title":["Discrete Choice in the Presence of Numerical Uncertainties"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8639-4116","authenticated-orcid":false,"given":"Debasmita","family":"Lohar","sequence":"first","affiliation":[{"name":"Saarland Informatics Campus, Max Planck Institute for Software Systems, Saarbrücken, Germany"}]},{"given":"Eva","family":"Darulova","sequence":"additional","affiliation":[{"name":"Saarland Informatics Campus, Max Planck Institute for Software Systems, Saarbrücken, Germany"}]},{"given":"Sylvie","family":"Putot","sequence":"additional","affiliation":[{"name":"LIX, CNRS, École Polytechnique, Palaiseau, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3198-1863","authenticated-orcid":false,"given":"Eric","family":"Goubault","sequence":"additional","affiliation":[{"name":"LIX, CNRS, École Polytechnique, Palaiseau, France"}]}],"member":"263","reference":[{"key":"ref39","first-page":"2849","article-title":"Fixed point quantization of deep convolutional networks","author":"lin","year":"2016","journal-title":"Proc ICML"},{"key":"ref38","article-title":"Incremental network quantization: Towards lossless CNNs with low-precision weights","author":"zhou","year":"2017","journal-title":"Proc ICLR"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462179"},{"key":"ref32","first-page":"112","article-title":"Expressing and verifying probabilistic assertions","author":"sampson","year":"2014","journal-title":"Proc PLDI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.36"},{"journal-title":"Project Sklearn-Porter","year":"2018","key":"ref30"},{"key":"ref37","first-page":"1","article-title":"Quantized neural networks: Training neural networks with low precision weights and activations","volume":"18","author":"hubara","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47443-4_13"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11334-010-0128-x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541958"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2042980"},{"key":"ref40","first-page":"97","article-title":"Reluplex: An efficient SMT solver for verifying deep neural networks","author":"katz","year":"2017","journal-title":"Proc CAV"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-011-0182-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90060-D"},{"journal-title":"infer net 2 6","year":"2014","author":"minka","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v076.i01"},{"key":"ref15","first-page":"2476","article-title":"R2: An efficient MCMC sampler for probabilistic programs","author":"nori","year":"2014","journal-title":"Proc AAAI"},{"journal-title":"Mathematica Version 4","year":"2018","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.873887"},{"journal-title":"Interval Analysis","year":"1966","author":"moore","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1515\/9780691214696"},{"key":"ref28","first-page":"225","article-title":"Uncertainty propagation using probabilistic affine forms and concentration of measure inequalities","author":"bouissou","year":"2016","journal-title":"Proc TACAS"},{"key":"ref4","first-page":"50","article-title":"Robustness analysis of finite precision implementations","author":"goubault","year":"2013","journal-title":"Proceedings of APLAS"},{"key":"ref27","first-page":"337","article-title":"Z3: An efficient SMT solver","author":"de moura","year":"2008","journal-title":"Proc TACAS"},{"key":"ref3","first-page":"232","article-title":"Static analysis of finite precision computations","author":"goubault","year":"2011","journal-title":"Proc VMCAI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.189"},{"key":"ref29","first-page":"707","article-title":"Search strategies for floating point constraint systems","author":"zitoun","year":"2017","journal-title":"Proc CP"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3014426"},{"key":"ref8","first-page":"22","article-title":"Static analysis of programs with imprecise probabilistic inputs","author":"adje","year":"2013","journal-title":"Proc VSTTE"},{"key":"ref7","first-page":"62","article-title":"PSI: Exact symbolic inference for probabilistic programs","author":"gehr","year":"2016","journal-title":"Proc CAV"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1644001.1644003"},{"key":"ref9","first-page":"270","article-title":"Daisy—Framework for analysis and optimization of numerical programs","author":"darulova","year":"2018","journal-title":"Proc TACAS"},{"key":"ref1","first-page":"532","article-title":"Rigorous estimation of floating-point round-off errors with symbolic Taylor expansions","author":"solovyev","year":"2015","journal-title":"Proc FM"},{"article-title":"Constructing probability boxes and Dempster–Shafer structures","year":"2003","author":"ferson","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/B:NUMA.0000049462.70970.b6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009933109326"},{"journal-title":"GLPK (GNU Linear Programming Kit)","year":"2012","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236468"},{"key":"ref26","first-page":"255","article-title":"Certifying and repairing solutions to large LPs. How good are LP-solvers?","author":"dhiflaoui","year":"2003","journal-title":"Proc SODA"},{"key":"ref25","article-title":"Lurupa—Rigorous error bounds in linear programming","author":"keil","year":"2006","journal-title":"Algebraic and Numerical Algorithms and Computer-Assisted Proofs"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/8496924\/08416700.pdf?arnumber=8416700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T17:31:54Z","timestamp":1692207114000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8416700\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":40,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2018.2857320","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"type":"print","value":"0278-0070"},{"type":"electronic","value":"1937-4151"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}