Boosting verification by automatic tuning of decision procedures

Proceedings - Formal Methods in Computer Aided Design, FMCAD 2007

Volumn , Issue , 2007, Pages 27-34

  Hutter, Frank ^a   Babić, Domagoj ^a   Hoos, Holger H ^a   Hu, Alan J ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Boolean satisfiability; Decision procedures; Search parameter optimization

Indexed keywords

AUTOMATIC TUNING; BOUNDED MODEL; BOUNDED MODEL CHECKING (BMC); DECISION PROCEDURES; HAND-TUNING; MANUAL TUNING; PARAMETER OPTIMIZATION; PARAMETER SETTINGS; PARAMETERIZED; PERFORMANCE IMPROVEMENTS; PROBLEM INSTANCES; REAL WORLD; RUN TIMES; SAT SOLVER (SIM); SOFTWARE VERIFICATIONS;

ARTIFICIAL INTELLIGENCE; COMPUTER AIDED DESIGN; COMPUTER CONTROL; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LEAD; MODEL CHECKING; STRUCTURAL OPTIMIZATION; TUNING; VERIFICATION;

FORMAL METHODS;

EID: 47349133530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FAMCAD.2007.9     Document Type: Conference Paper

References (25)

1. R. E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Trans. Comput., vol. 35, no. 8, pp. 677-691, 1986.
2. M. R. Prasad, A. Biere, and A. Gupta, "A survey of recent advances in SAT-based formal verification." STTT: International Journal on Software Tools for Technology Transfer, vol. 7, no. 2, pp. 156-173, April 2005.
3. G. Nelson, "Techniques for program verification," Ph.D. dissertation, Stanford University, 1979.
4. J. P. M. Silva, "The Impact of Branching Heuristics in Propositional Satisfiability Algorithms," in EPIA '99: Proc. of the 9th Portuguese Conference on Artificial Intelligence, ser. LNCS, vol. 1695. Springer, 1999, pp. 62-74.
5. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: engineering an efficient SAT solver," in DAC '01: Proc. of the 38th conference on Design automation. ACM Press, 2001, pp. 530-535.
6. A. Bhalla, I. Lynce, J. de Sousa, and J. Marques-Silva, "Heuristic backtracking algorithms for SAT," in MTV '03: Proc. of the 4th International Workshop on Microprocessor Test and Verification: Common Challenges and Solutions, 2003, pp. 69-74.
7. F. Hutter, H. H. Hoos, and T. Stützle, "Automatic algorithm configuration based on local search," in AAAI '07: Proc. of the Twenty-Second Conference on Artifical Intelligence, 2007, pp. 1152-1157.
8. D. Babić and A. J. Hu, "Structural Abstraction of Software Verification Conditions," in Computer Aided Verification: 19th International Conference, CAV 2007, ser. LNCS, vol. 4590. Springer, 2007, pp. 366-378.
9. N. Eén and N. Sörensson, "An extensible SAT solver," in SAT '03: Proc. of the 6th International Conference on theory and Applications of Satisfiability Testing, ser. LNCS, vol. 2919. Springer, 2003, pp. 502-518.
10. S. A. Seshia, "Adaptive eager boolean encoding for arithmetic reasoning in verification," School of Computer Science, Carnegie Mellon University, Tech. Rep. CMU-CS-05-134, May 2005.
11. O. Shtrichman, "Tuning SAT checkers for bounded model checking," in CAV '00: Proc. of the 12th International Conference on Computer Aided Verification, ser. LNCS, vol. 1855. Springer, 2000, pp. 480-494.
12. O. Shacham and E. Zarpas, "Tuning the VSIDS Decision Heuristic for Bounded Model Checking," in Fourth International Workshop on Microprocessor Test and Verification, Common Challenges and Solutions (MTV 2003), May 29-30, 2003, Hyatt Town Lake Hotel, Austin, Texas, USA. IEEE Computer Society, 2003, pp. 75-79.
13. F. Lu, L.-C. Wang, K.-T. T. Cheng, J. Moondanos, and Z. Hanna, "A signal correlation guided ATPG solver and its applications for solving difficult industrial cases," in DAC '03: Proc. of the 40th conference on Design automation. ACM Press, 2003, pp. 436-441.
14. J. C. Spall, Introduction to Stochastic Search and Optimization, ser. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., 2003.
15. B. Adenso-Diaz and M. Laguna, "Fine-tuning of algorithms using fractional experimental design and local search," Operations Research, vol. 54, no. 1, pp. 99-114, Jan-Feb 2006.
16. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp, "A racing algorithm for configuring metaheuristics," in GECCO '02: Proc. of the Genetic and Evolutionary Computation Conference, 2002, pp. 11-18.
17. M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem-proving," Commun. ACM, vol. 5, no. 7, pp. 394-397, 1962.
18. D. Babić and M. Musuvathi, "Modular Arithmetic Decision Procedure," Microsoft Research Redmond, Tech. Rep. TR-2005-114, 2005.
19. D. Babić and A. J. Hu, "Exploiting Shared Structure in Software Verification Conditions," in submission.
20. D. Jackson, "Automating first-order relational logic," SIGSOFT Softw. Eng. Notes, vol. 25, no. 6, pp. 130-139, 2000.
21. H. R. Lourenço, O. C. Martin, and T. Stützle, "Iterated local search," in Handbook of Metaheuristics. Kluwer, 2002, pp. 321-353.
22. H. H. Hoos and T. Stützle, Stochastic Local Search - Foundations & Applications. Morgan Kaufmann, 2005.
23. E. Zarpas, "Benchmarking SAT Solvers for Bounded Model Checking," in SAT '05: Proc. of the 8th International Conference on Theory and Applications of Satisfiability Testing, ser. LNCS, vol. 3569. Springer, 2005, pp. 340-354.
24. F. Hutter, Y. Hamadi, H. H. Hoos, and K. Leyton-Brown, "Performance prediction and automated tuning of randomized and parametric algorithms," in CP '06: Proc. of the Twelfth International Conference on Principles and Practice of Constraint Programming, 2006, pp. 213-228.
25. R. Battiti and M. Brunato, Approximation Algorithms and Metaheuristics. CRC Press, 2007, ch. 21: Reactive Search: Machine Learning for Memory-based Heuristics, pp. 21-1 - 21-17.