Approximating Integer Solution Counting via Space Quantification for Linear Constraints
暂无分享,去创建一个
Fan Zhang | Pei Huang | Feifei Ma | Jian Zhang | Cunjing Ge | Xutong Ma
[1] Somesh Jha,et al. Satisfiability modulo counting: a new approach for analyzing privacy properties , 2014, CSL-LICS.
[2] Marcelo d'Amorim,et al. Compositional solution space quantification for probabilistic software analysis , 2014, PLDI.
[3] Gilles Pesant. Counting-Based Search for Constraint Optimization Problems , 2016, AAAI.
[4] Supratik Chakraborty,et al. Approximate Probabilistic Inference via Word-Level Counting , 2015, AAAI.
[5] Alexander I. Barvinok. Computing the volume, counting integral points, and exponential sums , 1993, Discret. Comput. Geom..
[6] James C. Boerkoel,et al. New Perspectives on Flexibility in Simple Temporal Planning , 2018, ICAPS.
[7] Jian Zhang,et al. Canalyze: a static bug-finding tool for C programs , 2014, ISSTA 2014.
[8] Supratik Chakraborty,et al. Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls , 2016, IJCAI.
[9] Matthew B. Dwyer,et al. Exact and approximate probabilistic symbolic execution for nondeterministic programs , 2014, ASE.
[10] Feifei Ma,et al. A Fast and Practical Method to Estimate Volumes of Convex Polytopes , 2015, FAW.
[11] Peng Zhang,et al. Computing and estimating the volume of the solution space of SMT(LA) constraints , 2018, Theor. Comput. Sci..
[12] Rupak Majumdar,et al. Approximate Counting in SMT and Value Estimation for Probabilistic Programs , 2015, TACAS.
[13] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[14] Tian Liu,et al. A New Probabilistic Algorithm for Approximate Model Counting , 2017, PRUV@IJCAR.
[15] Komei Fukuda,et al. Exact volume computation for polytopes: a practical study , 1996 .
[16] László Lovász,et al. Computational results of an O∗(n4) volume algorithm , 2012, Eur. J. Oper. Res..
[17] Peter J. Stuckey,et al. Encoding Linear Constraints into SAT , 2014, CP.
[18] A. I. Barvinok,et al. Computing the Ehrhart polynomial of a convex lattice polytope , 1994, Discret. Comput. Geom..
[19] Marcelo d'Amorim,et al. Iterative distribution-aware sampling for probabilistic symbolic execution , 2015, ESEC/SIGSOFT FSE.