Lutz Schröder

Orcid: 0000-0002-3146-5906

Affiliations:
  • University of Erlangen-Nuremberg, Germany


According to our database1, Lutz Schröder authored at least 192 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A point-free perspective on lax extensions and predicate liftings.
Math. Struct. Comput. Sci., 2024

Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi.
Log. Methods Comput. Sci., 2024

Relational Connectors and Heterogeneous Bisimulations.
CoRR, 2024

Identity-Preserving Lax Extensions and Where to Find Them.
CoRR, 2024

Alternating Nominal Automata with Name Allocation.
CoRR, 2024

Higher-Order Mathematical Operational Semantics.
CoRR, 2024

Generic Model Checking for Modal Fixpoint Logics in COOL-MC.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Finding Argument Fragments on Social Media with Corpus Queries and LLMs.
Proceedings of the Robust Argumentation Machines - First International Conference, 2024

Logical Predicates in Higher-Order Mathematical Operational Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

Nominal Tree Automata with Name Allocation.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras.
Proceedings of the Coalgebraic Methods in Computer Science, 2024

2023
Benchmarking for COOL Model Checking.
Dataset, October, 2023

Benchmarking for COOL Model Checking.
Dataset, September, 2023

Benchmarking for COOL Model Checking.
Dataset, September, 2023

Benchmarking for COOL Model Checking.
Dataset, September, 2023

Benchmarking scripts for COOL 2.4.
Dataset, June, 2023

Benchmarking scripts for COOL 2.3.
Dataset, May, 2023

Benchmarking scripts for COOL 2.3.
Dataset, March, 2023

Towards a Higher-Order Mathematical Operational Semantics.
Proc. ACM Program. Lang., January, 2023

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras.
CoRR, 2023

Quantitative Graded Semantics and Spectra of Behavioural Metrics.
CoRR, 2023

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics.
CoRR, 2023

Weak Similarity in Higher-Order Mathematical Operational Semantics.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Kantorovich Functors and Characteristic Logics for Behavioural Distances.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Quantitative Hennessy-Milner Theorems via Notions of Density.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Higher-Order Mathematical Operational Semantics (Early Ideas).
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description).
Proceedings of the Automated Deduction - CADE 29, 2023

Common Knowledge of Abstract Groups.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Benchmark data for COOL 2.2.
Dataset, October, 2022

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics.
ACM Trans. Comput. Log., 2022

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence.
Log. Methods Comput. Sci., 2022

Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions.
Log. Methods Comput. Sci., 2022

Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi.
CoRR, 2022

Quantalic Behavioural Distances.
CoRR, 2022

Graded Monads and Behavioural Equivalence Games.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Stateful Structural Operational Semantics.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
A metalanguage for guarded iteration.
Theor. Comput. Sci., 2021

Finitary monads on the category of posets.
Math. Struct. Comput. Sci., 2021

Argument parsing via corpus queries.
it Inf. Technol., 2021

From generic partition refinement to weighted tree automata minimization.
Formal Aspects Comput., 2021

Quasipolynomial Computation of Nested Fixpoints.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

A Linear-Time Nominal μ-Calculus with Name Allocation.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Behavioural Preorders via Graded Monads.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

A Quantified Coalgebraic van Benthem Theorem.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Explaining Behavioural Inequivalence Generically in Quasilinear Time.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Nominal Büchi Automata with Name Allocation.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Monads on Categories of Relational Structures.
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Efficient and Modular Coalgebraic Partition Refinement.
Log. Methods Comput. Sci., 2020

Reconstructing Arguments from Noisy Text.
Datenbank-Spektrum, 2020

Harnessing LTL With Freeze Quantification.
CoRR, 2020

Automata Learning: An Algebraic Approach.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas.
Proceedings of the Coalgebraic Methods in Computer Science, 2020

NP Reasoning in the Monotone μ-Calculus.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

Non-Iterative Modal Logics Are Coalgebraic.
Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019
Guarded and Unguarded Iteration for Generalized Processes.
Log. Methods Comput. Sci., 2019

Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures.
J. Log. Lang. Inf., 2019

Computing Nested Fixpoints in Quasipolynomial Time.
CoRR, 2019

Optimal Satisfiability Checking for Arithmetic μ-Calculi.
CoRR, 2019

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Optimal Satisfiability Checking for Arithmetic \mu -Calculi.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Generic Partition Refinement and Weighted Tree Automata.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

Game-Based Local Model Checking for the Coalgebraic mu-Calculus.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Completeness of Flat Coalgebraic Fixpoint Logics.
ACM Trans. Comput. Log., 2018

Model Theory and Proof Theory of Coalgebraic Predicate Logic.
Log. Methods Comput. Sci., 2018

