IA072 Seminar on Concurrency
Programme
- 25. 9. 2015 - Arrangements
- 2. 10. 2015 - Tomáš Brukner - CodeMonocle
- 9. 10. 2015 - Viktor Toman - T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Křetínský, M. Kwiatkowska, D. Parker, and M. Ujma: Verification of Markov Decision Processes Using Learning Algorithms, ATVA 2014.
- 14. 10. 2015 (10:00 Faculty of Law MU) - Tom Henzinger: doctor honoris causa
- 16. 10. 2015 - Martina Vitovská - S. Gulwani, K. K. Mehra, and T. Chilimbi: SPEED: Precise and Efficient Static Estimation of Program Computational Complexity, POPL 2009.
- 23. 10. 2015 - cancelled (MEMICS 2015)
- 30. 10. 2015 - cancelled (no speaker)
- 6. 11. 2015 - Martin Jonáš - part II of R. Nieuwenhuis, A. Oliveras, and C. Tinelli: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T), JACM 2006.
- 13. 11. 2015 - Martin Jonáš - Solving quantified bit-vector formulas using BDDs
- 20. 11. 2015 - cancelled
- 27. 11. 2015 - Vláďa Štill - Transformations and analysis of LLVM IR for model checking
- 4. 12. 2015 - Marek Chalupa - S. Staiger-Stoehr: Practical integrated analysis of pointers, dataflow and
control flow, ACM Trans. Program. Lang. Syst. 35(1), 2013. - 11. 12. 2015 -
Fanda Blahoudek - Efficient emptiness check for omega-automata with general acceptance conditioncancelled (speaker not available) - 18. 12. 2015 - Divine and Symbiotic teams meeting
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.
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.
Others papers to present:
-
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop: Edit Distance for Pushdown Automata, ICALP 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
Následující