Specifying Real Numbers in CASL. - Markus Roggenbach; Lutz Schröder; Till Mossakowski (WADT, 1999)

Free Adjunction of Morphisms. - Lutz Schröder; Horst Herrlich (Appl. Categorical Struct., 2000)

Life without the Terminal Type. - Lutz Schröder (CSL, 2001)

Semantics of Architectural Specifications in CASL. - Lutz Schröder; Till Mossakowski; Andrzej Tarlecki; Bartek Klin; Piotr Hoffman (FASE, 2001)

Amalgamation in CASL via Enriched Signatures. - Lutz Schröder; Till Mossakowski; Andrzej Tarlecki (ICALP, 2001)

Checking Amalgamability Conditions for C ASL Architectural Specifications. - Bartek Klin; Piotr Hoffman; Andrzej Tarlecki; Lutz Schröder; Till Mossakowski (MFCS, 2001)

Towards Trustworthy Specifications I: Consistency Checks. - Markus Roggenbach; Lutz Schröder (WADT, 2001)

Free Factorizations. - Lutz Schröder; Horst Herrlich (Appl. Categorical Struct., 2001)

HASCASL: Towards Integrated Specification and Development of Functional Programs. - Lutz Schröder; Till Mossakowski (AMAST, 2002)

Algebraic-Coalgebraic Specification in Co Casl. - Till Mossakowski; Horst Reichel; Markus Roggenbach; Lutz Schröder (WADT, 2002)

Monad-Independent Dynamic Logic in Has Casl. - Lutz Schröder; Till Mossakowski (WADT, 2002)

Monads on Composition Graphs. - Lutz Schröder (Appl. Categorical Struct., 2002)

Classifying categories for partial equational logic. - Lutz Schröder (CTCS, 2002)

Universal Aspects of Probabilistic Automata. - Lutz Schröder; Paulo Mateus (Math. Struct. Comput. Sci., 2002)

Henkin Models of the Partial sigma-Calculus. - Lutz Schröder (CSL, 2003)

Monad-Independent Hoare Logic in HASCASL. - Lutz Schröder; Till Mossakowski (FASE, 2003)

CoCASL at Work – Modelling Process Algebra. - Till Mossakowski; Markus Roggenbach; Lutz Schröder (CMCS, 2003)

Generic Exception Handling and the Java Monad. - Lutz Schröder; Till Mossakowski (AMAST, 2004)

The Logic of the Partial lambda-Calculus with Equality. - Lutz Schröder (CSL, 2004)

CCC - The Casl Consistency Checker. - Christoph Lüth; Markus Roggenbach; Lutz Schröder (WADT, 2004)

Type Class Polymorphism in an Institutional Framework. - Lutz Schröder; Till Mossakowski; Christoph Lüth (WADT, 2004)

Monad-independent Dynamic Logic in HasCasl. - Lutz Schröder; Till Mossakowski (J. Log. Comput., 2004)

Towards a Coalgebraic Semantics of the Ambient Calculus. - Daniel Hausmann 001; Till Mossakowski; Lutz Schröder (CALCO, 2005)

Parametrized Exceptions. - Dennis Walter; Lutz Schröder; Till Mossakowski (CALCO, 2005)

Iterative Circular Coinduction for CoCasl in Isabelle/HOL. - Daniel Hausmann 001; Till Mossakowski; Lutz Schröder (FASE, 2005)

Amalgamation in the semantics of CASL. - Lutz Schröder; Till Mossakowski; Andrzej Tarlecki; Bartek Klin; Piotr Hoffman (Theor. Comput. Sci., 2005)

Closing a Million-Landmarks Loop. - Udo Frese; Lutz Schröder (IROS, 2006)

Completeness of Global Evaluation Logic. - Sergey Goncharov 001; Lutz Schröder; Till Mossakowski (MFCS, 2006)

Coalgebraic Modal Logic in CoCasl. - Lutz Schröder; Till Mossakowski (WADT, 2006)

Algebraic-coalgebraic specification in CoCasl. - Till Mossakowski; Lutz Schröder; Markus Roggenbach; Horst Reichel (J. Log. Algebraic Methods Program., 2006)

