132
W. Wang et al.
21. James Crawford, Matthew Ginsberg, Eugene Luks, and Amitabha Roy. Symmetrybreaking predicates for search problems. KR, 96:148–159, 1996.
22. Adnan Darwiche and Pierre Marquis. A knowledge compilation map. J. Artif. Int.
Res., 17(1):229–264, September 2002.
23. Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, and Marc Denecker. Improved
static symmetry breaking for SAT. In TACAS, pages 104–122, 2016.
24. Jeffrey Dudek, Kuldeep S. Meel, and Moshe Y. Vardi. Combining the k-cnf and xor
phase-transitions. In Proceedings of International Joint Conference on Artificial
Intelligence (IJCAI), 7 2016.
25. Niklas Eén and Niklas Sörensson. An extensible SAT-solver. In Enrico Giunchiglia
and Armando Tacchella, editors, Theory and Applications of Satisfiability Testing,
pages 502–518, 2004.
26. Antonio Filieri, Corina S. Păsăreanu, and Willem Visser. Reliability analysis in
symbolic pathfinder. In International Conference on Software Engineering, pages
622–631, 2013.
27. J. P. Galeotti, N. Rosner, C. G. López Pombo, and M. F. Frias. Taco: Efficient
SAT-based bounded verification using symmetry breaking and tight bounds. Transactions on Software Engineering, 2013.
28. Jaco Geldenhuys, Matthew B. Dwyer, and Willem Visser. Probabilistic symbolic
execution. In International Symposium on Software Testing and Analysis, pages
166–176, 2012.
29. Ian P. Gent, Karen E. Petrie, and Jean-François Puget. Symmetry in constraint
programming. In Handbook of Constraint Programming, pages 329–376. 2006.
30. Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, and Bart Selman. Short XORs
for model counting: From theory to practice. In Theory and Applications of Satisfiability Testing (SAT), pages 100–106, 2007.
31. Carla P. Gomes, Ashish Sabharwal, and Bart Selman. Model counting: A new
strategy for obtaining good bounds. In 21st National Conference on Artificial
Intelligence - Volume 1, pages 54–61, 2006.
32. Divya Gopinath, Muhammad Zubair Malik, and Sarfraz Khurshid. Specificationbased program repair using SAT. In TACAS, pages 173–188, 2011.
33. Jinbo Huang and Adnan Darwiche. Dpll with a trace: From sat to knowledge
compilation. In IJCAI, volume 5, pages 156–162, 2005.
34. Daniel Jackson. Software Abstractions: Logic, Language, and Analysis. The MIT
Press, 2006.
35. Daniel Jackson and Kevin J. Sullivan. COM revisited: Tool-assisted modelling of
an architectural framework. In SIGSOFT FSE, pages 149–158, 2000.
36. Daniel Jackson and Mandana Vaziri. Finding bugs with a constraint solver. In
ISSTA, August 2000.
37. Sarfraz Khurshid and Daniel Jackson. Exploring the design of an intentional naming scheme with an automatic constraint analyzer. In ASE, pages 13–22, 2000.
38. Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, and Daniel Jackson. A case for
efficient solution enumeration. In SAT, pages 272–286, 2003.
39. Seonmo Kim and Stephen McCamant. Bit-vector model counting using statistical
estimation. In TACAS (1), pages 133–151, 2018.
40. Jean-Marie Lagniez and Pierre Marquis. A recursive algorithm for projected model
counting. AAAI, 33:1536–1543, 2019.
41. Loi Luu, Shweta Shinde, Prateek Saxena, and Brian Demsky. A model counter for
constraints over unbounded strings. SIGPLAN Not., 49(6):565–576, June 2014.
42. Darko Marinov and Sarfraz Khurshid. TestEra: A novel framework for automated
testing of Java programs. In ASE, 2001.
W. Wang et al.
21. James Crawford, Matthew Ginsberg, Eugene Luks, and Amitabha Roy. Symmetrybreaking predicates for search problems. KR, 96:148–159, 1996.
22. Adnan Darwiche and Pierre Marquis. A knowledge compilation map. J. Artif. Int.
Res., 17(1):229–264, September 2002.
23. Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, and Marc Denecker. Improved
static symmetry breaking for SAT. In TACAS, pages 104–122, 2016.
24. Jeffrey Dudek, Kuldeep S. Meel, and Moshe Y. Vardi. Combining the k-cnf and xor
phase-transitions. In Proceedings of International Joint Conference on Artificial
Intelligence (IJCAI), 7 2016.
25. Niklas Eén and Niklas Sörensson. An extensible SAT-solver. In Enrico Giunchiglia
and Armando Tacchella, editors, Theory and Applications of Satisfiability Testing,
pages 502–518, 2004.
26. Antonio Filieri, Corina S. Păsăreanu, and Willem Visser. Reliability analysis in
symbolic pathfinder. In International Conference on Software Engineering, pages
622–631, 2013.
27. J. P. Galeotti, N. Rosner, C. G. López Pombo, and M. F. Frias. Taco: Efficient
SAT-based bounded verification using symmetry breaking and tight bounds. Transactions on Software Engineering, 2013.
28. Jaco Geldenhuys, Matthew B. Dwyer, and Willem Visser. Probabilistic symbolic
execution. In International Symposium on Software Testing and Analysis, pages
166–176, 2012.
29. Ian P. Gent, Karen E. Petrie, and Jean-François Puget. Symmetry in constraint
programming. In Handbook of Constraint Programming, pages 329–376. 2006.
30. Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, and Bart Selman. Short XORs
for model counting: From theory to practice. In Theory and Applications of Satisfiability Testing (SAT), pages 100–106, 2007.
31. Carla P. Gomes, Ashish Sabharwal, and Bart Selman. Model counting: A new
strategy for obtaining good bounds. In 21st National Conference on Artificial
Intelligence - Volume 1, pages 54–61, 2006.
32. Divya Gopinath, Muhammad Zubair Malik, and Sarfraz Khurshid. Specificationbased program repair using SAT. In TACAS, pages 173–188, 2011.
33. Jinbo Huang and Adnan Darwiche. Dpll with a trace: From sat to knowledge
compilation. In IJCAI, volume 5, pages 156–162, 2005.
34. Daniel Jackson. Software Abstractions: Logic, Language, and Analysis. The MIT
Press, 2006.
35. Daniel Jackson and Kevin J. Sullivan. COM revisited: Tool-assisted modelling of
an architectural framework. In SIGSOFT FSE, pages 149–158, 2000.
36. Daniel Jackson and Mandana Vaziri. Finding bugs with a constraint solver. In
ISSTA, August 2000.
37. Sarfraz Khurshid and Daniel Jackson. Exploring the design of an intentional naming scheme with an automatic constraint analyzer. In ASE, pages 13–22, 2000.
38. Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, and Daniel Jackson. A case for
efficient solution enumeration. In SAT, pages 272–286, 2003.
39. Seonmo Kim and Stephen McCamant. Bit-vector model counting using statistical
estimation. In TACAS (1), pages 133–151, 2018.
40. Jean-Marie Lagniez and Pierre Marquis. A recursive algorithm for projected model
counting. AAAI, 33:1536–1543, 2019.
41. Loi Luu, Shweta Shinde, Prateek Saxena, and Brian Demsky. A model counter for
constraints over unbounded strings. SIGPLAN Not., 49(6):565–576, June 2014.
42. Darko Marinov and Sarfraz Khurshid. TestEra: A novel framework for automated
testing of Java programs. In ASE, 2001.