A Study of Symmetry Breaking Predicates and Model Counting
131
References
1. Alloy GitHub repository, 2019.
https://github.com/AlloyTools/org.
alloytools.alloy.
2. Alloy models repository, 2019. https://github.com/AlloyTools/models.
3. BreakID BitBucket repository, 2019. https://bitbucket.org/krr/breakid/src/
master/.
4. Kodkod examples repository, 2019. https://github.com/emina/kodkod/tree/
master/examples.
5. Kodkod GitHub repository, 2019. https://github.com/emina/kodkod.
6. The on-line encyclopedia of integer sequences, 2019. https://oeis.org/.
7. Alyas Almaawi, Nima Dini, Cagdas Yelen, Milos Gligoric, Sasa Misailovic, and
Sarfraz Khurshid. Predictive constraint solving and analysis. In International Conference on Software Engineering, New Ideas and Emerging Results (ICSE-NIER),
2020. To appear.
8. Fadi A. Aloul, Igor L. Markov, and Karem A. Sakallah. Shatter: Efficient
symmetry-breaking for boolean satisfiability. In 40th Annual Design Automation
Conference, pages 836–839, 2003.
9. Abdulbaki Aydin, Lucas Bang, and Tevfik Bultan. Automata-based model counting
for string constraints. In CAV (1), volume 9206 of Lecture Notes in Computer
Science, pages 255–272, 2015.
10. Rehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, and Peter J. Stuckey. Projected model counting. CoRR, abs/1507.07648, 2015.
11. Hamid Bagheri, Eunsuk Kang, Sam Malek, and Daniel Jackson. A formal approach
for detection of security flaws in the android permission system. Formal Asp.
Comput., 30(5):525–544, 2018.
12. Roberto J. Bayardo, Jr., and J. D. Pehoushek. Counting models using connected
components. In In AAAI, pages 157–162, 2000.
13. Mateus Borges, Antonio Filieri, Marcelo d’Amorim, Corina S. Păsăreanu, and
Willem Visser. Compositional solution space quantification for probabilistic software analysis. SIGPLAN Not., 49(6):123–132, June 2014.
14. Chandrasekhar Boyapati, Sarfraz Khurshid, and Darko Marinov. Korat: Automated testing based on Java predicates. In ISSTA, pages 123–133, 2002.
15. Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, and Moshe Y. Vardi. Approximate probabilistic inference via word-level counting. In Proc. of AAAI, 2016.
16. Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. A scalable approximate model counter. In Proc. of CP, pages 200–216, 2013.
17. Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to
logarithmic SAT calls. In Proc. of IJCAI, 2016.
18. Nathan Chong, Tyler Sorensen, and John Wickerson. The semantics of transactions
and weak memory in x86, Power, ARM, and C++. SIGPLAN Not., 53(4):211–225,
2018.
19. David Clark, Sebastian Hunt, and Pasquale Malacaria. Quantitative analysis of
the leakage of confidential data. Electr. Notes Theor. Comput. Sci., 59(3):238–251,
2001.
20. James Crawford. A theoretical analysis of reasoning by symmetry in first-order
logic (extended abstract). In Workshop notes, AAAI-92 workshop on tractable
reasoning, 1992.
131
References
1. Alloy GitHub repository, 2019.
https://github.com/AlloyTools/org.
alloytools.alloy.
2. Alloy models repository, 2019. https://github.com/AlloyTools/models.
3. BreakID BitBucket repository, 2019. https://bitbucket.org/krr/breakid/src/
master/.
4. Kodkod examples repository, 2019. https://github.com/emina/kodkod/tree/
master/examples.
5. Kodkod GitHub repository, 2019. https://github.com/emina/kodkod.
6. The on-line encyclopedia of integer sequences, 2019. https://oeis.org/.
7. Alyas Almaawi, Nima Dini, Cagdas Yelen, Milos Gligoric, Sasa Misailovic, and
Sarfraz Khurshid. Predictive constraint solving and analysis. In International Conference on Software Engineering, New Ideas and Emerging Results (ICSE-NIER),
2020. To appear.
8. Fadi A. Aloul, Igor L. Markov, and Karem A. Sakallah. Shatter: Efficient
symmetry-breaking for boolean satisfiability. In 40th Annual Design Automation
Conference, pages 836–839, 2003.
9. Abdulbaki Aydin, Lucas Bang, and Tevfik Bultan. Automata-based model counting
for string constraints. In CAV (1), volume 9206 of Lecture Notes in Computer
Science, pages 255–272, 2015.
10. Rehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, and Peter J. Stuckey. Projected model counting. CoRR, abs/1507.07648, 2015.
11. Hamid Bagheri, Eunsuk Kang, Sam Malek, and Daniel Jackson. A formal approach
for detection of security flaws in the android permission system. Formal Asp.
Comput., 30(5):525–544, 2018.
12. Roberto J. Bayardo, Jr., and J. D. Pehoushek. Counting models using connected
components. In In AAAI, pages 157–162, 2000.
13. Mateus Borges, Antonio Filieri, Marcelo d’Amorim, Corina S. Păsăreanu, and
Willem Visser. Compositional solution space quantification for probabilistic software analysis. SIGPLAN Not., 49(6):123–132, June 2014.
14. Chandrasekhar Boyapati, Sarfraz Khurshid, and Darko Marinov. Korat: Automated testing based on Java predicates. In ISSTA, pages 123–133, 2002.
15. Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, and Moshe Y. Vardi. Approximate probabilistic inference via word-level counting. In Proc. of AAAI, 2016.
16. Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. A scalable approximate model counter. In Proc. of CP, pages 200–216, 2013.
17. Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to
logarithmic SAT calls. In Proc. of IJCAI, 2016.
18. Nathan Chong, Tyler Sorensen, and John Wickerson. The semantics of transactions
and weak memory in x86, Power, ARM, and C++. SIGPLAN Not., 53(4):211–225,
2018.
19. David Clark, Sebastian Hunt, and Pasquale Malacaria. Quantitative analysis of
the leakage of confidential data. Electr. Notes Theor. Comput. Sci., 59(3):238–251,
2001.
20. James Crawford. A theoretical analysis of reasoning by symmetry in first-order
logic (extended abstract). In Workshop notes, AAAI-92 workshop on tractable
reasoning, 1992.