A coalgebraic approach to the semantics of the ambient calculus. - Daniel Hausmann 001; Till Mossakowski; Lutz Schröder (Theor. Comput. Sci., 2006)

The HASCASL prologue: Categorical syntax and semantics of the partial lambda-calculus. - Lutz Schröder (Theor. Comput. Sci., 2006)

Bootstrapping Types and Cotypes in HasCASL. - Lutz Schröder (CALCO, 2007)

Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. - Stefan Wölfl 001; Till Mossakowski; Lutz Schröder (FLAIRS, 2007)

Modular Algorithms for Heterogeneous Modal Logics. - Lutz Schröder; Dirk Pattinson (ICALP, 2007)

CoLoSS: The Coalgebraic Logic Satisfiability Solver. - Georgel Calin; Robert S. R. Myers; Dirk Pattinson; Lutz Schröder (M4M, 2007)

An Institutional View on Categorical Logic. - Joseph A. Goguen; Till Mossakowski; Valeria de Paiva; Florian Rabe 001; Lutz Schröder (Int. J. Softw. Informatics, 2007)

A finite model construction for coalgebraic modal logic. - Lutz Schröder (J. Log. Algebraic Methods Program., 2007)

Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. - Dirk Pattinson; Lutz Schröder (FoSSaCS, 2008)

Shallow Models for Non-iterative Modal Logics. - Lutz Schröder; Dirk Pattinson (KI, 2008)

How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. - Lutz Schröder; Dirk Pattinson (KR, 2008)

The craft of model making: PSPACE bounds for non-iterative modal logics - Lutz Schröder; Dirk Pattinson (CoRR, 2008)

Admissibility of Cut in Coalgebraic Logics. - Dirk Pattinson; Lutz Schröder (CMCS, 2008)

Bootstrapping Inductive and Coinductive Types in HasCASL. - Lutz Schröder (Log. Methods Comput. Sci., 2008)

Expressivity of coalgebraic modal logic: The limits and beyond. - Lutz Schröder (Theor. Comput. Sci., 2008)

Kleene Monads: Handling Iteration in a Framework of Generic Effects. - Sergey Goncharov 001; Lutz Schröder; Till Mossakowski (CALCO, 2009)

Formal Management of CAD/CAM Processes. - Michael Kohlhase; Johannes Lemburg; Lutz Schröder; Ewaryst Schulz (FM, 2009)

Coalgebraic Hybrid Logic. - Robert S. R. Myers; Dirk Pattinson; Lutz Schröder (FoSSaCS, 2009)

Nominals for Everyone. - Lutz Schröder; Dirk Pattinson; Clemens Kupke (IJCAI, 2009)

Strong Completeness of Coalgebraic Modal Logics. - Lutz Schröder; Dirk Pattinson (STACS, 2009)

Optimizing Conditional Logic Reasoning within CoLoSS. - Daniel Hausmann 001; Lutz Schröder (M4M, 2009)

HasCasl: Integrated higher-order specification and program development. - Lutz Schröder; Till Mossakowski (Theor. Comput. Sci., 2009)

PSPACE bounds for rank-1 modal logics. - Lutz Schröder; Dirk Pattinson (ACM Trans. Comput. Log., 2009)

Global Caching for Coalgebraic Description Logics. - Rajeev Goré; Clemens Kupke; Dirk Pattinson; Lutz Schröder (IJCAR, 2010)

Flat Coalgebraic Fixed Point Logics. - Lutz Schröder; Yde Venema (CONCUR, 2010)

Optimal Tableaux for Conditional Logics with Cautious Monotonicity. - Lutz Schröder; Dirk Pattinson; Daniel Hausmann 001 (ECAI, 2010)

Coalgebraic Correspondence Theory. - Lutz Schröder; Dirk Pattinson (FoSSaCS, 2010)

Probabilistic Description Logics for Subjective Uncertainty. - Carsten Lutz; Lutz Schröder (KR, 2010)

Named Models in Coalgebraic Hybrid Logic. - Lutz Schröder; Dirk Pattinson (STACS, 2010)

