Références

• Turing Lecture: Model Checking: Algorithmic Verification and Debugging, Edmund M. Clarke, E. Allen Emerson, Joseph Sifakis, Communications of the ACM, Vol. 52 No. 11, 2009, Pages 74-84, 10.1145/1592761.1592781.
• A machine program for theorem-proving, Martin Davis, George Logemann, Donald Loveland, Communications of the ACM, Volume 5 Issue 7, July 1962 , Pages 394-397,10.1145/368273.368557.
• A Computing Procedure for Quantification Theory, Martin Davis, Hilary Putnam, Journal of the ACM, Volume 7 Issue 3, July 1960, Pages 201-215, ACM New York, NY, USA, 10.1145/321033.321034.
• Graph-Based Algorithms for Boolean Function Manipulation, R.E. Bryant, IEEE Transactions on Computers, Volume:C-35 , Issue:8, 1986, P. 677 - 691, 10.1109/TC.1986.1676819.
• Boolean satisfiability from theoretical hardness to practical success, Sharad Malik, Lintao Zhang, Communications of the ACM, Volume 52 Issue 8, August 2009, Pages 76-82, 10.1145/1536616.1536637.

Pour tout commentaire, vous adresser à