Computer Science and
     Software Engineering

Computer Science and Software Engineering

Walter Guttmann

Publications

Journal articles

[8] W. Guttmann. Algebras for correctness of sequential computations. Science of Computer Programming, 2013. To appear. [ http ]
[7] W. Guttmann. Extended designs algebraically. Science of Computer Programming, 78(11):2064-2085, November 2013. [ http ]
[6] W. Guttmann. Algebras for iteration and infinite computations. Acta Informatica, 49(5):343-359, August 2012. [ http ]
[5] W. Guttmann. Typing theorems of omega algebra. Journal of Logic and Algebraic Programming, 81(6):643-659, August 2012. [ http ]
[4] W. Guttmann. Fixpoints for general correctness. Journal of Logic and Algebraic Programming, 80(6):248-265, August 2011. [ http ]
[3] W. Guttmann. Imperative abstractions for functional actions. Journal of Logic and Algebraic Programming, 79(8):768-793, November 2010. [ http ]
[2] W. Guttmann and B. Möller. Normal design algebra. Journal of Logic and Algebraic Programming, 79(2):144-173, February 2010. [ http ]
[1] W. Guttmann, H. Partsch, W. Schulte, and T. Vullinghs. Tool support for the interactive derivation of formally correct functional programs. Journal of Universal Computer Science, 9(2):173-188, March 2003. [ http ]

Conference papers

[16] W. Guttmann. Unifying lazy and strict computations. In W. Kahl and T. G. Griffin, editors, Relational and Algebraic Methods in Computer Science, volume 7560 of Lecture Notes in Computer Science, pages 17-32. Springer-Verlag, 2012. [ http ]
[15] W. Guttmann. Unifying correctness statements. In J. Gibbons and P. Nogueira, editors, Mathematics of Program Construction, volume 7342 of Lecture Notes in Computer Science, pages 198-219. Springer-Verlag, 2012. [ http ]
[14] W. Guttmann, G. Struth, and T. Weber. Automating algebraic methods in Isabelle. In S. Qin and Z. Qiu, editors, Formal Methods and Software Engineering, volume 6991 of Lecture Notes in Computer Science, pages 617-632. Springer-Verlag, 2011. [ http ]
[13] W. Guttmann, G. Struth, and T. Weber. A repository for Tarski-Kleene algebras. In P. Höfner, A. McIver, and G. Struth, editors, Automated Theory Engineering, volume 760 of CEUR Workshop Proceedings, pages 30-39, 2011. [ .pdf ]
[12] W. Guttmann. Towards a typed omega algebra. In H. de Swart, editor, Relational and Algebraic Methods in Computer Science, volume 6663 of Lecture Notes in Computer Science, pages 196-211. Springer-Verlag, 2011. [ http ]
[11] W. Guttmann. Unifying recursion in partial, total and general correctness. In S. Qin, editor, Unifying Theories of Programming, Third International Symposium, UTP 2010, volume 6445 of Lecture Notes in Computer Science, pages 207-225. Springer-Verlag, 2010. [ http ]
[10] W. Guttmann. Lazy UTP. In A. Butterfield, editor, Unifying Theories of Programming, Second International Symposium, UTP 2008, volume 5713 of Lecture Notes in Computer Science, pages 82-101. Springer-Verlag, 2010. [ http ]
[9] W. Guttmann. Partial, total and general correctness. In C. Bolduc, J. Desharnais, and B. Ktari, editors, Mathematics of Program Construction, volume 6120 of Lecture Notes in Computer Science, pages 157-177. Springer-Verlag, 2010. [ http ]
[8] J. Kohlmeyer and W. Guttmann. Unifying the semantics of UML 2 state, activity and interaction diagrams. In A. Pnueli, I. Virbitskaite, and A. Voronkov, editors, Perspectives of System Informatics: 7th International Andrei Ershov Memorial Conference, PSI 2009, volume 5947 of Lecture Notes in Computer Science, pages 206-217. Springer-Verlag, 2010. [ http ]
[7] W. Guttmann. General correctness algebra. In R. Berghammer, A. M. Jaoua, and B. Möller, editors, Relations and Kleene Algebra in Computer Science, volume 5827 of Lecture Notes in Computer Science, pages 150-165. Springer-Verlag, 2009. [ http ]
[6] W. Guttmann. Algebraic foundations of the Unifying Theories of Programming. In D. Wagner et al., editors, Ausgezeichnete Informatikdissertationen 2007, volume D-8 of Lecture Notes in Informatics, pages 141-150. Gesellschaft für Informatik, 2008.
[5] W. Guttmann. Lazy relations. In R. Berghammer, B. Möller, and G. Struth, editors, Relations and Kleene Algebra in Computer Science, volume 4988 of Lecture Notes in Computer Science, pages 138-154. Springer-Verlag, 2008. [ http ]
[4] S. Sarstedt and W. Guttmann. An ASM semantics of token flow in UML 2 activity diagrams. In I. Virbitskaite and A. Voronkov, editors, Perspectives of System Informatics: 6th International Andrei Ershov Memorial Conference, PSI 2006, volume 4378 of Lecture Notes in Computer Science, pages 349-362. Springer-Verlag, 2007. [ http ]
[3] W. Guttmann and M. Maucher. Variations on an ordering theme with constraints. In G. Navarro, L. Bertossi, and Y. Kohayakawa, editors, Fourth IFIP International Conference on Theoretical Computer Science: TCS 2006, volume 209 of IFIP International Federation for Information Processing, pages 77-90. Springer-Verlag, 2006. [ http ]
[2] W. Guttmann and B. Möller. Modal design algebra. In S. Dunne and W. Stoddart, editors, Unifying Theories of Programming, volume 4010 of Lecture Notes in Computer Science, pages 236-256. Springer-Verlag, 2006. [ http ]
[1] W. Guttmann. Non-termination in Unifying Theories of Programming. In W. MacCaull, M. Winter, and I. Düntsch, editors, Relational Methods in Computer Science 2005, volume 3929 of Lecture Notes in Computer Science, pages 108-120. Springer-Verlag, 2006. [ http ]