A generic complete dynamic logic for reasoning about purity and effects. - Till Mossakowski; Lutz Schröder; Sergey Goncharov 001 (Formal Aspects Comput., 2010)

Cut elimination in coalgebraic logics. - Dirk Pattinson; Lutz Schröder (Inf. Comput., 2010)

Rank-1 Modal Logics are Coalgebraic. - Lutz Schröder; Dirk Pattinson (J. Log. Comput., 2010)

A Closer Look at the Probabilistic Description Logic Prob-EL. - Víctor Gutiérrez-Basulto; Jean Christoph Jung; Carsten Lutz; Lutz Schröder (AAAI, 2011)

A Counterexample to Tensorability of Effects. - Sergey Goncharov 001; Lutz Schröder (CALCO, 2011)

The Complexity of Probabilistic EL. - Jean Christoph Jung; Víctor Gutiérrez-Basulto; Carsten Lutz; Lutz Schröder (Description Logics, 2011)

Formalizing and Operationalizing Industrial Standards. - Dominik Dietrich; Lutz Schröder; Ewaryst Schulz (FASE, 2011)

Description Logics and Fuzzy Probability. - Lutz Schröder; Dirk Pattinson (IJCAI, 2011)

Powermonads and Tensors of Unranked Effects. - Sergey Goncharov 001; Lutz Schröder (LICS, 2011)

Modal Logics are Coalgebraic. - Corina Cîrstea; Alexander Kurz 001; Dirk Pattinson; Lutz Schröder; Yde Venema (Comput. J., 2011)

Generic Modal Cut Elimination Applied to Conditional Logics - Dirk Pattinson; Lutz Schröder (Log. Methods Comput. Sci., 2011)

Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. - Lutz Schröder; Dirk Pattinson (Math. Struct. Comput. Sci., 2011)

Extending ALCQ with Bounded Self-Reference. - Daniel Gorín; Lutz Schröder (Advances in Modal Logic, 2012)

Narcissists Are Easy, Stepmothers Are Hard. - Daniel Gorín; Lutz Schröder (FoSSaCS, 2012)

Coalgebraic Predicate Logic. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano; Lutz Schröder (ICALP (2), 2012)

Simulations and Bisimulations for Coalgebraic Modal Logics. - Daniel Gorín; Lutz Schröder (CALCO, 2013)

Preface to CALCO-Tools. - Lutz Schröder (CALCO, 2013)

Reasoning with Bounded Self-reference Using Logical Interpreters. - Daniel Gorín; Lutz Schröder; Thorsten Wißmann (Description Logics, 2013)

Coalgebraic Announcement Logics. - Facundo Carreiro; Daniel Gorín; Lutz Schröder (ICALP (2), 2013)

Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC. - Agnieszka Kulacka; Dirk Pattinson; Lutz Schröder (IJCAI, 2013)

A Relatively Complete Generic Hoare Logic for Order-Enriched Effects. - Sergey Goncharov 001; Lutz Schröder (LICS, 2013)

Exploring the Boundaries of Monad Tensorability on Set. - Nathan J. Bowler; Sergey Goncharov 001; Paul Blain Levy; Lutz Schröder (Log. Methods Comput. Sci., 2013)

Preface. - Till Mossakowski; Markus Roggenbach; Lutz Schröder (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013)

A coinductive calculus for asynchronous side-effecting processes. - Sergey Goncharov 001; Lutz Schröder (Inf. Comput., 2013)

Integrating generic sensor fusion algorithms with sound state representations through encapsulation of manifolds. - Christoph Hertzberg; René Wagner; Udo Frese; Lutz Schröder (Inf. Fusion, 2013)

Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics. - Daniel Gorín; Lutz Schröder (Advances in Modal Logic, 2014)

Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). - Daniel Gorín; Dirk Pattinson; Lutz Schröder; Florian Widmann; Thorsten Wißmann (IJCAR, 2014)

Towards Ontological Support for Principle Solutions in Mechanical Engineering. - Thilo Breitsprecher; Mihai Codescu; Constantin Jucovschi; Michael Kohlhase; Lutz Schröder; Sandro Wartzack (FOMI@FOIS, 2014)

