Universität Bremen  
  university department wg bkb  
  Dept. Math. Comp. Sci. > wg bkb > Lutz Schröder > Deutsch
English
 

Lutz Schröder: List of Publications

 
 

Books, conference proceedings    Articles in journals    Refereed articles in conference proceedings    Technical reports, other publications




Articles in journals 

Go to year:  to appear   2008   2007   2006   2005   2004   2002   2001   2000   1999 


to appear     Back to top

Lutz Schröder, Dirk Pattinson. PSPACE Bounds for Rank-1 Modal Logics. In ACM Transactions on Computational Logic. To appear. Preprint available as e-print arXiv:0706.4044. Extends (Schröder and Pattinson 2006).   detail
Lutz Schröder, Dirk Pattinson. Rank-1 modal logics are coalgebraic . In Journal of Logic and Computation. To appear. Extends (Schröder and Pattinson STACS 2007).   detail   pdf
Lutz Schröder, Till Mossakowski. HasCASL: Integrated Higher-Order Specification and Program Development. In Theoretical Computer Science. To appear.   detail
Lutz Schröder. Bootstrapping Types and Cotypes in HasCASL. In Logical Methods in Computer Science. To appear.   detail

2008     Back to top

Lutz Schröder (2008). Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. In Theoretical Computer Science, Vol. 390, pp. 230–247. Extends (Schröder 2005).   detail     www   pdf
Lutz Schröder (2008). Linearizability of Non-expansive Semigroup Actions on Metric Spaces. In Topology and its Applications, Vol. 155, pp. 1576–1579. Preliminary version appeared as DFKI Research Report RR-06-1, DFKI GmbH, Kaiserslautern, 2006.   detail   pdf

2007     Back to top

Lutz Schröder (2007). A finite model construction for coalgebraic modal logic. In Journal of Logic and Algebraic Programming (FOSSACS 06 special issue), Vol. 73, pp. 97–110. Extends (Schröder 2006).   detail     www   pdf

2006     Back to top

Daniel Hausmann, Till Mossakowski, Lutz Schröder (2006). A Coalgebraic Approach to the Semantics of the Ambient Calculus. In Theoretical Computer Science, 366 (1-2), pp. 121–143. Extends (Hausmann et al. 2005).   detail     www   pdf
Till Mossakowski, Lutz Schröder, Markus Roggenbach, Horst Reichel (2006). Algebraic-co-algebraic specification in CoCASL. In Journal of Logic and Algebraic Programming, 67 (1-2), pp. 146–197. Extends (Mossakowski et al. 2003).   detail     www   pdf   postscript
Lutz Schröder (2006). The HasCASL Prologue - Categorical Syntax and Semantics of the Partial λ-calculus. In Theoret. Comput. Sci., Vol. 353, pp. 1–25.   detail     www   pdf   postscript

2005     Back to top

Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Piotr Hoffman, Bartek Klin (2005). Amalgamation in the semantics of CASL. In Theoretical Computer Science, 331 (1), pp. 215–247.   detail     www   pdf   postscript

2004     Back to top

Michael Megrelishvili, Lutz Schröder (2004). Globalization of Confluent Partial Actions on Topological and Metric Spaces. In Topology and Applications, Vol. 145, pp. 119–145.   detail   pdf   postscript
Lutz Schröder, Till Mossakowski (2004). Monad-independent dynamic logic in HasCASL. In Journal of Logic and Computation, 14 (4), pp. 571–619. Earlier version appeared in Martin Wirsing, Dirk Pattinson, and Rolf Hennicker (eds.), Recent Trends in Algebraic Development Techniques, 16th International Workshop (WADT 2002), LNCS vol. 2755, Springer, Berlin, 2003, pp. 425-441.   detail     www   pdf   postscript

2002     Back to top

Lutz Schröder (2002). Monads on composition graphs. In Applied Categorical Structures, Vol. 10, pp. 221–236.   detail   postscript
Lutz Schröder, Paulo Mateus (2002). Universal aspects of probabilistic automata. In Math. Struct. Comput. Sci., Vol. 12, pp. 481–512.   detail   postscript

2001     Back to top

Lutz Schröder (2001). Traces of Epimorphism classes. In Quaestiones Mathematicae, Vol. 24, pp. 193–200.   detail   postscript
Lutz Schröder, Horst Herrlich (2001). Free factorizations. In Applied Categorical Structures, Vol. 9, pp. 571–593.   detail   postscript

2000     Back to top