Unguarded Recursion on Coinductive Resumptions.
Log. Methods Comput. Sci., 2018

A detailed analysis of the Arden Syntax expression grammar.
J. Biomed. Informatics, 2018

Trichotomic Argumentation Representation.
CoRR, 2018

Graded Monads for the Linear Time - Branching Time Spectrum.
CoRR, 2018

CoPaR: An Efficient Generic Partition Refiner.
CoRR, 2018

A van Benthem Theorem for Quantitative Probabilistic Modal Logic.
CoRR, 2018

Permutation Games for the Weakly Aconjunctive \mu μ -Calculus.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

A van Benthem Theorem for Fuzzy Modal Logic.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Guarded Traced Categories.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
A Van Benthem/Rosen theorem for coalgebraic predicate logic.
J. Log. Comput., 2017

Probabilistic Description Logics for Subjective Uncertainty.
J. Artif. Intell. Res., 2017

Permutation Games for the Weakly Aconjunctive mu-Calculus.
CoRR, 2017

Model Theory and Proof Theory of CPL.
CoRR, 2017

A Coalgebraic Paige-Tarjan Algorithm.
CoRR, 2017

Ontological Modelling of a Psychiatric Clinical Practice Guideline.
Proceedings of the KI 2017: Advances in Artificial Intelligence, 2017

A Characterization Theorem for a Modal Description Logic.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Nominal Automata with Name Binding.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Unifying Guarded and Unguarded Iteration.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Automatic verification of application-tailored OSEK kernels.
Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

Efficient Coalgebraic Partition Refinement.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Uniform Interpolation in Coalgebraic Modal Logic.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Regular Behaviours with Names.
CoRR, 2016

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets.
Appl. Categorical Struct., 2016

Generic Hoare Logic for Order-Enriched Effects with Exceptions.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2016

Program Equivalence is Coinductive.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Global Caching for the Alternation-free μ-Calculus.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
From the Editors.
J. Comput. Syst. Sci., 2015

On Inconsistency and Unsatisfiability.
Int. J. Softw. Informatics, 2015

Sound and Complete Equational Reasoning over Comodels.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Unguarded Recursion on Coinductive Resumptions.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Global Caching for the Flat Coalgebraic µ-Calculus.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Reasoning with Global Assumptions in Arithmetic Modal Logics.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Generic Trace Semantics and Graded Monads.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Simplified Coalgebraic Trace Equivalence.
Proceedings of the Software, 2015

2014
(Co-)Algebraic Foundations for Effect Handling and Iteration.
CoRR, 2014

Monodic Fragments of Probabilistic First-Order Logic.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Towards Ontological Support for Principle Solutions in Mechanical Engineering.
Proceedings of the 6th Workshop on Formal Ontologies meet Industry co-located with 8th International Conference on Formal Ontology in Information Systems (FOIS 2014), 2014

Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description).
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics.
Proceedings of the Advances in Modal Logic 10, 2014

2013
Integrating generic sensor fusion algorithms with sound state representations through encapsulation of manifolds.
Inf. Fusion, 2013

A coinductive calculus for asynchronous side-effecting processes.
Inf. Comput., 2013

Preface.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013

Exploring the Boundaries of Monad Tensorability on Set.
Log. Methods Comput. Sci., 2013

A Relatively Complete Generic Hoare Logic for Order-Enriched Effects.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC.
Proceedings of the IJCAI 2013, 2013

Coalgebraic Announcement Logics.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Reasoning with Bounded Self-reference Using Logical Interpreters.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

Preface to CALCO-Tools.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Simulations and Bisimulations for Coalgebraic Modal Logics.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012
Coalgebraic Predicate Logic.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Narcissists Are Easy, Stepmothers Are Hard.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Extending ALCQ with Bounded Self-Reference.
Proceedings of the Advances in Modal Logic 9, 2012

2011
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra.
Math. Struct. Comput. Sci., 2011

Generic Modal Cut Elimination Applied to Conditional Logics
Log. Methods Comput. Sci., 2011

Modal Logics are Coalgebraic.
Comput. J., 2011

Powermonads and Tensors of Unranked Effects.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Description Logics and Fuzzy Probability.
Proceedings of the IJCAI 2011, 2011

Formalizing and Operationalizing Industrial Standards.
Proceedings of the Fundamental Approaches to Software Engineering, 2011

The Complexity of Probabilistic EL.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

A Counterexample to Tensorability of Effects.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

A Closer Look at the Probabilistic Description Logic Prob-EL.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Rank-1 Modal Logics are Coalgebraic.
J. Log. Comput., 2010

Cut elimination in coalgebraic logics.
Inf. Comput., 2010