Monodic Fragments of Probabilistic First-Order Logic. - Jean Christoph Jung; Carsten Lutz; Sergey Goncharov 001; Lutz Schröder (ICALP (2), 2014)

(Co-)Algebraic Foundations for Effect Handling and Iteration. - Sergey Goncharov 001; Lutz Schröder; Christoph Rauch (CoRR, 2014)

Simplified Coalgebraic Trace Equivalence. - Alexander Kurz 001; Stefan Milius; Dirk Pattinson; Lutz Schröder (Software, Services, and Systems, 2015)

Generic Trace Semantics and Graded Monads. - Stefan Milius; Dirk Pattinson; Lutz Schröder (CALCO, 2015)

Reasoning with Global Assumptions in Arithmetic Modal Logics. - Clemens Kupke; Dirk Pattinson; Lutz Schröder (FCT, 2015)

Global Caching for the Flat Coalgebraic µ-Calculus. - Daniel Hausmann 001; Lutz Schröder (TIME, 2015)

Unguarded Recursion on Coinductive Resumptions. - Sergey Goncharov 001; Christoph Rauch; Lutz Schröder (MFPS, 2015)

Sound and Complete Equational Reasoning over Comodels. - Dirk Pattinson; Lutz Schröder (MFPS, 2015)

On Inconsistency and Unsatisfiability. - Till Mossakowski; Lutz Schröder (Int. J. Softw. Informatics, 2015)

From the Editors. - Dirk Pattinson; Lutz Schröder (J. Comput. Syst. Sci., 2015)

Global Caching for the Alternation-free μ-Calculus. - Daniel Hausmann 001; Lutz Schröder; Christoph Egger 001 (CONCUR, 2016)

Program Equivalence is Coinductive. - Dirk Pattinson; Lutz Schröder (LICS, 2016)

Generic Hoare Logic for Order-Enriched Effects with Exceptions. - Christoph Rauch; Sergey Goncharov 001; Lutz Schröder (WADT, 2016)

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. - Stefan Milius; Lutz Schröder; Thorsten Wißmann (Appl. Categorical Struct., 2016)

Regular Behaviours with Names. - Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2016)

Uniform Interpolation in Coalgebraic Modal Logic. - Fatemeh Seifan; Lutz Schröder; Dirk Pattinson (CALCO, 2017)

Efficient Coalgebraic Partition Refinement. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CONCUR, 2017)

Automatic verification of application-tailored OSEK kernels. - Hans-Peter Deifel; Merlin Göttlinger; Stefan Milius; Lutz Schröder; Christian Dietrich 001; Daniel Lohmann (FMCAD, 2017)

Unifying Guarded and Unguarded Iteration. - Sergey Goncharov 001; Lutz Schröder; Christoph Rauch; Maciej Piróg (FoSSaCS, 2017)

Nominal Automata with Name Binding. - Lutz Schröder; Dexter Kozen; Stefan Milius; Thorsten Wißmann (FoSSaCS, 2017)

A Characterization Theorem for a Modal Description Logic. - Paul Wild; Lutz Schröder (IJCAI, 2017)

Ontological Modelling of a Psychiatric Clinical Practice Guideline. - Daniel Gorín; Malte Meyn; Alexander Naumann; Miriam Polzer; Ulrich Rabenstein; Lutz Schröder (KI, 2017)

A Coalgebraic Paige-Tarjan Algorithm. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2017)

Model Theory and Proof Theory of CPL. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano; Lutz Schröder (CoRR, 2017)

Permutation Games for the Weakly Aconjunctive mu-Calculus. - Daniel Hausmann 001; Lutz Schröder; Hans-Peter Deifel (CoRR, 2017)

Probabilistic Description Logics for Subjective Uncertainty. - Víctor Gutiérrez-Basulto; Jean Christoph Jung; Carsten Lutz; Lutz Schröder (J. Artif. Intell. Res., 2017)

A Van Benthem/Rosen theorem for coalgebraic predicate logic. - Lutz Schröder; Dirk Pattinson; Tadeusz Litak (J. Log. Comput., 2017)

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CMCS, 2018)

