Chair of Theoretical Computer Science – INF8
The Chair of Theoretical Computer Science (INF8) belongs to the Department of Computer Science at the Faculty of Engineering of the Friedrich-Alexander-Universität Erlangen-Nürnberg. Our core research topics are
- Logic in Computer Science
- Formal Methods
- Knowledge Representation
Head of the group is Prof. Dr. Lutz Schröder.
Aktuelle Stellenausschreibungen für Hiwi-Jobs.
Highlights
- Stateful Structural Operational Semantics (Sergey Goncharov, Stefan Milius, Stelios Tsampas, Lutz Schröder, Henning Urbat) at FSCD 2022
- Graded Monads and Behavioural Equivalence Games (Chase Ford, Harsh Beohar, Barbara König, Stefan Milius, Lutz Schröder) at LICS 2022
- Distributed Coalgebraic Partition Refinement (Fabian Birkmann, Hans-Peter Deifel, Stefan Milius) at TACAS 2022
- Stefan Milius joins the Program Committees of MFCS 2022 and FoSSaCS 2023
- Henning Urbat joins the Program Committee of LICS 2022
- A Linear-Time Nominal mu-Calculus with Name Allocation (Daniel Hausmann, Stefan Milius, Lutz Schröder) at MFCS 2021
- Nondeterministic Syntactic Complexity (Robert Myers, Henning Urbat) at MFCS 2021
- Explaining Behavioural Inequivalence Generically in Quasilinear Time (Thorsten Wißmann, Stefan Milius, Lutz Schröder) at CONCUR 2021
- Nominal Büchi Automata with Name Allocation (Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder) at CONCUR 2021
- Coalgebra Encoding for Efficient Minimization (Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann) at FSCD 2021
- CoPaR – The Coalgebraic Partition Refiner extended to compute minimized systems
- Uniform Elgot Iteration in Foundations (Sergey Goncharov) at ICALP 2021
- DFG project Spectra of Behavioural Distances and Quantitative Logics (Barbara König, Lutz Schröder) kicked off
- Behavioural Preorders via Graded Monads (Chase Ford, Stefan Milius, Lutz Schröder) at LICS 2021
- A Quantified Coalgebraic van Benthem Theorem (Paul Wild, Lutz Schröder) at FoSSaCS 2021
- Nondeterministic Syntactic Complexity (Stefan Milius, Robert Myers, Henning Urbat) at FoSSaCS 2021
- On Language Varieties Without Boolean Operations (Fabian Birkmann, Stefan Milius, Hennung Urbat) at LATA 2021
- DFG project Reconstructing Arguments from Newsworthy Debates (Stefan Evert, Lutz Schröder) kicked off
- Quasipolynomial Computation of Nested Fixpoints (Daniel Hausmann, Lutz Schröder) at TACAS 2021
- Stefan Milius joins the Program Committee of MFCS 2021
- Stefan Milius joins the Editorial Board of Applied Categorical Structures
- Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
(Paul Wild, Lutz Schröder) at CONCUR 2020 - Automata Learning: An Algebraic Approach (Henning Urbat, Lutz Schröder) at LICS 2020
-
NP Reasoning in the Monotone mu-Calculus (Daniel Hausmann, Lutz Schröder) at IJCAR 2020
- DFG project Coalgebraic Model Checking (Stefan Milius, Lutz Schröder) kicked off
- Generic Partition Refinement and Weighted Tree Automata (Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann) wins Best Theory Paper Award at FM 2019
- Game-Based Local Model Checking for the Coalgebraic mu-Calculus (Daniel Hausmann, Lutz Schröder) at CONCUR 2019
- Graded Monads and Graded Logics for the Linear Time – Branching Time Spectrum (Ulrich Dorsch, Stefan Milius, Lutz Schröder) at CONCUR 2019
- A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic (Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König) at IJCAI 2019 (preprint)
- Varieties of Data Languages (Stefan Milius, Henning Urbat) at ICALP 2019
- Equational Axiomatization of Algebras with Structure (Stefan Milius, Henning Urbat) at FoSSaCS 2019
- Optimal Satisfiability Checking for Arithmetic mu-Calculi (Daniel Hausmann, Lutz Schröder) at FoSSaCS 2019
- COOL – The Coalgebraic Ontology Logic Reasoner extended to cover the aconjunctive (coalgebraic) mu-calculus