default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLutz Schröder
Person information
- affiliation: University of Erlangen-Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]Daniel Hausmann
, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi. Log. Methods Comput. Sci. 20(3) (2024)- [j47]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
A point-free perspective on lax extensions and predicate liftings. Math. Struct. Comput. Sci. 34(2): 98-127 (2024) - [c124]Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Karla Messing:
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. CMCS 2024: 114-134 - [c123]Simon Prucker, Lutz Schröder:
Nominal Tree Automata with Name Allocation. CONCUR 2024: 35:1-35:17 - [c122]Sergey Goncharov, Alessio Santamaria, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Logical Predicates in Higher-Order Mathematical Operational Semantics. FoSSaCS (2) 2024: 47-69 - [c121]Nathan Dykes, Stephanie Evert, Philipp Heinrich, Merlin Humml, Lutz Schröder:
Finding Argument Fragments on Social Media with Corpus Queries and LLMs. RATIO 2024: 163-181 - [c120]Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild:
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. STACS 2024: 10:1-10:19 - [c119]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Generic Model Checking for Modal Fixpoint Logics in COOL-MC. VMCAI (1) 2024: 171-185 - [i67]Sergey Goncharov, Alessio Santamaria, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Logical Predicates in Higher-Order Mathematical Operational Semantics. CoRR abs/2401.05872 (2024) - [i66]Simon Prucker, Lutz Schröder:
Nominal Tree Automata With Name Allocation. CoRR abs/2405.14272 (2024) - [i65]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics. CoRR abs/2405.16708 (2024) - [i64]Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat:
Alternating Nominal Automata with Name Allocation. CoRR abs/2408.03658 (2024) - 2023
- [j46]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. Proc. ACM Program. Lang. 7(POPL): 632-658 (2023) - [c118]Merlin Humml, Lutz Schröder:
Common Knowledge of Abstract Groups. AAAI 2023: 6434-6441 - [c117]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description). CADE 2023: 234-247 - [c116]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics (Early Ideas). CALCO 2023: 24:1-24:3 - [c115]Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. CSL 2023: 22:1-22:20 - [c114]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Kantorovich Functors and Characteristic Logics for Behavioural Distances. FoSSaCS 2023: 46-67 - [c113]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. LICS 2023: 1-13 - [d4]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmarking scripts for COOL 2.3. Zenodo, 2023
- [d3]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmarking scripts for COOL 2.3. Zenodo, 2023 - [d2]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmarking scripts for COOL 2.4. Zenodo, 2023 - [i63]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. CoRR abs/2302.08200 (2023) - [i62]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics. CoRR abs/2305.11015 (2023) - [i61]Merlin Humml, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus With Disjunctive Explicit Strategies. CoRR abs/2305.18795 (2023) - [i60]Jonas Forster, Lutz Schröder, Paul Wild:
Quantitative Graded Semantics and Spectra of Behavioural Metrics. CoRR abs/2306.01487 (2023) - [i59]Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing:
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. CoRR abs/2307.14826 (2023) - [i58]Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild:
Expressive Quantale-valued Logics for Coalgebras: an Adjunction-based Approach. CoRR abs/2310.05711 (2023) - [i57]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Generic Model Checking for Modal Fixpoint Logics in COOL-MC. CoRR abs/2311.01315 (2023) - 2022
- [j45]Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions. Log. Methods Comput. Sci. 18(2) (2022) - [j44]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. Log. Methods Comput. Sci. 18(4) (2022) - [j43]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. ACM Trans. Comput. Log. 23(2): 11:1-11:34 (2022) - [c112]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. FSCD 2022: 30:1-30:19 - [c111]Chase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar, Barbara König:
Graded Monads and Behavioural Equivalence Games. LICS 2022: 61:1-61:13 - [e2]Patricia Bouyer, Lutz Schröder:
Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings. Lecture Notes in Computer Science 13242, Springer 2022, ISBN 978-3-030-99252-1 [contents] - [d1]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmark data for COOL 2.2. Zenodo, 2022 - [i56]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantalic Behavioural Distances. CoRR abs/2202.07069 (2022) - [i55]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. CoRR abs/2202.10866 (2022) - [i54]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. CoRR abs/2203.11175 (2022) - [i53]Harsh Beohar, Chase Ford, Barbara König, Stefan Milius, Lutz Schröder:
Graded Monads and Behavioural Equivalence Games. CoRR abs/2203.15467 (2022) - [i52]Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
Uniform Interpolation in Coalgebraic Modal Logic. CoRR abs/2205.00448 (2022) - [i51]Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. CoRR abs/2207.09187 (2022) - [i50]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. CoRR abs/2210.13387 (2022) - [i49]Merlin Humml, Lutz Schröder:
Common Knowledge of Abstract Groups. CoRR abs/2211.16284 (2022) - [i48]Daniel Hausmann, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi. CoRR abs/2212.11055 (2022) - 2021
- [j42]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From generic partition refinement to weighted tree automata minimization. Formal Aspects Comput. 33(4-5): 695-727 (2021) - [j41]Natalie Dykes, Stefan Evert, Merlin Göttlinger, Philipp Heinrich, Lutz Schröder:
Argument parsing via corpus queries. it Inf. Technol. 63(1): 31-44 (2021) - [j40]Jirí Adámek, Chase Ford, Stefan Milius, Lutz Schröder:
Finitary monads on the category of posets. Math. Struct. Comput. Sci. 31(7): 799-821 (2021) - [j39]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A metalanguage for guarded iteration. Theor. Comput. Sci. 880: 111-137 (2021) - [c110]Chase Ford, Stefan Milius, Lutz Schröder:
Monads on Categories of Relational Structures. CALCO 2021: 14:1-14:17 - [c109]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CONCUR 2021: 4:1-4:16 - [c108]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CONCUR 2021: 32:1-32:18 - [c107]Merlin Göttlinger, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies. CSL 2021: 26:1-26:22 - [c106]Paul Wild, Lutz Schröder:
A Quantified Coalgebraic van Benthem Theorem. FoSSaCS 2021: 551-571 - [c105]Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. LICS 2021: 1-13 - [c104]Daniel Hausmann, Stefan Milius, Lutz Schröder:
A Linear-Time Nominal μ-Calculus with Name Allocation. MFCS 2021: 58:1-58:18 - [c103]Daniel Hausmann, Lutz Schröder:
Quasipolynomial Computation of Nested Fixpoints. TACAS (1) 2021: 38-56 - [i47]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CoRR abs/2105.00669 (2021) - [i46]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CoRR abs/2107.03213 (2021) - [i45]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
A Point-free Perspective on Lax extensions and Predicate liftings. CoRR abs/2112.12681 (2021) - 2020
- [j38]Natalie Dykes, Stefan Evert, Merlin Göttlinger, Philipp Heinrich, Lutz Schröder:
Reconstructing Arguments from Noisy Text. Datenbank-Spektrum 20(2): 123-129 (2020) - [j37]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. Log. Methods Comput. Sci. 16(1) (2020) - [c102]Jonas Forster, Lutz Schröder:
Non-Iterative Modal Logics Are Coalgebraic. AiML 2020: 229-248 - [c101]Daniel Hausmann, Lutz Schröder:
NP Reasoning in the Monotone μ-Calculus. IJCAR (1) 2020: 482-499 - [c100]Barbara König, Christina Mika-Michalski, Lutz Schröder:
Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. CMCS 2020: 133-154 - [c99]Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. CONCUR 2020: 27:1-27:23 - [c98]Henning Urbat, Lutz Schröder:
Automata Learning: An Algebraic Approach. LICS 2020: 900-914 - [i44]Daniel Hausmann, Lutz Schröder:
NP Reasoning in the Monotone $μ$-Calculus. CoRR abs/2002.05075 (2020) - [i43]Barbara König, Christina Mika-Michalski, Lutz Schröder:
Explaining Non-Bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. CoRR abs/2002.11459 (2020) - [i42]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From Generic Partition Refinement to Weighted Tree Automata Minimization. CoRR abs/2004.01250 (2020) - [i41]Jonas Forster, Lutz Schröder:
Non-iterative Modal Logics are Coalgebraic. CoRR abs/2006.05396 (2020) - [i40]Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. CoRR abs/2007.01033 (2020) - [i39]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. CoRR abs/2009.00971 (2020) - [i38]Daniel Hausmann, Stefan Milius, Lutz Schröder:
Harnessing LTL With Freeze Quantification. CoRR abs/2010.10912 (2020) - [i37]Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. CoRR abs/2011.14339 (2020)
2010 – 2019
- 2019
- [j36]Stefan Evert, Philipp Heinrich, Klaus Henselmann, Ulrich Rabenstein, Elisabeth Scherr, Martin Schmitt, Lutz Schröder:
Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures. J. Log. Lang. Inf. 28(2): 309-330 (2019) - [j35]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Guarded and Unguarded Iteration for Generalized Processes. Log. Methods Comput. Sci. 15(3) (2019) - [c97]Daniel Hausmann, Lutz Schröder:
Game-Based Local Model Checking for the Coalgebraic mu-Calculus. CONCUR 2019: 35:1-35:16 - [c96]Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. CONCUR 2019: 36:1-36:16 - [c95]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Generic Partition Refinement and Weighted Tree Automata. FM 2019: 280-297 - [c94]Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic \mu -Calculi. FoSSaCS 2019: 277-294 - [c93]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. IJCAI 2019: 1900-1906 - [i36]Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic μ-Calculi. CoRR abs/1901.04893 (2019) - [i35]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. CoRR abs/1906.00784 (2019) - [i34]Daniel Hausmann, Lutz Schröder:
Computing Nested Fixpoints in Quasipolynomial Time. CoRR abs/1907.07020 (2019) - [i33]Henning Urbat, Lutz Schröder:
Automata Learning: An Algebraic Approach. CoRR abs/1911.00874 (2019) - 2018
- [j34]Stefan Kraus, Marc Rosenbauer, Lutz Schröder, Thomas Bürkle, Klaus-Peter Adlassnig, Dennis Toddenroth:
A detailed analysis of the Arden Syntax expression grammar. J. Biomed. Informatics 83: 196-203 (2018) - [j33]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of Coalgebraic Predicate Logic. Log. Methods Comput. Sci. 14(1) (2018) - [j32]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Julian Jakob:
Unguarded Recursion on Coinductive Resumptions. Log. Methods Comput. Sci. 14(3) (2018) - [j31]Lutz Schröder, Yde Venema:
Completeness of Flat Coalgebraic Fixpoint Logics. ACM Trans. Comput. Log. 19(1): 4:1-4:34 (2018) - [c92]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CMCS 2018: 56-77 - [c91]Sergey Goncharov, Lutz Schröder:
Guarded Traced Categories. FoSSaCS 2018: 313-330 - [c90]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A Metalanguage for Guarded Iteration. ICTAC 2018: 191-210 - [c89]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Fuzzy Modal Logic. LICS 2018: 909-918 - [c88]Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive \mu μ -Calculus. TACAS (2) 2018: 361-378 - [i32]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Fuzzy Modal Logic. CoRR abs/1802.00478 (2018) - [i31]Sergey Goncharov, Lutz Schröder:
Guarded Traced Categories. CoRR abs/1802.08756 (2018) - [i30]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CoRR abs/1805.07211 (2018) - [i29]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. CoRR abs/1806.05654 (2018) - [i28]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A Metalanguage for Guarded Iteration. CoRR abs/1807.11256 (2018) - [i27]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Quantitative Probabilistic Modal Logic. CoRR abs/1810.04722 (2018) - [i26]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
CoPaR: An Efficient Generic Partition Refiner. CoRR abs/1811.08850 (2018) - [i25]Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads for the Linear Time - Branching Time Spectrum. CoRR abs/1812.01317 (2018) - [i24]Merlin Göttlinger, Lutz Schröder:
Trichotomic Argumentation Representation. CoRR abs/1812.06745 (2018) - 2017
- [j30]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder:
Probabilistic Description Logics for Subjective Uncertainty. J. Artif. Intell. Res. 58: 1-66 (2017) - [j29]Lutz Schröder, Dirk Pattinson, Tadeusz Litak:
A Van Benthem/Rosen theorem for coalgebraic predicate logic. J. Log. Comput. 27(3): 749-773 (2017) - [c87]Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
Uniform Interpolation in Coalgebraic Modal Logic. CALCO 2017: 21:1-21:16 - [c86]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Efficient Coalgebraic Partition Refinement. CONCUR 2017: 32:1-32:16 - [c85]Hans-Peter Deifel, Merlin Göttlinger, Stefan Milius, Lutz Schröder, Christian Dietrich, Daniel Lohmann:
Automatic verification of application-tailored OSEK kernels. FMCAD 2017: 196-203 - [c84]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. FoSSaCS 2017: 124-142 - [c83]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Unifying Guarded and Unguarded Iteration. FoSSaCS 2017: 517-533 - [c82]Paul Wild, Lutz Schröder:
A Characterization Theorem for a Modal Description Logic. IJCAI 2017: 1304-1310 - [c81]Daniel Gorín, Malte Meyn, Alexander Naumann, Miriam Polzer, Ulrich Rabenstein, Lutz Schröder:
Ontological Modelling of a Psychiatric Clinical Practice Guideline. KI 2017: 300-308 - [i23]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of CPL. CoRR abs/1701.03773 (2017) - [i22]Paul Wild, Lutz Schröder:
A Characterization Theorem for a Modal Description Logic. CoRR abs/1705.06214 (2017) - [i21]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
A Coalgebraic Paige-Tarjan Algorithm. CoRR abs/1705.08362 (2017) - [i20]Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive mu-Calculus. CoRR abs/1710.08996 (2017) - [i19]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Guarded and Unguarded Iteration for Generalized Processes. CoRR abs/1712.09574 (2017) - 2016
- [j28]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. Appl. Categorical Struct. 24(5): 663-701 (2016) - [c80]Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CONCUR 2016: 34:1-34:15 - [c79]Dirk Pattinson, Lutz Schröder:
Program Equivalence is Coinductive. LICS 2016: 337-346 - [c78]Christoph Rauch, Sergey Goncharov, Lutz Schröder:
Generic Hoare Logic for Order-Enriched Effects with Exceptions. WADT 2016: 208-222 - [i18]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. CoRR abs/1603.01455 (2016) - [i17]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names. CoRR abs/1607.07828 (2016) - [i16]Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CoRR abs/1609.06379 (2016) - 2015
- [j27]Till Mossakowski, Lutz Schröder:
On Inconsistency and Unsatisfiability. Int. J. Softw. Informatics 9(2): 141-152 (2015) - [j26]Dirk Pattinson, Lutz Schröder:
From the Editors. J. Comput. Syst. Sci. 81(5): 797-798 (2015) - [c77]Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder:
Simplified Coalgebraic Trace Equivalence. Software, Services, and Systems 2015: 75-90 - [c76]Stefan Milius, Dirk Pattinson, Lutz Schröder:
Generic Trace Semantics and Graded Monads. CALCO 2015: 253-269 - [c75]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Reasoning with Global Assumptions in Arithmetic Modal Logics. FCT 2015: 367-380 - [c74]Daniel Hausmann, Lutz Schröder:
Global Caching for the Flat Coalgebraic µ-Calculus. TIME 2015: 121-130 - [c73]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
Unguarded Recursion on Coinductive Resumptions. MFPS 2015: 183-198 - [c72]Dirk Pattinson, Lutz Schröder:
Sound and Complete Equational Reasoning over Comodels. MFPS 2015: 315-331 - 2014
- [c71]Daniel Gorín, Lutz Schröder:
Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics. Advances in Modal Logic 2014: 254-273 - [c70]Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, Thorsten Wißmann:
Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). IJCAR 2014: 396-402 - [c69]Thilo Breitsprecher, Mihai Codescu, Constantin Jucovschi, Michael Kohlhase, Lutz Schröder, Sandro Wartzack:
Towards Ontological Support for Principle Solutions in Mechanical Engineering. FOMI@FOIS 2014 - [c68]Thilo Breitsprecher, Mihai Codescu, Constantin Jucovschi, Michael Kohlhase, Lutz Schröder, Sandro Wartzack:
Towards Ontological Support for Principle Solutions in Mechanical Engineering. FOIS 2014: 427-432 - [c67]Jean Christoph Jung, Carsten Lutz, Sergey Goncharov, Lutz Schröder:
Monodic Fragments of Probabilistic First-Order Logic. ICALP (2) 2014: 256-267 - [i15]Daniel Gorín, Lutz Schröder:
Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics. CoRR abs/1401.6359 (2014) - [i14]Sergey Goncharov, Lutz Schröder, Christoph Rauch:
(Co-)Algebraic Foundations for Effect Handling and Iteration. CoRR abs/1405.0854 (2014) - [i13]Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder:
Simplified Coalgebraic Trace Equivalence. CoRR abs/1410.2463 (2014) - 2013
- [j25]Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder:
Exploring the Boundaries of Monad Tensorability on Set. Log. Methods Comput. Sci. 9(3) (2013) - [j24]Till Mossakowski, Markus Roggenbach, Lutz Schröder:
Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 62 (2013) - [j23]Sergey Goncharov, Lutz Schröder:
A coinductive calculus for asynchronous side-effecting processes. Inf. Comput. 231: 204-232 (2013) - [j22]Christoph Hertzberg, René Wagner, Udo Frese, Lutz Schröder:
Integrating generic sensor fusion algorithms with sound state representations through encapsulation of manifolds. Inf. Fusion 14(1): 57-77 (2013) - [c66]Daniel Gorín, Lutz Schröder:
Simulations and Bisimulations for Coalgebraic Modal Logics. CALCO 2013: 253-266 - [c65]Lutz Schröder:
Preface to CALCO-Tools. CALCO 2013: 314 - [c64]Daniel Gorín, Lutz Schröder, Thorsten Wißmann:
Reasoning with Bounded Self-reference Using Logical Interpreters. Description Logics 2013: 689-703 - [c63]Facundo Carreiro, Daniel Gorín, Lutz Schröder:
Coalgebraic Announcement Logics. ICALP (2) 2013: 101-112 - [c62]Agnieszka Kulacka, Dirk Pattinson, Lutz Schröder:
Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC. IJCAI 2013: 962-968 - [c61]Sergey Goncharov, Lutz Schröder:
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects. LICS 2013: 273-282 - [i12]Daniel Gorín, Lutz Schröder:
Simulations and Bisimulations For Coalgebraic Modal Logics. CoRR abs/1303.2467 (2013) - [i11]Thilo Breitsprecher, Mihai Codescu, Constantin Jucovschi, Michael Kohlhase, Lutz Schröder, Sandro Wartzack:
Towards Ontological Support for Principle Solutions in Mechanical Engineering. CoRR abs/1312.2359 (2013) - 2012
- [c60]Daniel Gorín, Lutz Schröder:
Extending ALCQ with Bounded Self-Reference. Advances in Modal Logic 2012: 300-316 - [c59]Daniel Gorín, Lutz Schröder:
Narcissists Are Easy, Stepmothers Are Hard. FoSSaCS 2012: 240-254 - [c58]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Coalgebraic Predicate Logic. ICALP (2) 2012: 299-311 - [e1]Dirk Pattinson, Lutz Schröder:
Coalgebraic Methods in Computer Science - 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 - April 1, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7399, Springer 2012, ISBN 978-3-642-32783-4 [contents] - 2011
- [j21]Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema:
Modal Logics are Coalgebraic. Comput. J. 54(1): 31-41 (2011) - [j20]Dirk Pattinson, Lutz Schröder:
Generic Modal Cut Elimination Applied to Conditional Logics. Log. Methods Comput. Sci. 7(1) (2011) - [j19]Lutz Schröder, Dirk Pattinson:
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. Comput. Sci. 21(2): 235-266 (2011) - [c57]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder:
A Closer Look at the Probabilistic Description Logic Prob-EL. AAAI 2011: 197-202 - [c56]Sergey Goncharov, Lutz Schröder:
A Counterexample to Tensorability of Effects. CALCO 2011: 208-221 - [c55]Jean Christoph Jung, Víctor Gutiérrez-Basulto, Carsten Lutz, Lutz Schröder:
The Complexity of Probabilistic EL. Description Logics 2011 - [c54]Dominik Dietrich, Lutz Schröder, Ewaryst Schulz:
Formalizing and Operationalizing Industrial Standards. FASE 2011: 81-95 - [c53]Sergey Goncharov, Lutz Schröder:
A Coinductive Calculus for Asynchronous Side-Effecting Processes. FCT 2011: 276-287 - [c52]Lutz Schröder, Dirk Pattinson:
Description Logics and Fuzzy Probability. IJCAI 2011: 1075-1081 - [c51]Sergey Goncharov, Lutz Schröder:
Powermonads and Tensors of Unranked Effects. LICS 2011: 227-236 - [i10]Sergey Goncharov, Lutz Schröder:
Powermonads and Tensors of Unranked Effects. CoRR abs/1101.2777 (2011) - [i9]Sergey Goncharov, Lutz Schröder:
A Coinductive Calculus for Asynchronous Side-effecting Processes. CoRR abs/1104.2936 (2011) - [i8]Christoph Hertzberg, René Wagner, Udo Frese, Lutz Schröder:
Integrating Generic Sensor Fusion Algorithms with Sound State Representations through Encapsulation of Manifolds. CoRR abs/1107.1119 (2011) - 2010
- [j18]Till Mossakowski, Lutz Schröder, Sergey Goncharov:
A generic complete dynamic logic for reasoning about purity and effects. Formal Aspects Comput. 22(3-4): 363-384 (2010) - [j17]Dirk Pattinson, Lutz Schröder:
Cut elimination in coalgebraic logics. Inf. Comput. 208(12): 1447-1468 (2010) - [j16]Lutz Schröder, Dirk Pattinson:
Rank-1 Modal Logics are Coalgebraic. J. Log. Comput. 20(5): 1113-1147 (2010) - [c50]Rajeev Goré, Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Global Caching for Coalgebraic Description Logics. IJCAR 2010: 46-60 - [c49]Lutz Schröder, Yde Venema:
Flat Coalgebraic Fixed Point Logics. CONCUR 2010: 524-538 - [c48]Lutz Schröder, Dirk Pattinson, Daniel Hausmann:
Optimal Tableaux for Conditional Logics with Cautious Monotonicity. ECAI 2010: 707-712 - [c47]Lutz Schröder, Dirk Pattinson:
Coalgebraic Correspondence Theory. FoSSaCS 2010: 328-342 - [c46]Carsten Lutz, Lutz Schröder:
Probabilistic Description Logics for Subjective Uncertainty. KR 2010 - [c45]Lutz Schröder, Dirk Pattinson:
Named Models in Coalgebraic Hybrid Logic. STACS 2010: 645-656 - [i7]Lutz Schröder, Dirk Pattinson:
Named Models in Coalgebraic Hybrid Logic. CoRR abs/1001.0735 (2010) - [i6]Lutz Schröder, Yde Venema:
Flat coalgebraic fixed point logics. CoRR abs/1004.2717 (2010)
2000 – 2009
- 2009
- [j15]Lutz Schröder, Till Mossakowski:
HasCasl: Integrated higher-order specification and program development. Theor. Comput. Sci. 410(12-13): 1217-1260 (2009) - [j14]Lutz Schröder, Dirk Pattinson:
PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log. 10(2): 13:1-13:33 (2009) - [c44]Sergey Goncharov, Lutz Schröder, Till Mossakowski:
Kleene Monads: Handling Iteration in a Framework of Generic Effects. CALCO 2009: 18-33 - [c43]Michael Kohlhase, Johannes Lemburg, Lutz Schröder, Ewaryst Schulz:
Formal Management of CAD/CAM Processes. FM 2009: 223-238 - [c42]Robert S. R. Myers, Dirk Pattinson, Lutz Schröder:
Coalgebraic Hybrid Logic. FoSSaCS 2009: 137-151 - [c41]Lutz Schröder, Dirk Pattinson, Clemens Kupke:
Nominals for Everyone. IJCAI 2009: 917-922 - [c40]Lutz Schröder, Dirk Pattinson:
Strong Completeness of Coalgebraic Modal Logics. STACS 2009: 673-684 - [c39]Dirk Pattinson, Lutz Schröder:
Generic Modal Cut Elimination Applied to Conditional Logics. TABLEAUX 2009: 280-294 - [c38]Daniel Hausmann, Lutz Schröder:
Optimizing Conditional Logic Reasoning within CoLoSS. M4M 2009: 157-171 - [i5]Lutz Schröder, Dirk Pattinson:
Strong Completeness of Coalgebraic Modal Logics. CoRR abs/0902.2072 (2009) - 2008
- [j13]Lutz Schröder:
Bootstrapping Inductive and Coinductive Types in HasCASL. Log. Methods Comput. Sci. 4(4) (2008) - [j12]Lutz Schröder:
Expressivity of coalgebraic modal logic: The limits and beyond. Theor. Comput. Sci. 390(2-3): 230-247 (2008) - [c37]Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema:
Modal Logics are Coalgebraic. BCS Int. Acad. Conf. 2008: 128-140 - [c36]Till Mossakowski, Lutz Schröder, Sergey Goncharov:
A Generic Complete Dynamic Logic for Reasoning About Purity and Effects. FASE 2008: 199-214 - [c35]Dirk Pattinson, Lutz Schröder:
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. FoSSaCS 2008: 66-80 - [c34]Lutz Schröder, Dirk Pattinson:
Shallow Models for Non-iterative Modal Logics. KI 2008: 324-331 - [c33]Lutz Schröder, Dirk Pattinson:
How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. KR 2008: 307-317 - [c32]Dirk Pattinson, Lutz Schröder:
Admissibility of Cut in Coalgebraic Logics. CMCS 2008: 221-241 - [i4]Lutz Schröder, Dirk Pattinson:
The craft of model making: PSPACE bounds for non-iterative modal logics. CoRR abs/0802.0116 (2008) - [i3]Lutz Schröder:
Bootstrapping Inductive and Coinductive Types in HasCASL. CoRR abs/0812.3836 (2008) - 2007
- [j11]Joseph A. Goguen, Till Mossakowski, Valeria de Paiva, Florian Rabe, Lutz Schröder:
An Institutional View on Categorical Logic. Int. J. Softw. Informatics 1(1): 129-152 (2007) - [j10]Lutz Schröder:
A finite model construction for coalgebraic modal logic. J. Log. Algebraic Methods Program. 73(1-2): 97-110 (2007) - [c31]Lutz Schröder:
Bootstrapping Types and Cotypes in HasCASL. CALCO 2007: 447-461 - [c30]Stefan Wölfl, Till Mossakowski, Lutz Schröder:
Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. FLAIRS 2007: 665-670 - [c29]Lutz Schröder, Dirk Pattinson:
Modular Algorithms for Heterogeneous Modal Logics. ICALP 2007: 459-471 - [c28]Lutz Schröder, Dirk Pattinson:
Rank-1 Modal Logics Are Coalgebraic. STACS 2007: 573-585 - [c27]Georgel Calin, Robert S. R. Myers, Dirk Pattinson, Lutz Schröder:
CoLoSS: The Coalgebraic Logic Satisfiability Solver. M4M 2007: 41-54 - [i2]Lutz Schröder, Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics. CoRR abs/0706.4044 (2007) - 2006
- [j9]Till Mossakowski, Lutz Schröder, Markus Roggenbach, Horst Reichel:
Algebraic-coalgebraic specification in CoCasl. J. Log. Algebraic Methods Program. 67(1-2): 146-197 (2006) - [j8]Lutz Schröder:
The HASCASL prologue: Categorical syntax and semantics of the partial lambda-calculus. Theor. Comput. Sci. 353(1-3): 1-25 (2006) - [j7]Daniel Hausmann, Till Mossakowski, Lutz Schröder:
A coalgebraic approach to the semantics of the ambient calculus. Theor. Comput. Sci. 366(1-2): 121-143 (2006) - [c26]Lutz Schröder:
A Finite Model Construction for Coalgebraic Modal Logic. FoSSaCS 2006: 157-171 - [c25]Udo Frese, Lutz Schröder:
Closing a Million-Landmarks Loop. IROS 2006: 5032-5039 - [c24]Lutz Schröder, Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics. LICS 2006: 231-242 - [c23]Sergey Goncharov, Lutz Schröder, Till Mossakowski:
Completeness of Global Evaluation Logic. MFCS 2006: 447-458 - [c22]Lutz Schröder, Till Mossakowski:
Coalgebraic Modal Logic in CoCasl. WADT 2006: 127-141 - 2005
- [j6]Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman:
Amalgamation in the semantics of CASL. Theor. Comput. Sci. 331(1): 215-247 (2005) - [c21]Daniel Hausmann, Till Mossakowski, Lutz Schröder:
Towards a Coalgebraic Semantics of the Ambient Calculus. CALCO 2005: 232-246 - [c20]Dennis Walter, Lutz Schröder, Till Mossakowski:
Parametrized Exceptions. CALCO 2005: 424-438 - [c19]Daniel Hausmann, Till Mossakowski, Lutz Schröder:
Iterative Circular Coinduction for CoCasl in Isabelle/HOL. FASE 2005: 341-356 - [c18]Lutz Schröder:
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. FoSSaCS 2005: 440-454 - [i1]Stefan Wölfl, Till Mossakowski, Lutz Schröder:
Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. Spatial Cognition: Specialization and Integration 2005 - 2004
- [j5]Lutz Schröder, Till Mossakowski:
Monad-independent Dynamic Logic in HasCasl. J. Log. Comput. 14(4): 571-619 (2004) - [c17]Lutz Schröder, Till Mossakowski:
Generic Exception Handling and the Java Monad. AMAST 2004: 443-459 - [c16]Lutz Schröder:
The Logic of the Partial lambda-Calculus with Equality. CSL 2004: 385-399 - [c15]Christoph Lüth, Markus Roggenbach, Lutz Schröder:
CCC - The Casl Consistency Checker. WADT 2004: 94-105 - [c14]Lutz Schröder, Till Mossakowski, Christoph Lüth:
Type Class Polymorphism in an Institutional Framework. WADT 2004: 234-251 - 2003
- [c13]Lutz Schröder:
Henkin Models of the Partial sigma-Calculus. CSL 2003: 498-512 - [c12]Lutz Schröder, Till Mossakowski:
Monad-Independent Hoare Logic in HASCASL. FASE 2003: 261-277 - [c11]Till Mossakowski, Markus Roggenbach, Lutz Schröder:
CoCASL at Work -- Modelling Process Algebra. CMCS 2003: 206-220 - 2002
- [j4]Lutz Schröder:
Monads on Composition Graphs. Appl. Categorical Struct. 10(3): 221-236 (2002) - [j3]Lutz Schröder, Paulo Mateus:
Universal Aspects of Probabilistic Automata. Math. Struct. Comput. Sci. 12(4): 481-512 (2002) - [c10]Lutz Schröder, Till Mossakowski:
HASCASL: Towards Integrated Specification and Development of Functional Programs. AMAST 2002: 99-116 - [c9]Till Mossakowski, Horst Reichel, Markus Roggenbach, Lutz Schröder:
Algebraic-Coalgebraic Specification in Co Casl. WADT 2002: 376-392 - [c8]Lutz Schröder, Till Mossakowski:
Monad-Independent Dynamic Logic in Has Casl. WADT 2002: 425-441 - [c7]Lutz Schröder:
Classifying categories for partial equational logic. CTCS 2002: 305-322 - 2001
- [j2]Lutz Schröder, Horst Herrlich:
Free Factorizations. Appl. Categorical Struct. 9(6): 571-593 (2001) - [c6]Lutz Schröder:
Life without the Terminal Type. CSL 2001: 429-442 - [c5]Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman:
Semantics of Architectural Specifications in CASL. FASE 2001: 253-268 - [c4]Lutz Schröder, Till Mossakowski, Andrzej Tarlecki:
Amalgamation in CASL via Enriched Signatures. ICALP 2001: 993-1004 - [c3]Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski:
Checking Amalgamability Conditions for C ASL Architectural Specifications. MFCS 2001: 451-463 - [c2]Markus Roggenbach, Lutz Schröder:
Towards Trustworthy Specifications I: Consistency Checks. WADT 2001: 305-327 - 2000
- [j1]Lutz Schröder, Horst Herrlich:
Free Adjunction of Morphisms. Appl. Categorical Struct. 8(4): 595-606 (2000)
1990 – 1999
- 1999
- [c1]Markus Roggenbach, Lutz Schröder, Till Mossakowski:
Specifying Real Numbers in CASL. WADT 1999: 146-161
Coauthor Index
[c117] [d4] [d3] [d2] [i62] [i61] [j43] [d1] [i52] [c107] [i39] [c93] [i35] [j33] [c89] [i32] [i27] [j29] [c87] [i23] [c79] [j26] [c77] [c76] [c75] [c72] [c70] [i13] [c62] [c58] [e1] [j21] [j20] [j19] [c52] [j17] [j16] [c50] [c48] [c47] [c45] [i7] [j14] [c42] [c41] [c40] [c39] [i5] [c37] [c35] [c34] [c33] [c32] [i4] [c29] [c28] [c27] [i2] [c24]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
