A Study of Symmetry Breaking Predicates and Model Counting
133
43. Hakan Metin, Souheib Baarir, Maximilien Colange, and Fabrice Kordon. Cdclsym:
Introducing effective symmetry breaking in sat solving. In International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, pages 99–
114. Springer, 2018.
44. Quoc-Sang Phan and Pasquale Malacaria. Abstract model counting: a novel approach for quantification of information leaks. In 9th ACM Symposium on Information, Computer and Communications Security, pages 283–292, 2014.
45. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall Press, 2009.
46. Karem Sakallah. Symmetry and satisfiability. Frontiers in Artificial Intelligence
and Applications, 185, 01 2009.
47. Marko Samer and Stefan Szeider. Algorithms for propositional model counting.
Journal of Discrete Algorithms, 8(1):50–64, 2010.
48. Hesam Samimi, Ei Darli Aung, and Todd D. Millstein. Falling back on executable
specifications. In ECOOP, pages 552–576, 2010.
49. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, and Toniann Pitassi.
Combining component caching and clause learning for effective model counting. In
SAT, 2004.
50. Shubham Sharma, Subhajit Roy, Mate Soos, and Kuldeep S. Meel. GANAK: A
scalable probabilistic exact model counter. In IJCAI, pages 1169–1176, 2019.
51. Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search
problems. In Proc. Workshop on Theory and Applications of Satisfiability Testing, June 2001.
52. Mate Soos and Kuldeep S. Meel. Bird: Engineering an efficient cnf-xor sat solver
and its applications to approximate model counting. In Proceedings of AAAI Conference on Artificial Intelligence (AAAI), 1 2019.
53. Mate Soos, Karsten Nohl, and Claude Castelluccia. Extending SAT solvers to cryptographic problems. In Theory and Applications of Satisfiability Testing (SAT),
pages 244–257, 2009.
54. Larry Stockmeyer. The complexity of approximate counting. In Proceedings of
the Fifteenth Annual ACM Symposium on Theory of Computing, STOC ’83, pages
118–126, New York, NY, USA, 1983. ACM.
55. Allison Sullivan, Kaiyuan Wang, Razieh Nokhbeh Zaeem, and Sarfraz Khurshid.
Automated test generation and mutation testing for Alloy. In ICST, 2017.
56. Marc Thurley. SharpSAT – Counting models with advanced component caching
and implicit BCP. In Armin Biere and Carla P. Gomes, editors, Theory and Applications of Satisfiability Testing - SAT 2006, pages 424–429, Berlin, Heidelberg,
2006. Springer Berlin Heidelberg.
57. Emina Torlak. A Constraint Solver for Software Engineering: Finding Models and
Cores of Large Relational Specifications. PhD thesis, Cambridge, MA, USA, 2009.
AAI0821754.
58. Emina Torlak and Daniel Jackson. Kodkod: A relational model finder. In TACAS,
2007.
59. Caroline Trippel, Daniel Lustig, and Margaret Martonosi. CheckMate: Automated
synthesis of hardware exploits and security litmus tests. In MICRO, 2018.
60. G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus, pages
466–483. 1983.
61. Alasdair Urquhart. The symmetry rule in propositional logic. Discrete Applied
Mathematics, 96-97:177 – 193, 1999.
62. Muhammad Usman, Wenxi Wang, and Sarfraz Khurshid. TestMC: A framework
for testing model counters. Under submission, 2020.
133
43. Hakan Metin, Souheib Baarir, Maximilien Colange, and Fabrice Kordon. Cdclsym:
Introducing effective symmetry breaking in sat solving. In International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, pages 99–
114. Springer, 2018.
44. Quoc-Sang Phan and Pasquale Malacaria. Abstract model counting: a novel approach for quantification of information leaks. In 9th ACM Symposium on Information, Computer and Communications Security, pages 283–292, 2014.
45. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall Press, 2009.
46. Karem Sakallah. Symmetry and satisfiability. Frontiers in Artificial Intelligence
and Applications, 185, 01 2009.
47. Marko Samer and Stefan Szeider. Algorithms for propositional model counting.
Journal of Discrete Algorithms, 8(1):50–64, 2010.
48. Hesam Samimi, Ei Darli Aung, and Todd D. Millstein. Falling back on executable
specifications. In ECOOP, pages 552–576, 2010.
49. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, and Toniann Pitassi.
Combining component caching and clause learning for effective model counting. In
SAT, 2004.
50. Shubham Sharma, Subhajit Roy, Mate Soos, and Kuldeep S. Meel. GANAK: A
scalable probabilistic exact model counter. In IJCAI, pages 1169–1176, 2019.
51. Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search
problems. In Proc. Workshop on Theory and Applications of Satisfiability Testing, June 2001.
52. Mate Soos and Kuldeep S. Meel. Bird: Engineering an efficient cnf-xor sat solver
and its applications to approximate model counting. In Proceedings of AAAI Conference on Artificial Intelligence (AAAI), 1 2019.
53. Mate Soos, Karsten Nohl, and Claude Castelluccia. Extending SAT solvers to cryptographic problems. In Theory and Applications of Satisfiability Testing (SAT),
pages 244–257, 2009.
54. Larry Stockmeyer. The complexity of approximate counting. In Proceedings of
the Fifteenth Annual ACM Symposium on Theory of Computing, STOC ’83, pages
118–126, New York, NY, USA, 1983. ACM.
55. Allison Sullivan, Kaiyuan Wang, Razieh Nokhbeh Zaeem, and Sarfraz Khurshid.
Automated test generation and mutation testing for Alloy. In ICST, 2017.
56. Marc Thurley. SharpSAT – Counting models with advanced component caching
and implicit BCP. In Armin Biere and Carla P. Gomes, editors, Theory and Applications of Satisfiability Testing - SAT 2006, pages 424–429, Berlin, Heidelberg,
2006. Springer Berlin Heidelberg.
57. Emina Torlak. A Constraint Solver for Software Engineering: Finding Models and
Cores of Large Relational Specifications. PhD thesis, Cambridge, MA, USA, 2009.
AAI0821754.
58. Emina Torlak and Daniel Jackson. Kodkod: A relational model finder. In TACAS,
2007.
59. Caroline Trippel, Daniel Lustig, and Margaret Martonosi. CheckMate: Automated
synthesis of hardware exploits and security litmus tests. In MICRO, 2018.
60. G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus, pages
466–483. 1983.
61. Alasdair Urquhart. The symmetry rule in propositional logic. Discrete Applied
Mathematics, 96-97:177 – 193, 1999.
62. Muhammad Usman, Wenxi Wang, and Sarfraz Khurshid. TestMC: A framework
for testing model counters. Under submission, 2020.