• 24. 2. 2017 - Arrangements
• 3. 3. 2017 - Martin Jonáš - Introduction to SMT solving (slides)
• 10. 3. 2017 - Fanda Blahoudek - Combination of Theories
• 17. 3. 2017 - Honza Tušil - L. Hadarean, K. Bansal, D. Jovanović, C. Barrett, C. Tinelli: A Tale Of Two Solvers: Eager and Lazy Approaches to Bit-Vectors, CAV 2014
• 24. 3. 2017 - Martin Jonáš - Abstract Conflict-Driven Clause Learning
• 31. 3. 2017 - Martina Vitovská - A. Zeljic, C. M. Wintersteiger: Deciding Bit-Vector Formulas with mcSAT, SAT 2016
• 7. 4. 2017 - Vláďa Štill - G. Kovásznai, A. Fröhlich, A, Biere: Complexity of Fixed-Size Bit-Vector Logics, TOCS 59(2), 2016
• (14. 4. 2017 - Easter)
• 21. 4. 2017 - Fanda Blahoudek - Seminator: On semi-determinization of omega-automata
• 28. 4. 2017 - replaced by ETAPS 2017
• 5. 5. 2017 - Marek Chalupa - M. Preiner, A. Niemetz, A. Biere: Counterexample-Guided Model Synthesis, TACAS 2017
• 12. 5. 2017 - Viki Vozárová - A. Griggio: Effective word-level interpolation for software verification, FMCAD 2011
• 19. 5. 2017 - Katka Sloupová - A. Zeljić, C. M. Wintersteiger, P. Rümmer: An Approximation Framework for Solvers and Decision Procedures,  J. Autom. Reason. 58(1), 2017

Papers on SAT/SMT solving:

• M. Heule, O. Kullmann, S. Wieringa, A. Biere: Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads, Haifa Verification Conference 2011.
• J. P. Inala, R. Singh, A. Solar-Lezama: Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers, SAT 2016.
• A. Fröhlich, A. Biere, C. M. Wintersteiger, Y. Hamadi: Stochastic Local Search for Satisfiability Modulo Theories, AAAI 2015.
• M. Brain, V. D’Silva, A. Griggio, L. Haller, D. Kroening, Deciding floating-point logic with abstract conflict driven clause learning, FMSD 2014.
• Selected chapters from the Handbook of Satisfiability

Papers on slicing:

• S. Horwitz and T. W. Reps: The Use of Program Dependence Graphs in Software Engineering, ICSE 1992.
• D. W. Binkley and K. B. Gallagher: Program Slicing, Advances in Computers 43, 1996.
• S. Staiger-Stoehr: Practical integrated analysis of pointers, dataflow and control flow, ACM Trans. Program. Lang. Syst. 35(1), 2013.
• M. Aung, S. Horwitz, R. Joiner, and T. W. Reps: Specialization Slicing, ACM Trans. Program. Lang. Syst. 36(2), 2014.
• J. Silva: A Vocabulary of Program Slicing-Based Techniques, ACM Comput. Surv. 44(3), 2012.

Papers on games and synthesis:

• K. Chatterjee, M. Henzinger, and V. Loitzenbauer: Improved Algorithms for One-Pair and k-Pair Streett Objectives, LICS 2015
• R. Bodik and B. Jobstmann: Algorithmic program synthesis: introduction, STTT 15(5-6), 2013.

Others papers to present:

• K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop: Edit Distance for Pushdown Automata, ICALP 2015.
• A. Das, S. K. Lahiri, A. Lal, and Y. Li: Angelic Verification: Precise Verification Modulo Unknowns, CAV 2015.
• K. R. M. Leino and V. Wüstholz: Fine-Grained Caching of Verification Results, CAV 2015.
• Y. Demyanova, T. Pani, H. Veith, and F. Zuleger: Empirical Software Metrics for Benchmarking of Verification Tools, CAV 2015.
• R. Singh and S. Gulwani: Predicting a Correct Program in Programming by Example, CAV 2015.
• A. Farzan, Z. Kincaid, and A. Podelski: Proofs that count, POPL 2014.
• B. Jeannet, P. Schrammel, and S. Sankaranarayanan: Abstract acceleration of general linear loops, POPL 2014.
• D. Kroening, M. Lewis, and G. Weissenbacher: Under-Approximating Loops in C Programs for Fast Counterexample Detection, CAV 2013.
• D. Vanoverberghe, N. Tillmann, and F. Piessens: Test Input Generation for Programs with Pointers, TACAS 2000.
• X. Deng, J. Lee, and Robby: Efficient and formal generalized symbolic execution, Autom. Soft. Eng. 2011.
• S. Khurshid, C. S. Pasareanu, and W. Visser: Generalized Symbolic Execution for Model Checking and Testing, TACAS 2003.
• A. Colin and G. Bernat: Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis, ECRTS 2002.
• S. Gulwani, S. Jain, and E. Koskinen: Control-flow refinement and progress invariants for bound analysis, PLDI 2009.
• P. Godefroid and D. Luchaup: Automatic Partial Loop Summarization in Dynamic Test Generation, ISSTA 2011.
• K. Dudka, P. Peringer, and T. Vojnar: Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic, CAV 2011.
• C. Calcagno and D. Distefano: Infer: an Automatic Program Verifier for Memory Safety of C Programs, NFM 2011.
• The Calculus of Computation
• Counterexample-Guided Abstraction Refinement
• The SLAM Project: Debugging System Software via Static Analysis
• SLAM2: Static Driver Verification with Under 4% False Alarms