Lutz Schröder (2000). Isomorphisms and splitting of idempotents in semicategories. In Cahiers de Topologie et Géométrie Différentielle catégoriques, Vol. 41, pp. 143–153.   detail   postscript
Lutz Schröder, Horst Herrlich (2000). Free adjunction of morphisms. In Applied Categorical Structures, Vol. 8, pp. 595–606.   detail   pdf
Lutz Schröder, Horst Herrlich (2000). Abstract initiality. In Commentationes Mathematicae Universitatis Carolinae, Vol. 41, pp. 575–583.   detail   postscript

1999     Back to top

Horst Herrlich, Lutz Schröder (1999). Composing special epimorphisms and retractions. In Cahiers de Topologie et Géométrie Différentielle catégoriques, Vol. 40, pp. 221–226.   detail
      Show selected entries in BibTex Format
 

Books, conference proceedings 

Go to year:


 

Refereed articles in conference proceedings 

Go to year:  2009   2008   2007   2006   2005   2004   2003   2002   2001   2000 


2009     Back to top

Lutz Schröder, Dirk Pattinson (2009). Strong completeness of coalgebraic modal logics. In Susanne Albers, Jean-Yves Marion (Eds.), Theoretical Aspects of Computer Science (STACS 2009). To appear.   detail

2008     Back to top

Corina Cirstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema (2008). Modal logics are coalgebraic. In Samson Abramsky, Erol Gelenbe, Vladimiro Sassone (Eds.), Visions of Computer Science, BCS International Academic Research Conference (BCS 2008), pp. 129–140. British Computer Society.   detail   pdf
Till Mossakowski, Lutz Schröder, Sergey Goncharov (2008). A generic complete dynamic logic for reasoning about purity and effects. In J. Fiadeiro, P. Inverardi (Eds.), Fundamental Approaches to Software Engineering (FASE 2008), Vol. 4961, pp. 199–214, Lecture Notes in Computer Science. Springer.   detail     www   pdf
Dirk Pattinson, Lutz Schröder (2008). Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. In Roberto Amadio (Ed.), Foundations of Software Science and Computation Structures (FOSSACS 2008), Vol. 4962, pp. 66–80, Lecture Notes in Computer Science. Springer.   detail     www   pdf
Dirk Pattinson, Lutz Schröder (2008). Admissibility of Cut in Coalgebraic Logics. In J. Adamek, C. Kupke (Eds.), Coalgebraic Methods in Computer Science (CMCS 08), Vol. 203, pp. 221–241, Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam.   detail     www   pdf
Lutz Schröder, Dirk Pattinson (2008). How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. In Gerhard Brewka, Jerôme Lang (Eds.), Principles of Knowledge Representation and Reasoning (KR 2008), pp. 307–218. AAAI Press, Menlo Park, CA. To appear.   detail   pdf
Lutz Schröder, Dirk Pattinson (2008). Shallow models for non-iterative modal logics. In Andreas Dengel, Karsten Berns, Thomas Breuel, Frank Bomarius, Thomas Roth-Berghofer (Eds.), Advances in Artificial Intelligence (KI 2008), Vol. 5243, pp. 324–331, Lecture Notes in Artificial Intelligence. Springer. Full version available as e-print arXiv:0802.0116.   detail     www   pdf

2007     Back to top

Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder (2007). CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description). In Carlos Areces, Stephane Demri (Eds.), Methods for Modalities (M4M-5), Electronic Notes in Theoretical Computer Science. Elsevier Science. To appear.   detail   pdf
Lutz Schröder, Dirk Pattinson (2007). Rank-1 Modal Logics are Coalgebraic. In Wolfgang Thomas, Pascal Weil (Eds.), Theoretical Aspects of Computer Science (STACS 07), Vol. 4393, pp. 573–585, Lecture Notes in Computer Science. Springer. Extended version available.   detail     www   pdf
Lutz Schröder, Till Mossakowski (2007). Coalgebraic Modal Logic in CoCASL. In José Luiz Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 18th International Workshop, WADT 2006, Vol. 4409, pp. 128–142, Lecture Notes in Computer Science. Springer.   detail     www   pdf
Lutz Schröder (2007). Bootstrapping Types and Cotypes in HasCASL. In Till Mossakowski, Udo Montanari (Eds.), Algebra and Coalgebra in Computer Science (CALCO 07), Vol. 4624, pp. 447–462, Lecture Notes in Computer Science. Springer. Extended version available.   detail     www   pdf
Lutz Schröder, Dirk Pattinson (2007). Modular Algorithms for Heterogeneous Modal Logics. In Lars Arge, Andrzej Tarlecki, Christian Cachin (Eds.), Automata, Languages and Programming (ICALP 07), Vol. 4596, pp. 459–471, Lecture Notes in Computer Science. Springer.   detail     www   pdf
Stefan Wölfl, Till Mossakowski, Lutz Schröder (2007). Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. In David Wilson, Geoff Sutcliffe (Eds.), 20th International FLAIRS Conference (FLAIRS-20), pp. 665–670. AAAI Press.   detail   pdf

