Abstract
The 2009 CAV (Computer-Aided Verification) award was presented to seven individuals who made major advances in creating high-performance Boolean satisfiability solvers. This annual award recognizes a specific fundamental contribution or series of outstanding contributions to the CAV field.
Similar content being viewed by others
References
Davis M, Putnam H (1960) A computing procedure for quantification theory. J ACM 7(3):201–215
Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Commun ACM 5(7):394–397
Marques-Silva JP, Sakallah KA (1996) GRASP—A new search algorithm for satisfiability. In: 1996 international conference on computer-aided design, pp 220–227
Moskewicz M, Madigan C, Zhao Y, Zhang L, Malik S (2001) Chaff: Engineering an efficient SAT solver. In: 38th design automation conference
Weber T (2005) A SAT-based Sudoku solver. In: Sutcliffe G, Voronkov A (eds) International conference on logic for programming, artificial intelligence, and reasoning, pp 11–15
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bryant, R.E., Grumberg, O., Sifakis, J. et al. 2009 CAV award announcement. Form Methods Syst Des 36, 195–197 (2010). https://doi.org/10.1007/s10703-010-0094-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10703-010-0094-9