A generic complete dynamic logic for reasoning about purity and effects.
Formal Aspects Comput., 2010

Named Models in Coalgebraic Hybrid Logic.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Probabilistic Description Logics for Subjective Uncertainty.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Coalgebraic Correspondence Theory.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

Optimal Tableaux for Conditional Logics with Cautious Monotonicity.
Proceedings of the ECAI 2010, 2010

Flat Coalgebraic Fixed Point Logics.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Global Caching for Coalgebraic Description Logics.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009
PSPACE bounds for rank-1 modal logics.
ACM Trans. Comput. Log., 2009

HasCasl: Integrated higher-order specification and program development.
Theor. Comput. Sci., 2009

Optimizing Conditional Logic Reasoning within CoLoSS.
Proceedings of the 6th Workshop on Methods for Modalities, 2009

Strong Completeness of Coalgebraic Modal Logics.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Nominals for Everyone.
Proceedings of the IJCAI 2009, 2009

Coalgebraic Hybrid Logic.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Formal Management of CAD/CAM Processes.
Proceedings of the FM 2009: Formal Methods, 2009

Kleene Monads: Handling Iteration in a Framework of Generic Effects.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Expressivity of coalgebraic modal logic: The limits and beyond.
Theor. Comput. Sci., 2008

Bootstrapping Inductive and Coinductive Types in HasCASL.
Log. Methods Comput. Sci., 2008

Admissibility of Cut in Coalgebraic Logics.
Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, 2008

The craft of model making: PSPACE bounds for non-iterative modal logics
CoRR, 2008

How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Shallow Models for Non-iterative Modal Logics.
Proceedings of the KI 2008: Advances in Artificial Intelligence, 2008

Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
A finite model construction for coalgebraic modal logic.
J. Log. Algebraic Methods Program., 2007

An Institutional View on Categorical Logic.
Int. J. Softw. Informatics, 2007

CoLoSS: The Coalgebraic Logic Satisfiability Solver.
Proceedings of the 5th Workshop on Methods for Modalities, 2007

Modular Algorithms for Heterogeneous Modal Logics.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables.
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

Bootstrapping Types and Cotypes in HasCASL.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
The HASCASL prologue: Categorical syntax and semantics of the partial <i>lambda</i>-calculus.
Theor. Comput. Sci., 2006

A coalgebraic approach to the semantics of the ambient calculus.
Theor. Comput. Sci., 2006

Algebraic-coalgebraic specification in CoCasl.
J. Log. Algebraic Methods Program., 2006

Coalgebraic Modal Logic in CoCasl.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2006

Completeness of Global Evaluation Logic.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Closing a Million-Landmarks Loop.
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006

2005
Amalgamation in the semantics of CASL.
Theor. Comput. Sci., 2005

Iterative Circular Coinduction for CoCasl in Isabelle/HOL.
Proceedings of the Fundamental Approaches to Software Engineering, 2005

Parametrized Exceptions.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

Towards a Coalgebraic Semantics of the Ambient Calculus.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Monad-independent Dynamic Logic in HasCasl.
J. Log. Comput., 2004

Type Class Polymorphism in an Institutional Framework.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2004

CCC - The Casl Consistency Checker.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2004

The Logic of the Partial lambda-Calculus with Equality.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

Generic Exception Handling and the Java Monad.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
CoCASL at Work -- Modelling Process Algebra.
Proceedings of the 6th International Workshop on Coalgebraic Methods in Computer Science, 2003

Monad-Independent Hoare Logic in HASCASL.
Proceedings of the Fundamental Approaches to Software Engineering, 2003

Henkin Models of the Partial sigma-Calculus.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Universal Aspects of Probabilistic Automata.
Math. Struct. Comput. Sci., 2002

Classifying categories for partial equational logic.
Proceedings of the Category Theory and Computer Science, 2002

Monads on Composition Graphs.
Appl. Categorical Struct., 2002

Monad-Independent Dynamic Logic in Has Casl.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

Algebraic-Coalgebraic Specification in Co Casl.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

HASCASL: Towards Integrated Specification and Development of Functional Programs.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Free Factorizations.
Appl. Categorical Struct., 2001

Towards Trustworthy Specifications I: Consistency Checks.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2001

Checking Amalgamability Conditions for C ASL Architectural Specifications.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Amalgamation in CASL via Enriched Signatures.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Semantics of Architectural Specifications in CASL.
Proceedings of the Fundamental Approaches to Software Engineering, 2001

Life without the Terminal Type.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Free Adjunction of Morphisms.
Appl. Categorical Struct., 2000

1999
Specifying Real Numbers in CASL.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1999


  Loading...