2006     Back to top

U. Frese, L. Schröder (2006). Closing a Million-Landmarks Loop. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing.   detail     www   pdf
Sergey Goncharov, Lutz Schröder, Till Mossakowski (2006). Completeness of Global Evaluation Logic. In Rastislav Kralovic, Pawel Urzyczyn (Eds.), Mathematical Foundations of Computer Science, Vol. 4162, pp. 447–458, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Till Mossakowski, Lutz Schröder, Stefan Wölfl (2006). A Categorical Perspective on Qualitative Constraint Calculi. In Stefan Wölfl, Till Mossakowski (Eds.), Qualitative Constraint Calculi - Application and Integration. Workshop at KI 2006, pp. 28–39.   detail   pdf   postscript
Lutz Schröder (2006). A Finite Model Construction for Coalgebraic Modal Logic. In Luca Aceto, Anna Ingólfsdóttir (Eds.), Foundations Of Software Science And Computation Structures, Vol. 3921, pp. 157–171, Lecture Notes in Computer Science. Springer, Berlin. EATCS Best Paper Award at ETAPS 2006.   detail     www   pdf   postscript
Lutz Schröder, Dirk Pattinson (2006). PSPACE Bounds for Rank 1 Modal Logics. In Rajeev Alur (Ed.), Logic in Computer Science (LICS 06), pp. 231–240. IEEE. Presentation slides available.   detail     www   pdf

2005     Back to top

Daniel Hausmann, Till Mossakowski, Lutz Schröder (2005). Iterative Circular Coinduction for CoCASL in Isabelle/HOL. In Maura Cerioli (Ed.), Fundamental Approaches to Software Engineering 2005, Vol. 3442, pp. 341–356, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Daniel Hausmann, Till Mossakowski, Lutz Schröder (2005). Towards a Coalgebraic Approach to the Semantics of the Ambient Calculus. In Jose Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten (Eds.), Algebra and Coalgebra in Computer Science, Vol. 3629, pp. 232–246, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Christoph Lüth, Markus Roggenbach, Lutz Schröder (2005). CCC - The CASL Consistency Checker. In José Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004), Vol. 3423, pp. 94–105, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript
Lutz Schröder, Till Mossakowski, Christoph Lüth (2005). Type class polymorphism in an institutional framework. In José Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004), Vol. 3423, pp. 234–248, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Lutz Schröder (2005). Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. In Vladimiro Sassone (Ed.), Foundations of Software Science And Computation Structures, Vol. 3441, pp. 440–454, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Dennis Walter, Lutz Schröder, Till Mossakowski (2005). Parametrized Exceptions. In Jose Fiadeiro, Jan Rutten (Eds.), Algebra and Coalgebra in Computer Science, Vol. 3629, pp. 424–438, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript

2004     Back to top

Lutz Schröder, Till Mossakowski (2004). Generic exception handling and the Java monad. In Charles Rattray, Savitri Maharaj, Carron Shankland (Eds.), Algebraic Methodology and Software Technology, Vol. 3116, pp. 443–459, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Lutz Schröder (2004). The logic of the partial λ-calculus with equality. In Jerzy Marcinkowski, Andrzej Tarlecki (Eds.), Computer Science Logic (CSL 04), Vol. 3210, pp. 385–399, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript

2003     Back to top