All publications

[38] W. Guttmann. Algebras for correctness of sequential computations. Science of Computer Programming, 2013. To appear. [ http ]
[37] W. Guttmann. Extended designs algebraically. Science of Computer Programming, 78(11):2064-2085, November 2013. [ http ]
[36] W. Guttmann. Unifying lazy and strict computations. In W. Kahl and T. G. Griffin, editors, Relational and Algebraic Methods in Computer Science, volume 7560 of Lecture Notes in Computer Science, pages 17-32. Springer-Verlag, 2012. [ http ]
[35] W. Guttmann. Algebras for iteration and infinite computations. Acta Informatica, 49(5):343-359, August 2012. [ http ]
[34] W. Guttmann. Typing theorems of omega algebra. Journal of Logic and Algebraic Programming, 81(6):643-659, August 2012. [ http ]
[33] W. Guttmann. Unifying correctness statements. In J. Gibbons and P. Nogueira, editors, Mathematics of Program Construction, volume 7342 of Lecture Notes in Computer Science, pages 198-219. Springer-Verlag, 2012. [ http ]
[32] W. Guttmann, G. Struth, and T. Weber. Automating algebraic methods in Isabelle. In S. Qin and Z. Qiu, editors, Formal Methods and Software Engineering, volume 6991 of Lecture Notes in Computer Science, pages 617-632. Springer-Verlag, 2011. [ http ]
[31] W. Guttmann. Fixpoints for general correctness. Journal of Logic and Algebraic Programming, 80(6):248-265, August 2011. [ http ]
[30] W. Guttmann, G. Struth, and T. Weber. A repository for Tarski-Kleene algebras. In P. Höfner, A. McIver, and G. Struth, editors, Automated Theory Engineering, volume 760 of CEUR Workshop Proceedings, pages 30-39, 2011. [ .pdf ]
[29] W. Guttmann. Towards a typed omega algebra. In H. de Swart, editor, Relational and Algebraic Methods in Computer Science, volume 6663 of Lecture Notes in Computer Science, pages 196-211. Springer-Verlag, 2011. [ http ]
[28] W. Guttmann. Unifying recursion in partial, total and general correctness. In S. Qin, editor, Unifying Theories of Programming, Third International Symposium, UTP 2010, volume 6445 of Lecture Notes in Computer Science, pages 207-225. Springer-Verlag, 2010. [ http ]
[27] W. Guttmann. Imperative abstractions for functional actions. Journal of Logic and Algebraic Programming, 79(8):768-793, November 2010. [ http ]
[26] W. Guttmann. Lazy UTP. In A. Butterfield, editor, Unifying Theories of Programming, Second International Symposium, UTP 2008, volume 5713 of Lecture Notes in Computer Science, pages 82-101. Springer-Verlag, 2010. [ http ]
[25] W. Guttmann. Partial, total and general correctness. In C. Bolduc, J. Desharnais, and B. Ktari, editors, Mathematics of Program Construction, volume 6120 of Lecture Notes in Computer Science, pages 157-177. Springer-Verlag, 2010. [ http ]
[24] W. Guttmann and B. Möller. Normal design algebra. Journal of Logic and Algebraic Programming, 79(2):144-173, February 2010. [ http ]
[23] J. Kohlmeyer and W. Guttmann. Unifying the semantics of UML 2 state, activity and interaction diagrams. In A. Pnueli, I. Virbitskaite, and A. Voronkov, editors, Perspectives of System Informatics: 7th International Andrei Ershov Memorial Conference, PSI 2009, volume 5947 of Lecture Notes in Computer Science, pages 206-217. Springer-Verlag, 2010. [ http ]
[22] W. Guttmann. General correctness algebra. In R. Berghammer, A. M. Jaoua, and B. Möller, editors, Relations and Kleene Algebra in Computer Science, volume 5827 of Lecture Notes in Computer Science, pages 150-165. Springer-Verlag, 2009. [ http ]
[21] J. Kohlmeyer and W. Guttmann. Unifying the semantics of UML 2 state, activity and interaction diagrams. In A. Pnueli, I. Virbitskaite, and A. Voronkov, editors, Perspectives of System Informatics: Proceedings of the Seventh International Andrei Ershov Memorial Conference, pages 159-166. A. P. Ershov Institute of Informatics Systems, Novosibirsk, June 2009.
[20] W. Guttmann. Lazy UTP. In A. Butterfield, editor, Second International Symposium on the Unifying Theories of Programming (UTP 08), pages 253-272. Trinity College Dublin, Ireland, September 2008.
[19] W. Guttmann. Algebraic foundations of the Unifying Theories of Programming. In D. Wagner et al., editors, Ausgezeichnete Informatikdissertationen 2007, volume D-8 of Lecture Notes in Informatics, pages 141-150. Gesellschaft für Informatik, 2008.
[18] W. Guttmann. Lazy relations. In R. Berghammer, B. Möller, and G. Struth, editors, Relations and Kleene Algebra in Computer Science, volume 4988 of Lecture Notes in Computer Science, pages 138-154. Springer-Verlag, 2008. [ http ]
[17] W. Guttmann. Algebraic Foundations of the Unifying Theories of Programming. Dissertation, Universität Ulm, December 2007. [ http ]
[16] S. Sarstedt and W. Guttmann. An ASM semantics of token flow in UML 2 activity diagrams. In I. Virbitskaite and A. Voronkov, editors, Perspectives of System Informatics: 6th International Andrei Ershov Memorial Conference, PSI 2006, volume 4378 of Lecture Notes in Computer Science, pages 349-362. Springer-Verlag, 2007. [ http ]
[15] W. Guttmann and B. Möller. Normal design algebra. Technical Report 2006-28, Institut für Informatik, Universität Augsburg, December 2006. [ http | .pdf ]
[14] W. Guttmann and M. Maucher. Variations on an ordering theme with constraints. In G. Navarro, L. Bertossi, and Y. Kohayakawa, editors, Fourth IFIP International Conference on Theoretical Computer Science: TCS 2006, volume 209 of IFIP International Federation for Information Processing, pages 77-90. Springer-Verlag, 2006. [ http ]
[13] S. Sarstedt and W. Guttmann. An ASM semantics of token flow in UML 2 activity diagrams. In I. Virbitskaite and A. Voronkov, editors, Perspectives of System Informatics: Proceedings of the Sixth International Andrei Ershov Memorial Conference, pages 207-213. A. P. Ershov Institute of Informatics Systems, Novosibirsk, June 2006.
[12] W. Guttmann and B. Möller. Modal design algebra. In S. Dunne and W. Stoddart, editors, Unifying Theories of Programming, volume 4010 of Lecture Notes in Computer Science, pages 236-256. Springer-Verlag, 2006. [ http ]
[11] W. Guttmann. Non-termination in Unifying Theories of Programming. In W. MacCaull, M. Winter, and I. Düntsch, editors, Relational Methods in Computer Science 2005, volume 3929 of Lecture Notes in Computer Science, pages 108-120. Springer-Verlag, 2006. [ http ]
[10] W. Guttmann and B. Möller. Modal design algebra. In S. Dunne and W. Stoddart, editors, First International Symposium on the Unifying Theories of Programming (UTP 06), pages 206-225. University of Teesside, United Kingdom, February 2006.
[9] W. Guttmann and M. Maucher. Constrained ordering. Technical Report UIB-2005-03, Universität Ulm, December 2005. [ .html | http | .dvi | .ps | .pdf ]
[8] W. Guttmann and B. Möller. Modal design algebra. Technical Report 2005-15, Institut für Informatik, Universität Augsburg, September 2005. [ http | .pdf ]
[7] W. Guttmann. Non-termination in Unifying Theories of Programming. In I. Düntsch and M. Winter, editors, 8th International Conference on Relational Methods in Computer Science (RelMiCS 8), pages 87-94. Computer Science Department, Brock University, St. Catharines, Ontario, Canada, February 2005.
[6] W. Guttmann, H. Partsch, W. Schulte, and T. Vullinghs. Tool support for the interactive derivation of formally correct functional programs. Journal of Universal Computer Science, 9(2):173-188, March 2003. [ http ]
[5] W. Guttmann. Deriving an applicative Heapsort algorithm. Technical Report UIB-2002-02, Universität Ulm, December 2002. [ .html | http | http | .ps | .pdf ]
[4] W. Guttmann, H. Partsch, W. Schulte, and T. Vullinghs. Tool support for the interactive derivation of formally correct functional programs (extended abstract). In D. Haneberg, G. Schellhorn, and W. Reif, editors, FM-TOOLS 2002: The Fifth Workshop on Tools for System Design and Verification, pages 15-20. Institut für Informatik, Universität Augsburg, June 2002. Report 2002-11. [ .dvi | .ps | .pdf ]
[3] W. Guttmann. Transformationelle entwicklung des kerns eines übersetzers für eine logische programmiersprache. Diplomarbeit, Universität Ulm, October 2001.
[2] W. Guttmann. An Introduction to Ultra. Universität Ulm, December 2000. [ http | .ps.gz ]
[1] W. Guttmann. Organisation einer Programmier-Meisterschaft. Universität Ulm, August 2000.