Guarded Traced Categories. - Sergey Goncharov 001; Lutz Schröder (FoSSaCS, 2018)

A van Benthem Theorem for Fuzzy Modal Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (LICS, 2018)

Permutation Games for the Weakly Aconjunctive mu μ -Calculus. - Daniel Hausmann 001; Lutz Schröder; Hans-Peter Deifel (TACAS (2), 2018)

A van Benthem Theorem for Quantitative Probabilistic Modal Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (CoRR, 2018)

CoPaR: An Efficient Generic Partition Refiner. - Hans-Peter Deifel; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2018)

Graded Monads for the Linear Time - Branching Time Spectrum. - Ulrich Dorsch; Stefan Milius; Lutz Schröder (CoRR, 2018)

Trichotomic Argumentation Representation. - Merlin Göttlinger; Lutz Schröder (CoRR, 2018)

A detailed analysis of the Arden Syntax expression grammar. - Stefan Kraus; Marc Rosenbauer; Lutz Schröder; Thomas Bürkle; Klaus-Peter Adlassnig; Dennis Toddenroth (J. Biomed. Informatics, 2018)

Unguarded Recursion on Coinductive Resumptions. - Sergey Goncharov 001; Lutz Schröder; Christoph Rauch; Julian Jakob (Log. Methods Comput. Sci., 2018)

Model Theory and Proof Theory of Coalgebraic Predicate Logic. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano; Lutz Schröder (Log. Methods Comput. Sci., 2018)

Completeness of Flat Coalgebraic Fixpoint Logics. - Lutz Schröder; Yde Venema (ACM Trans. Comput. Log., 2018)

Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. - Ulrich Dorsch; Stefan Milius; Lutz Schröder (CONCUR, 2019)

Game-Based Local Model Checking for the Coalgebraic mu-Calculus. - Daniel Hausmann 001; Lutz Schröder (CONCUR, 2019)

Generic Partition Refinement and Weighted Tree Automata. - Hans-Peter Deifel; Stefan Milius; Lutz Schröder; Thorsten Wißmann (FM, 2019)

Optimal Satisfiability Checking for Arithmetic mu -Calculi. - Daniel Hausmann 001; Lutz Schröder (FoSSaCS, 2019)

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (IJCAI, 2019)

Optimal Satisfiability Checking for Arithmetic μ-Calculi. - Daniel Hausmann 001; Lutz Schröder (CoRR, 2019)

Computing Nested Fixpoints in Quasipolynomial Time. - Daniel Hausmann 001; Lutz Schröder (CoRR, 2019)

Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures. - Stefan Evert; Philipp Heinrich; Klaus Henselmann; Ulrich Rabenstein; Elisabeth Scherr; Martin Schmitt; Lutz Schröder (J. Log. Lang. Inf., 2019)

Guarded and Unguarded Iteration for Generalized Processes. - Sergey Goncharov 001; Lutz Schröder; Christoph Rauch; Maciej Piróg (Log. Methods Comput. Sci., 2019)

Non-Iterative Modal Logics Are Coalgebraic. - Jonas Forster; Lutz Schröder (AiML, 2020)

NP Reasoning in the Monotone μ-Calculus. - Daniel Hausmann 001; Lutz Schröder (IJCAR (1), 2020)

Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. - Barbara König 001; Christina Mika-Michalski; Lutz Schröder (CMCS, 2020)

Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. - Paul Wild; Lutz Schröder (CONCUR, 2020)

Automata Learning: An Algebraic Approach. - Henning Urbat; Lutz Schröder (LICS, 2020)

Harnessing LTL With Freeze Quantification. - Daniel Hausmann 001; Stefan Milius; Lutz Schröder (CoRR, 2020)

Reconstructing Arguments from Noisy Text. - Natalie Dykes; Stefan Evert; Merlin Göttlinger; Philipp Heinrich; Lutz Schröder (Datenbank-Spektrum, 2020)

Efficient and Modular Coalgebraic Partition Refinement. - Thorsten Wißmann; Ulrich Dorsch; Stefan Milius; Lutz Schröder (Log. Methods Comput. Sci., 2020)

Monads on Categories of Relational Structures. - Chase Ford; Stefan Milius; Lutz Schröder (CALCO, 2021)

