1 |
E. M. Clarke, O. Grumberg and D. Peled, Model Checking, MIT Press, 1999
|
2 |
A. Biere, A. Cimatti, E. Clarke, Ofer Strichman, and Y. Zhu, "Bounded Model Checking," Vol. 58 of Advances in Computers, 2003
|
3 |
http://en.wikipedia.org/wiki/Nonogram
|
4 |
M.W. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, "Chaff: Engineering an Efficient SAT Solver," In Proceedings of Design Automation Conference, 2001.
|
5 |
O.Bailleux and Y. Boufkhad, "Efficient CNF encoding of Boolean cardinality constraints," in Proceedings of the CP 2003, vol. 2833, LNCS, 2003
|
6 |
http://alloy.mit.edu/
|
7 |
G.J. Holzmann, The SPIN Model Checker, Addsion Wesley, 2004
|
8 |
M. Merritt, A. Orda, and S.R. Sachs, "Formal Verification of a Distributed Computer System," In Formal Methods in System Design Journal, Kluwer Academic Publisher, vol. 10, pp. 93-125, 1997
|
9 |
B. Benhamou, L. Sais and P. Siegel, "Two proof procedures for a cardinality based language in propositional calculus," in Proceedings of the STACS94, vol. 775, LNCS, 1994
|
10 |
http://www.cs.chalmers.se/Cs/Research/For-malMethods/MiniSat/
|
11 |
C. Sinz, "Towards an optimal CNF encoding of Boolean cardinality constraints," In Proceedings of the CP 2005, vol. 3709, LNCS, 2005
|
12 |
S.M. Suhaib and D. BernerM, "Extreme Modeling in PROMELA: Formal Modeling and Verification of a Smart Building Control System," FERMAT Lab Technical Report No. 2003-11. Virginia Tech, Blacksburg, VA, December 2003
|
13 |
B. J. Batenburg and W. A. Kosters, "A discrete tomography approach to Japanese puzzles," in Proceedings of the Belgian-Dutch Conf. Artificial Intelligence, 2004
|
14 |
G. Kwon and W. Klieber, "Efficient CNF Encoding for Selecting 1 from N Objects," In the Proceeding of CFV07, 2007
|