Skip to main content
Log in

2009 CAV award announcement

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Davis M, Putnam H (1960) A computing procedure for quantification theory. J ACM 7(3):201–215

    Article  MATH  MathSciNet  Google Scholar 

  2. Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Commun ACM 5(7):394–397

    Article  MATH  MathSciNet  Google Scholar 

  3. Marques-Silva JP, Sakallah KA (1996) GRASP—A new search algorithm for satisfiability. In: 1996 international conference on computer-aided design, pp 220–227

  4. Moskewicz M, Madigan C, Zhao Y, Zhang L, Malik S (2001) Chaff: Engineering an efficient SAT solver. In: 38th design automation conference

  5. 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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Randal E. Bryant.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10703-010-0094-9

Keywords

Navigation