Nominal Büchi Automata with Name Allocation. - Henning Urbat; Daniel Hausmann 001; Stefan Milius; Lutz Schröder (CONCUR, 2021)

Explaining Behavioural Inequivalence Generically in Quasilinear Time. - Thorsten Wißmann; Stefan Milius; Lutz Schröder (CONCUR, 2021)

The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies. - Merlin Göttlinger; Lutz Schröder; Dirk Pattinson (CSL, 2021)

A Quantified Coalgebraic van Benthem Theorem. - Paul Wild; Lutz Schröder (FoSSaCS, 2021)

Behavioural Preorders via Graded Monads. - Chase Ford; Stefan Milius; Lutz Schröder (LICS, 2021)

A Linear-Time Nominal μ-Calculus with Name Allocation. - Daniel Hausmann 001; Stefan Milius; Lutz Schröder (MFCS, 2021)

Quasipolynomial Computation of Nested Fixpoints. - Daniel Hausmann 001; Lutz Schröder (TACAS (1), 2021)

From generic partition refinement to weighted tree automata minimization. - Thorsten Wißmann; Hans-Peter Deifel; Stefan Milius; Lutz Schröder (Formal Aspects Comput., 2021)

Argument parsing via corpus queries. - Natalie Dykes; Stefan Evert; Merlin Göttlinger; Philipp Heinrich; Lutz Schröder (it Inf. Technol., 2021)

Finitary monads on the category of posets. - Jirí Adámek; Chase Ford; Stefan Milius; Lutz Schröder (Math. Struct. Comput. Sci., 2021)

A metalanguage for guarded iteration. - Sergey Goncharov 001; Christoph Rauch; Lutz Schröder (Theor. Comput. Sci., 2021)

Stateful Structural Operational Semantics. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (FSCD, 2022)

Graded Monads and Behavioural Equivalence Games. - Chase Ford; Stefan Milius; Lutz Schröder; Harsh Beohar; Barbara König 001 (LICS, 2022)

Quantalic Behavioural Distances. - Sergey Goncharov 001; Dirk Hofmann; Pedro Nora; Lutz Schröder; Paul Wild (CoRR, 2022)

Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions. - Paul Wild; Lutz Schröder (Log. Methods Comput. Sci., 2022)

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. - Thorsten Wißmann; Stefan Milius; Lutz Schröder (Log. Methods Comput. Sci., 2022)

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. - Clemens Kupke; Dirk Pattinson; Lutz Schröder (ACM Trans. Comput. Log., 2022)

Benchmark data for COOL 2.2. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2022)

Common Knowledge of Abstract Groups. - Merlin Humml; Lutz Schröder (AAAI, 2023)

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description). - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (CADE, 2023)

Higher-Order Mathematical Operational Semantics (Early Ideas). - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (CALCO, 2023)

Quantitative Hennessy-Milner Theorems via Notions of Density. - Jonas Forster; Sergey Goncharov 001; Dirk Hofmann; Pedro Nora; Lutz Schröder; Paul Wild (CSL, 2023)

Kantorovich Functors and Characteristic Logics for Behavioural Distances. - Sergey Goncharov 001; Dirk Hofmann; Pedro Nora; Lutz Schröder; Paul Wild (FoSSaCS, 2023)

Weak Similarity in Higher-Order Mathematical Operational Semantics. - Henning Urbat; Stelios Tsampas 001; Sergey Goncharov 001; Stefan Milius; Lutz Schröder (LICS, 2023)

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (CoRR, 2023)

Quantitative Graded Semantics and Spectra of Behavioural Metrics. - Jonas Forster; Lutz Schröder; Paul Wild (CoRR, 2023)

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. - Jonas Forster; Lutz Schröder; Paul Wild; Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing (CoRR, 2023)

Towards a Higher-Order Mathematical Operational Semantics. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (Proc. ACM Program. Lang., 2023)

Benchmarking scripts for COOL 2.3. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2023)

Benchmarking scripts for COOL 2.3. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2023)

