Publications: HasCASL

Go to year: 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2000 1998

2011 Back to top

Dominik Dietrich, Lutz SchrÃ¶der, Ewaryst Schulz (2011). Formalizing and Operationalizing Industrial Standards. In Dimitra Giannakopoulou, Fernando Orejas (Eds.), Fundamental Approaches to Software Engineering (FASE 2011), Vol. 6603, pp. 81–95, Lecture Notes in Computer Science. Springer.

2010 Back to top

	Glauber Cabral, Christian Maeder, Till Mossakowski, Lutz SchrÃ¶der (2010). Creating a HasCASL library. In Jonathan Aldrich, Ricardo Massa (Eds.), 14th Brazilian Symposium on Programming Languages (SBLP 2010).
	Till Mossakowski, Lutz SchrÃ¶der, Sergey Goncharov (2010). A Generic Complete Dynamic Logic for Reasoning about Purity and Effects. In Formal Aspects of Computing, 22 (3-4), pp. 363–384.

2009 Back to top

	Sergey Goncharov, Lutz SchrÃ¶der, Till Mossakowski (2009). Kleene Monads: Handling Iteration in a Framework of Generic Effects. In Alexander Kurz, Andrzej Tarlecki (Eds.), Algebra and Coalgebra in Computer Science (CALCO 2009), Vol. 5728, pp. 18–33, Lecture Notes in Computer Science. Springer.
	Lutz SchrÃ¶der, Till Mossakowski (2009). HasCASL: Integrated Higher-Order Specification and Program Development. In Theoretical Computer Science, 410 (12-13), pp. 1217–1260.

2008 Back to top

	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.
	Lutz SchrÃ¶der (2008). Bootstrapping Inductive and Coinductive Types in HasCASL. In Logical Methods in Computer Science, 4 (4:17), pp. 1–27.

2007 Back to top

	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.
	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.

2006 Back to top

	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.
	Till Mossakowski (2006). Monad-Based Logics for Computational Effects. In M. Johnson, V. Vene (Eds.), AMAST 2006, Vol. 4019, pp. 3–4, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz SchrÃ¶der (2006). The HasCASL Prologue - Categorical Syntax and Semantics of the Partial λ-calculus. In Theoret. Comput. Sci., Vol. 353, pp. 1–25.

2005 Back to top

	Kathrin Hoffmann, Hartmut Ehrig, Till Mossakowski (2005). High-Level Nets with Nets and Rules as Tokens. In 26th International Conference On Application and Theory of Petri Nets and Other Models of Concurrency, Vol. 3536, pp. 268–288, Lecture Notes in Computer Science. Springer Verlag, London.
	Kathrin Hoffmann, Francesco Parisi-Presicce, Till Mossakowski (2005). Higher-order nets for mobile policies. In Workshop on Petri Nets and Graph Transformations, 127 (2), pp. 87–105, Electronic Notes in Theoretical Computer Science. Elsevier Science.
	Till Mossakowski (2005). Heterogeneous specification and the heterogeneous tool set. Universitaet Bremen. Technical Report. Habilitation thesis.
	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.
	Dennis Walter (2005). Monadic Dynamic Logic: Application and Implementation. Master's Thesis (Diplomarbeit).
	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.

2004 Back to top

	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.
	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.
	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.

2003 Back to top

	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.
	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.
	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.

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.

2000 Back to top

T. Mossakowski, A. Haxthausen, B. Krieg-BrÃ¼ckner (2000). Subsorted Partial Higher-Order Logic as an Extension of CASL. In C. Choppy, D. Bert, P. Mosses (Eds.), Recent Trends in Algebraic Development Techniques, 14th International Workshop, WADT'99, Bonas, France, Vol. 1827, pp. 126–145, Lecture Notes in Computer Science. Springer Verlag, London.

1998 Back to top

	Anne Haxthausen, Bernd Krieg-BrÃ¼ckner, Till Mossakowski (1998). Extending CASL with higher-order functions -- design proposal. CoFI note L-8.
	Anne Haxthausen, Bernd Krieg-BrÃ¼ckner, Till Mossakowski. (1998). Subsorted partial higher-order logic as an extension of CASL. CoFI note L-10.
Show selected entries in BibTex Format

Author: Dr. Till Mossakowski

Group BKB

Last updated: February 1, 2006