Students will be graded based on:
1.) Ability to read and understand the papers assigned to them. The
effort and initiative to independently read and understand the paper
and to read up on related work will determine 50% of the grade. The
students' understanding of the paper will be evaluated during the
meetings with the lecturer and by means of questions after the talk.
2.) Ability to present the material in an accessible way to their fellow
students. The clarity and style of the presentation as well as the
students' effort to prepare the talk (e.g., by designing their own
examples rather than reusing material from the paper) determine 50% of
the grade.
Additional information on grading: The relative difficulty of the
paper will be taken into account. Asking meaningful questions about
the presentations of fellow students will have a positive impact
on the grade (attendance of these talks is compulsory).
--------------
ECTS Breakdown:
40 hours for reading papers and related work,
20 hours for preparing the presentation,
15 hours of attending talks and meetings with the lecturer.
---------------------------------------
75 hours (3 ECTS)
---------------------------------------
PAPERS TO CHOOSE FROM:
Papers proposed and to be supervised by Katalin Fazekas:
Travis Hance, Marijn Heule, Ruben Martins, Bryan Parno:
Finding Invariants of Distributed Systems: It's a Small (Enough) World After All
NSDI 2021
https://www.usenix.org/system/files/nsdi21-hance.pdf
Rohit Dureja, Arie Gurfinkel, Alexander Ivrii, Yakir Vizel:
IC3 with Internal Signals
FMCAD 2021
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_14
Miguel Terra-Neves, Nuno Machado, Inês Lynce, Vasco M. Manquinho:
Concurrency Debugging with MaxSMT
AAAI 2019
https://doi.org/10.1609/aaai.v33i01.33011608
Aman Goel, Karem A. Sakallah:
On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
NFM 2021
https://link.springer.com/chapter/10.1007/978-3-030-76384-8_9
Katalin Fazekas, Fahiem Bacchus, Armin Biere:
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories
IJCAR 2018
https://link.springer.com/chapter/10.1007/978-3-319-94205-6_10
Papers proposed and to be supervised by George Kenison:
George Kenison, Richard Lipton, Joel Ouaknine, James Worrell:
On the Skolem Problem and Prime Powers
ISSAC 2020
https://dl.acm.org/doi/10.1145/3373207.3404036
Florian Luca, Joel Ouaknine, James Worrell:
Universal Skolem Sets
LICS 2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470513
Ezio Bartocci, Laura Kovacs, Miroslav Stankovic:
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
ATVA 2019
https://doi.org/10.1007/978-3-030-31784-3_15
Andreas Humenberger, Nikolaj Bjorner, Laura Kovacs:
Algebra-Based Loop Synthesis
IFM 2020
https://doi.org/10.1007/978-3-030-63461-2_24
Florian Frohn, Marcel Hark, Jurgen Giesl:
Termination of Polynomial Loops
SAS 2020
https://doi.org/10.1007/978-3-030-65474-0_5
ORGANISATION:
The topics and the organization of the seminar will be discussed during the initial meeting on Monday, March 14, 11:00 (in a Zoom meeting; link will be sent to all registered participants).
Students signed up for the course who are unable to attend should contact us as soon as possible.
Students are expected to read assigned papers, search relevant literature and prepare scientific presentation on the paper. Students are expected to meet at least twice with their supervisors: once to clarify questions about the paper and to discuss an initial draft of their presentation, and once to discuss the full set of slides and improve the presentation.
Students signed up for the course who are unable to attend should contact us as soon as possible (email george.kenison@tuwien.ac.at).
Electronic versions of the papers will be provided to the students.