Benchmarking scripts for COOL 2.4. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2023)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2023)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2023)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2023)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2023)

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. - Jonas Forster; Lutz Schröder; Paul Wild; Harsh Beohar; Sebastian Gurke; Karla Messing (CMCS, 2024)

Nominal Tree Automata with Name Allocation. - Simon Prucker; Lutz Schröder (CONCUR, 2024)

Logical Predicates in Higher-Order Mathematical Operational Semantics. - Sergey Goncharov 001; Alessio Santamaria; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (FoSSaCS (2), 2024)

DIREGA - Building Decision Support for German Register Law. - Axel Adrian; Osman Anil Basaran; Nathan Dykes; Stephanie Evert; Michael Gritz; Merlin Humml; Michael Kohlhase; Johannes Lindner; Andreas Maier 001; Stephan Prettner; Max Rapp; Lutz Schröder; et al. (JURIX, 2024)

Finding Argument Fragments on Social Media with Corpus Queries and LLMs. - Nathan Dykes; Stephanie Evert; Philipp Heinrich; Merlin Humml; Lutz Schröder (RATIO, 2024)

Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. - Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing; Jonas Forster; Lutz Schröder; Paul Wild (STACS, 2024)

Generic Model Checking for Modal Fixpoint Logics in COOL-MC. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (VMCAI (1), 2024)

Higher-Order Mathematical Operational Semantics. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (CoRR, 2024)

Alternating Nominal Automata with Name Allocation. - Florian Frank 002; Daniel Hausmann 001; Stefan Milius; Lutz Schröder; Henning Urbat (CoRR, 2024)

Identity-Preserving Lax Extensions and Where to Find Them. - Sergey Goncharov 001; Dirk Hofmaan; Pedro Nora; Lutz Schröder; Paul Wild (CoRR, 2024)

Relational Connectors and Heterogeneous Bisimulations. - Pedro Nora; Jurriaan Rot; Lutz Schröder; Paul Wild (CoRR, 2024)

Conformance Games for Graded Semantics. - Jonas Forster; Lutz Schröder; Paul Wild (CoRR, 2024)

Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi. - Daniel Hausmann 001; Lutz Schröder (Log. Methods Comput. Sci., 2024)

A point-free perspective on lax extensions and predicate liftings. - Sergey Goncharov 001; Dirk Hofmann; Pedro Nora; Lutz Schröder; Paul Wild (Math. Struct. Comput. Sci., 2024)

Quantitative Graded Semantics and Spectra of Behavioural Metrics. - Jonas Forster; Lutz Schröder; Paul Wild; Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing (CSL, 2025)

Relational Connectors and Heterogeneous Simulations. - Pedro Nora; Jurriaan Rot; Lutz Schröder; Paul Wild (FoSSaCS, 2025)

Identity-Preserving Lax Extensions and Where to Find Them. - Sergey Goncharov 001; Dirk Hofmann; Pedro Nora; Lutz Schröder; Paul Wild (STACS, 2025)

Automated Analysis and Synthesis of Message Authentication Codes. - Stefan Milius; Dominik Paulus; Dominique Schröder; Lutz Schröder; Julian Thomas (IACR Cryptol. ePrint Arch., 2025)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2025)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2025)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2025)

Behavioural Conformances based on Lax Couplings. - Paul Wild; Lutz Schröder (CoRR, 2025)

Relators and Notions of Simulation Revisited. - Sergey Goncharov 001; Dirk Hofmann; Pedro Nora; Lutz Schröder; Paul Wild (CoRR, 2025)

Benchmarking for COOL Model Checking. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder; Aaron Strahlberger (Zenodo, 2025)

Efficient Model Checking for the Alternating-Time µ-Calculus via Effectivity Frames - Artifact. - Merlin Humml; Daniel Hausmann 001; Lutz Schröder; Simon Prucker (Zenodo, 2025)

Bialgebraic Reasoning on Stateful Languages. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (CoRR, 2025)

Non-expansive Fuzzy ALC. - Stefan Gebhart; Lutz Schröder; Paul Wild (CoRR, 2025)

Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames. - Daniel Hausmann 001; Merlin Humml; Simon Prucker; Lutz Schröder (CoRR, 2025)