Till Mossakowski, Horst Reichel, Markus Roggenbach, Lutz Schröder (2003). Algebraic-co-algebraic specification in CoCASL. In Martin Wirsing, Dirk Pattinson, Rolf Hennicker (Eds.), Recent Developments in Algebraic Development Techniques, 16th International Workshop, WADT'02, Vol. 2755, pp. 376–392, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Till Mossakowski, Markus Roggenbach, Lutz Schröder (2003). CoCASL at work --- Modelling Process Algebra. In Hans-Peter Gumm (Ed.), Coalgebraic Methods in Computer Science, Vol. 82, Electronic Notes in Theoretical Computer Science. Elsevier Science.   detail   pdf   postscript
Lutz Schröder (2003). Classifying categories for partial equational logic. In Richard Blute (Ed.), Category Theory and Computer Science (CTCS 02), Vol. 69, Electronic Notes in Theoretical Computer Science. Elsevier Science.   detail   pdf   postscript
Lutz Schröder, Till Mossakowski (2003). Monad-independent Hoare logic in HasCASL. In Mauro Pezze (Ed.), Fundamental Approaches to Software Engineering (FASE 2003), Vol. 2621, pp. 261–277, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript
Lutz Schröder (2003). Henkin models of the partial λ-calculus. In Matthias Baaz, Johann Makowsky (Eds.), Computer Science Logic, Vol. 2803, pp. 498–512, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript

2002     Back to top

Lutz Schröder, Till Mossakowski (2002). HasCASL: towards integrated specification and development of functional programs. In Hélène Kirchner, Christophe Ringeissen (Eds.), Algebraic Methodology And Software Technology (AMAST 2002), Vol. 2422, pp. 99–116, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript

2001     Back to top

Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski (2001). Checking amalgamability conditions for CASL architectural specifications. In Jiri Sgall, Ales Pultr, Petr Kolman (Eds.), Mathematical Foundations of Computer Science, Vol. 2136, pp. 512–523, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript
Markus Roggenbach, Lutz Schröder (2001). Towards Trustworthy Specifications I: Consistency Checks. In Maura Cerioli, Gianna Reggio (Eds.), Recent Trends in Algebraic Specification Techniques, 15th International Workshop, WADT 2001, Vol. 2267, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript
Lutz Schröder (2001). Life without the Terminal Type. In Laurent Fribourg (Ed.), Computer Science Logic, Vol. 2142, pp. 429–442, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Lutz Schröder, Till Mossakowski, Piotr Hoffman, Bartek Klin, Andrzej Tarlecki (2001). Semantics of Architectural Specifications in CASL. In Heinrich Hußmann (Ed.), Fundamental Approaches to Software Engineering, Vol. 2029, pp. 253–268, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   pdf   postscript
Lutz Schröder, Till Mossakowski, Andrzej Tarlecki (2001). Amalgamation via enriched CASL signatures. In Fernando Orejas, Paul Spirakis, Jan van Leeuwen (Eds.), International Colloquium on Automata, Languages and Programming (ICALP 2001), Vol. 2076, pp. 993–1004, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript

2000     Back to top

Markus Roggenbach, Lutz Schröder, Till Mossakowski (2000). Specifying real numbers in CASL. In Christine Choppy, Didier Bert (Eds.), Recent Developments in Algebraic Development Techniques, 14th International Workshop, WADT'99, Vol. 1827, pp. 146–161, Lecture Notes in Computer Science. Springer, Berlin.   detail     www   postscript
      Show selected entries in BibTex Format
 

Technical reports, other publications 

Go to year:  2007   2004   2003   2001   1999 


2007     Back to top

Joseph Goguen, Till Mossakowski, Valeria De Paiva, Florian Rabe, Lutz Schröder (2007). An Institutional View on Categorical Logic. In Int J Software Informatics, 1 (1), pp. 129–152.   detail   pdf   postscript
Lutz Schröder (2007). Book review: L. M. G. Feijs and H. B. M. Jonkers, Formal Specification and Design, Cambridge University Press, 2005. The Computer Journal 50 (2007), pp. 129-130.   detail

2004     Back to top

Markus Roggenbach, Lutz Schröder, Till Mossakowski (2004). Libraries. In Peter Mosses (Ed.), CASL reference manual, Vol. 2960, Lecture Notes in Computer Science. Springer, Berlin. Early version appeared as CoFI note L-12, http://www.informatik.uni-bremen.de/cofi/old/Notes/L-12/index.html.   detail     www   pdf   postscript

2003     Back to top

L. Schröder, T. Mossakowski, C. Maeder (2003). HasCASL - Integrated functional specification and programming. Language summary..   detail   pdf   postscript

2001     Back to top

Lutz Schröder (2001). Categories: a free tour. In Austin Melton, Jürgen Koslowski (Eds.), Categorical Perspectives, pp. 1–27. Birkhäuser, Basel.   detail   postscript

1999     Back to top

Lutz Schröder (1999). Composition graphs and free extensions of categories. Universität Bremen. PhD Thesis.   detail
      Show selected entries in BibTex Format
 
   
Author: Dr. Lutz Schröder
 
  wg bkb 
Last updated: April 3, 2006   impressum