[1]

Domagoj Babic and Alan J. Hu. Calysto: Scalable and Precise Extended Static Checking. International Conference on Software Engineering (ICSE), 2008.

[2]

Mike Barnett and K. Rustan M. Leino. Weakest-precondition of unstructured programs. SIGSOFT Softw. Eng. Notes 31, 1, 82-87, 2005.

[3]

Clark Barrett, Roberto Sebastiani, Sanjit A. Seshia, and Cesare Tinelli. Satisfiability Modulo Theories. Handbook of Satisfiability, Chapter 12, 2008.

[4]

Aaron Bradley and Zohar Manna. Combining Decision Procedures. The Calculus of Computation, Chapter 10, 2010.

[5]

Aaron Bradley and Zohar Manna. Propositional Logic. The Calculus of Computation, Chapter 1, 2010.

[6]

Aaron Bradley and Zohar Manna. Quantifier-Free Equality and Data Structures. The Calculus of Computation, Chapter 9, 2010.

[7]

Cristian Cadar, Patrice Godefroid, Sarfraz Khurshid, Corina S. Pasareanu, Koushik Sen, Nikolai Tillmann, and Willem Visser. Symbolic execution for software testing in practice: preliminary assessment. International Conference on Software Engineering (ICSE), 2011.

[8]

Koen Claessen and Niklas Sorensson. New techniques that improve MACE-style finite model finding. CADE-19 Workshop: Model Computation—Principles, Algorithms, Applications, 2003.

[9]

Edmund M. Clarke and Bernd-Holger Schlingloff. Model checking. Handbook of automated reasoning, Alan Robinson and Andrei Voronkov (Eds.). Elsevier Science Publishers B. V., Amsterdam, The Netherlands, The Netherlands 1635-1790, 2001.

[10]

Greg Dennis, Felix Sheng-Ho Chang, and Daniel Jackson. Modular Verification of Code with SAT. International Symposium on Software Testing and Analysis (ISSTA), 2007.

[11]

Julian Dolby, Mandana Vaziri, and Frank Tip. Finding bugs efficiently with a SAT solver. Foundations of Software Engineering (FSE), 2007.

[12]

E. Allen Emerson. The Beginning of Model Checking: A Personal Perspective. 25 Years of Model Checking, Orna Grumberg and Helmut Veith (Eds.). Lecture Notes In Computer Science, Vol. 5000. Springer-Verlag, Berlin, Heidelberg 27-45, 2008.

[13]

Carla P. Gomes, Henry Kautz, Ashish Sabharwal, and Bart Selman. Satisfiability Solvers. Handbook of Knowledge Representation, Chapter 2, 2008.

[14]

C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM 12, 10, 576-580, 1969.

[15]

Ranjit Jhala and Rupak Majumdar. Software model checking. ACM Comput. Surv. 41, 4, Article 21, 2009.

[16]

Sudipta Kundu, Zachary Tatlock, and Sorin Lerner. Proving optimizations correct using parameterized program equivalence. Programming Language Design and Implementation (PLDI), 2009.

[17]

Ali Sinan Köksal, Viktor Kuncak, and Philippe Suter. Constraints as control. Principles of Programming Languages (POPL), 2012.

[18]

Joao Marques-Silva, Ines Lynce, and Sharad Malik. Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability, Chapter 4, 2008.

[19]

Aleksandar Milicevic, Derek Rayside, Kuat Yessenov, and Daniel Jackson. Unifying execution of imperative and declarative code. International Conference on Software Engineering (ICSE), 2011.

[20]

Leonardo de Moura and Nikolaj Bjorner. Satisfiability Modulo Theories: Introduction and Applications. Communications of the ACM, vol. 54, no. 9, 2011.

[21]

Hesam Samimi, Ei Darli Aung, and Todd Millstein. Falling back on executable specifications. European conference on Object-oriented programming (ECOOP), 2010.

[22]

Armando Solar-Lezama, Liviu Tancau, Rastislav Bodik, Sanjit Seshia, and Vijay Saraswat. Combinatorial sketching for finite programs. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2006.

[23]

Chris Tucker, David Shuffelton, Ranjit Jhala, and Sorin Lerner. OPIUM: Optimal Package Install/Uninstall Manager. International Conference on Software Engineering (ICSE), 2007.