Supratik Chakraborty, Kuldeep S. Meel & Moshe Y. Vardi (2013):
A Scalable Approximate Model Counter.
In: Christian Schulte: Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings,
Lecture Notes in Computer Science 8124.
Springer,
pp. 200–216,
doi:10.1007/978-3-642-40627-0_18.
Supratik Chakraborty, Kuldeep S. Meel & Moshe Y. Vardi (2014):
Balancing Scalability and Uniformity in SAT Witness Generator.
In: Proceedings of the 51st Annual Design Automation Conference,
DAC '14.
ACM,
pp. 60:1–60:6,
doi:10.1145/2593069.2593097.
Felix Dörre & Vladimir Klebanov (2016):
Practical Detection of Entropy Loss in Pseudo-Random Number Generators.
In: Proceedings, ACM Conference on Computer and Communications Security (CCS).
To appear.
Stefano Ermon, Carla P Gomes & Bart Selman (2012):
Uniform solution sampling using a constraint solver as an oracle.
arXiv preprint arXiv:1210.4861.
Martin Gebser, Benjamin Kaufmann, André Neumann & Torsten Schaub (2007):
Clasp: A Conflict-Driven Answer Set Solver.
In: Chitta Baral, Gerhard Brewka & John Schlipf: Logic Programming and Nonmonotonic Reasoning,
Lecture Notes in Computer Science 4483.
Springer Berlin Heidelberg,
pp. 260–265,
doi:10.1007/978-3-540-72200-7_23.
Vibhav Gogate & Rina Dechter (2011):
SampleSearch: Importance sampling in presence of determinism.
Artificial Intelligence 175(2),
pp. 694–729,
doi:10.1016/j.artint.2010.10.009.
Carla P. Gomes, Ashish Sabharwal & Bart Selman (2006):
Model Counting: A New Strategy for Obtaining Good Bounds.
In: Proceedings of the 21st National Conference on Artificial Intelligence - Volume 1,
AAAI'06.
AAAI Press,
pp. 54–61.
Carla P. Gomes, Ashish Sabharwal & Bart Selman (2006):
Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints.
In: Bernhard Schölkopf, John C. Platt & Thomas Hoffman: Advances in Neural Information Processing Systems 19, Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 4-7, 2006.
MIT Press,
pp. 481–488.
Richard M Karp, Michael Luby & Neal Madras (1989):
Monte-Carlo approximation algorithms for enumeration problems.
Journal of algorithms 10(3),
pp. 429–448,
doi:10.1016/0196-6774(89)90038-2.
Vladimir Klebanov (2014):
Precise Quantitative Information Flow Analysis – A Symbolic Approach.
Theoretical Computer Science 538(0),
pp. 124–139,
doi:10.1016/j.tcs.2014.04.022.
Vladimir Klebanov, Norbert Manthey & Christian Muise (2013):
SAT-based Analysis and Quantification of Information Flow in Programs.
In: Proceedings, International Conference on Quantitative Evaluation of Systems,
LNCS 8054.
Springer,
pp. 156–171,
doi:10.1007/978-3-642-40196-1_16.
Lukas Kroc, Ashish Sabharwal & Bart Selman (2008):
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting.
In: Proceedings of the 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems,
CPAIOR'08.
Springer-Verlag,
pp. 127–141,
doi:10.1007/978-3-540-68155-7_12.
Daniel Kroening & Michael Tautschnig (2014):
CBMC – C Bounded Model Checker.
In: Erika Ábrahám & Klaus Havelund: Tools and Algorithms for the Construction and Analysis of Systems,
Lecture Notes in Computer Science 8413.
Springer Berlin Heidelberg,
pp. 389–391,
doi:10.1007/978-3-642-54862-8_26.
Norbert Manthey (2012):
Coprocessor 2.0: a flexible CNF simplifier.
In: Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing.
Springer-Verlag,
Berlin, Heidelberg,
pp. 436–441,
doi:10.1007/978-3-642-31612-8_34.
Kuldeep S Meel (2014):
Sampling Techniques for Boolean Satisfiability.
arXiv preprint arXiv:1404.6682.
Ziyuan Meng & Geoffrey Smith (2011):
Calculating bounds on information leakage using two-bit patterns.
In: Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security.
ACM,
pp. 1,
doi:10.1145/2166956.2166957.
Christian Muise, Sheila A. McIlraith, J. Christopher Beck & Eric I. Hsu (2012):
Dsharp: fast d-DNNF compilation with sharpSAT.
In: Proceedings, Canadian AI'12.
Springer-Verlag,
Berlin, Heidelberg,
pp. 356–361,
doi:10.1007/978-3-642-30353-1_36.
Reuven Rubinstein (2013):
Stochastic enumeration method for counting NP-hard problems.
Methodology and Computing in Applied Probability 15(2),
pp. 249–291,
doi:10.1007/s11009-011-9242-y.
Jeanette P Schmidt, Alan Siegel & Aravind Srinivasan (1995):
Chernoff-Hoeffding bounds for applications with limited independence.
SIAM Journal on Discrete Mathematics 8(2),
pp. 223–250,
doi:10.1137/S089548019223872X.
Geoffrey Smith (2015):
Recent Developments in Quantitative Information Flow (Invited Tutorial).
In: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
LICS '15.
IEEE Computer Society,
pp. 23–31,
doi:10.1109/LICS.2015.13.
Mate Soos, Karsten Nohl & Claude Castelluccia (2009):
Extending SAT Solvers to Cryptographic Problems.
In: Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing,
SAT '09.
Springer-Verlag,
Berlin, Heidelberg,
pp. 244–257,
doi:10.1007/978-3-642-02777-2_24.
Marc Thurley (2006):
sharpSAT: Counting Models with Advanced Component Caching and Implicit BCP.
In: Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing,
SAT'06.
Springer-Verlag,
Berlin, Heidelberg,
pp. 424–429,
doi:10.1007/11814948_38.
Mark N. Wegman & J. Lawrence Carter (1981):
New hash functions and their use in authentication and set equality.
Journal of Computer and System Sciences 22(3),
pp. 265 – 279,
doi:10.1016/0022-0000(81)90033-7.
Wei Wei & Bart Selman (2005):
A New Approach to Model Counting.
In: Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing,
SAT'05.
Springer-Verlag,
Berlin, Heidelberg,
pp. 324–339,
doi:10.1007/11499107_24.
eptcs@eptcs.org