Course: Algorithms, Complexity, and Security course
Eindhoven University of Technology, Eindhoven
Monday May 8 – Friday May 12, 2023
IPA organises Advanced Courses on each of its major research fields: Algorithmics and Complexity, Formal Methods and Software Technology. Each of these Advanced Courses intends to give an overview of (part of) the research of IPA in this specific field or related to this field or IPA.
This edition will cover several topics around algorithms and security, each with an entire course day dedicated to them. Course days consist of lectures mixed with active training (exercises, assignments, etc.).
Dates, Location and Programme
The course days will take place in room Neuron 0.118 in the recently renovated Neuron building (formerly Laplace, originally Rekencentrum) on the campus of Eindhoven University of Technology. See https://www.tue.nl/en/our-university/tue-campus/ for information on how to reach the campus, and how to reach Neuron—building 32, in grid cells C3–4.
The overall schedule of the course is as follows: course days will start at 10.00 and last until approximately 16.30 hours. Short coffee breaks are planned in the morning and afternoon; and lunch is included, ca. 12.15-13.30.
| MONDAY 8 May | Sukanya Pandey, Jelle Oostveen and Hans Bodlaender (Utrecht University) |
This course day will consist of four parts, with topics and speakers as indicated. Each part will consist of a lecture with exercises.
|
|
| TUESDAY 9 May | Tom van Dijk (University of Twente) |
| Topics covered will be parity games, P vs NP, UP and co-UP, with a short excursion to graph isomorphism; the relation with various other games; followed by in-depth coverage of exponential and quasi-polynomial algorithms; and exploring why parity games possibly are not solvable in P (which is hard to prove, as it implies P != NP). | |
| WEDNESDAY 10 May | Olga Gadyatskaya (Leiden University) |
|
Mobile Security Nowadays smartphones are an indispensable part of our lives, but how secure are these devices and what security and privacy risks do we face when using them? In this course we will study the security architecture of modern smartphone operating systems like Android and iOS. We will also learn the basics of mobile malware analysis: from looking for basic patterns to applying more complex program analysis techniques for detecting and dissecting mobile malware. |
|
| THURSDAY 11 May | Alfons Laarman and Tim Coopmans (Leiden University) |
|
This course day will cover the following topics:
|
|
| FRIDAY 12 May | Cynthia Kop (Radboud University) |
|
This day will be focused on the complexity of term rewriting systems. TRSs are essentially functional programs, but with a simple mathematical specification that makes it easier to analyse them — thus allowing one to create methods that can be extended to various functional programming languages. We will study the notions of runtime complexity, derivational complexity, and monotonic algebras, both for first-order and higher-order term rewriting systems. We will also see how term rewriting can be used in the field of implicit complexity, by allowing complexity classes such as PTIME or EXPTIME to be characterised through restrictions of term rewriting systems.
|
Registration
Registration is done via this form, and will close Wednesday April 26th at noon (CET).
As always, IPA PhD candidates can attend for free. For others, details on pricing will be made available upon request.
Accommodation
Overnight accommodation is not included by default for this course. The schedule is set up in such a way that it is feasible for many students to commute. In the event this is not feasible (mainly: PhD candidates based at RUG or UT), let us know and we will arrange basic overnight accommodation. You can specify your accommodation needs on the registration form.