Upcoming Course: Ana Sokolova

Ana Sokolova from the University of Salzburg will be visiting as a guest lecturer for the course “Coalgebra in Computer Science”.

Thu 14:00 – 16:00 08.03.2012 Seminarraum Gödel
Thu 14:00 – 16:00 15.03.2012 Seminarraum Gödel
Thu 14:00 – 16:00 22.03.2012 Seminarraum Gödel
Thu 14:00 – 16:00 19.04.2012 Seminarraum Gödel
Thu 14:00 – 16:00 26.04.2012 Seminarraum Gödel
Thu 14:00 – 16:00 03.05.2012 Seminarraum von Neumann
Thu 14:00 – 16:00 24.05.2012 Seminarraum Gödel
Thu 14:00 – 16:00 31.05.2012 Seminarraum Gödel
Thu 14:00 – 16:00 14.06.2012 Seminarraum Gödel
Thu 14:00 – 16:00 21.06.2012 Seminarraum Gödel
Thu 14:00 – 16:00 28.06.2012 Seminarraum Gödel

Registration and further details in TISS.

Goals:

The goal is to get acquainted with the theory of coalgebra and its use in computer science. Also, along the way, the students will get to know some category theory notions that are needed for basic constructions and results in coalgebra. The course is meant for computer science students (possibly also some mathematics students) interested in computer science theory. If you are a student interested in formal methods, concurrency theory, and/or automata, and/or you always wondered what is category theory good for, then this may be the right course for you.

Content:

The theory of coalgebra is a relatively recent (20 years old) unifying theory at the abstract end of formal methods. It is a (one could say “the”) theory of dynamic systems, of states and observations. Coalgebras allow for a uniform treatment of many different types of automata (e.g. deterministic, nondeterministic, probabilistic, and weighted), their behavior, and their corresponding modal logics. These topics will be covered within the course.

How students are evaluated:
The evaluation will depend on presented papers and the examination at the end of term.

ECTS-Breakdown (3 ECTS):

————————–
30 hours: lectures
23 hours: exercises
23 hours: preparation for examination
2 hours: examination
————————–
75 hours: total
————————–

Latest News

Jens Pagel wins Bill McCune PhD Award

We congratulate Jens Pagel for receiving the 2021 Bill McCune PhD Award in Automated Reasoning! Jens graduated in 2020; his thesis on Decision procedures for separation logic: beyond symbolic heaps (supervised by Florian Zuleger) presents his substantial contributions to the theory of formal verification and automated reasoning, and to verifying heap-manipulating programs in particular.

Continue reading

Full news archive