Biedenkapp A, Lindauer M, Eggensperger K, Hutter F, Fawcett C and Hoos H. Efficient parameter importance analysis via ablation with surrogates. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence. (773-779).

(2017). The Configurable SAT Solver Challenge (CSSC). Artificial Intelligence. 243:C. (1-25). Online publication date: 1-Feb-2017.

https://doi.org/10.1016/j.artint.2016.09.006

Lal A and Qadeer S. A Program Transformation for Faster Goal-Directed Search. Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design. (147-154).

/doi/10.5555/2682923.2682951

Li Y, Cheung S, Zhang X and Liu Y. (2014). Scaling Up Symbolic Analysis by Removing Z-Equivalent States. ACM Transactions on Software Engineering and Methodology. 23:4. (1-32). Online publication date: 5-Sep-2014.

https://doi.org/10.1145/2652484

Leyton-Brown K, Hoos H, Hutter F and Xu L. (2014). Understanding the empirical hardness of NP-complete problems. Communications of the ACM. 57:5. (98-107). Online publication date: 1-May-2014.

https://doi.org/10.1145/2594413.2594424

Komuravelli A, Gurfinkel A, Chaki S and Clarke E. Automatic Abstraction in SMT-Based Unbounded Software Model Checking. Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044. (846-862).

/doi/10.5555/2958031.2958060

Zhu H and Jagannathan S. Compositional and Lightweight Dependent Type Inference for ML. Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737. (295-314).

https://doi.org/10.1007/978-3-642-35873-9_19

Sinha N, Singhania N, Chandra S and Sridharan M. Alternate and learn. Proceedings of the 24th international conference on Computer Aided Verification. (599-615).

https://doi.org/10.1007/978-3-642-31424-7_42

Hoos H. (2012). Programming by optimization. Communications of the ACM. 55:2. (70-80). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076469

Ivancic F, Balakrishnan G, Gupta A, Sankaranarayanan S, Maeda N, Tokuoka H, Imoto T and Miyazaki Y. DC2. Proceedings of the 26th IEEE/ACM International Conference on Automated Software Engineering. (133-142).

https://doi.org/10.1109/ASE.2011.6100046

Balakrishnan G, Maeda N, Sankaranarayanan S, Ivančić F, Gupta A and Pothengil R. Modeling and analyzing the interaction of C and C++ strings. Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software. (67-85).

https://doi.org/10.1007/978-3-642-31762-0_6

Sinha N. Modular bug detection with inertial refinement. Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design. (199-206).

/doi/10.5555/1998496.1998533

Monnet A and Villemaire R. Scalable formula decomposition for propositional satisfiability. Proceedings of the Third C* Conference on Computer Science and Software Engineering. (43-52).

https://doi.org/10.1145/1822327.1822333

Elkarablieh B, Godefroid P and Levin M. Precise pointer reasoning for dynamic test generation. Proceedings of the eighteenth international symposium on Software testing and analysis. (129-140).

https://doi.org/10.1145/1572272.1572288

Sinha N. Symbolic program analysis using term rewriting and generalization. Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design. (1-9).

/doi/10.5555/1517424.1517443

Hagen G and Tinelli C. Scaling up the formal verification of Lustre programs with SMT-based techniques. Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design. (1-9).

/doi/10.5555/1517424.1517439

He N and Hsiao M. A new testability guided abstraction to solving bit-vector formula. Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning. (39-45).

https://doi.org/10.1145/1512464.1512473

Ganai M and Gupta A. Tunneling and slicing. Proceedings of the 45th annual Design Automation Conference. (137-142).

https://doi.org/10.1145/1391469.1391507

Babic D and Hu A. Calysto. Proceedings of the 30th international conference on Software engineering. (211-220).

https://doi.org/10.1145/1368088.1368118

Letombe F and Marques-Silva J. Improvements to hybrid incremental SAT algorithms. Proceedings of the 11th international conference on Theory and applications of satisfiability testing. (168-181).

/doi/10.5555/1789854.1789871

Anand S, Godefroid P and Tillmann N. Demand-driven compositional symbolic execution. Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems. (367-381).

/doi/10.5555/1792734.1792771

Arons T, Elster E, Ozer S, Shalev J and Singerman E. Efficient symbolic simulation of low level software. Proceedings of the conference on Design, automation and test in Europe. (825-830).

https://doi.org/10.1145/1403375.1403577

Babić D and Hu A. Exploiting shared structure in software verification conditions. Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing. (169-184).

/doi/10.5555/1787497.1787519

Rakamarić Z, Bruttomesso R, Hu A and Cimatti A. Verifying heap-manipulating programs in an SMT framework. Proceedings of the 5th international conference on Automated technology for verification and analysis. (237-252).

/doi/10.5555/1779046.1779066