Research/Scholarly/Creative Works

Edited Volumes

• Desharnais J; Guttmann WN; Joosten S (Ed.) (2018) Relational and Algebraic Methods in Computer Science: RAMiCS 2018. 11194Springer. 385. http://dx.doi.org/10.1007/978-3-030-02149-8.

Journal Articles

• Berghammer R., Furusawa H., Guttmann W. and Höfner P. (2020) Relational Characterisations of Paths. Journal of Logical and Algebraic Methods in Programming 117 100590 http://dx.doi.org/10.1016/j.jlamp.2020.100590.

• Guttmann W. (2018) An algebraic framework for minimum spanning tree problems. Theoretical Computer Science 744: 37-55. http://dx.doi.org/10.1016/j.tcs.2018.04.012.

• Guttmann W. (2018) Verifying minimum spanning tree algorithms with Stone relation algebras. Journal of Logical and Algebraic Methods in Programming 101: 132-150. http://dx.doi.org/10.1016/j.jlamp.2018.09.005.

• Berghammer R. and Guttmann W. (2017) An algebraic approach to multirelations and their properties. Journal of Logical and Algebraic Methods in Programming 88: 45-63. http://dx.doi.org/10.1016/j.jlamp.2017.02.002.

• Ge M., Hong JB., Guttmann W. and Kim DS. (2017) A framework for automating security analysis of the internet of things. Journal of Network and Computer Applications 83: 12-27. http://dx.doi.org/10.1016/j.jnca.2017.01.033.

• Guttmann W. (2016) An algebraic approach to computations with progress. Journal of Logical and Algebraic Methods in Programming 85(4): 520-539. http://dx.doi.org/10.1016/j.jlamp.2015.11.009.

• Guttmann W. (2015) Infinite executions of lazy and strict computations. Journal of Logical and Algebraic Methods in Programming 84(3): 326-340. http://dx.doi.org/10.1016/j.jlamp.2014.08.001.

• Guttmann W. (2014) Algebras for correctness of sequential computations. Science of Computer Programming 85(Part B): 224-240. http://dx.doi.org/10.1016/j.scico.2013.08.008.

• Guttmann W. (2014) Multirelations with infinite computations. Journal of Logical and Algebraic Methods in Programming 83(2): 194-211. http://dx.doi.org/10.1016/j.jlap.2014.02.008.

• Guttmann W. (2013) Extended Designs Algebraically. Science of Computer Programming 78(11): 2064-2085. http://dx.doi.org/10.1016/j.scico.2012.07.009.

• Guttmann W. (2012) Algebras for iteration and infinite computations. Acta Informatica 49(5): 343-359. http://dx.doi.org/10.1007/s00236-012-0162-2.

• Guttmann W. (2012) Typing theorems of omega algebra. Journal of Logic and Algebraic Programming 81(6): 643-659. http://dx.doi.org/10.1016/j.jlap.2012.05.002.

• Guttmann W. (2011) Fixpoints for general correctness. Journal of Logic and Algebraic Programming 80(6): 248-265. http://dx.doi.org/10.1016/j.jlap.2011.04.004.

• Guttmann W. (2010) Imperative abstractions for functional actions. Journal of Logic and Algebraic Programming 79(8): 768-793. http://dx.doi.org/10.1016/j.jlap.2010.07.015.

• Guttmann W. and Möller B. (2010) Normal design algebra. Journal of Logic and Algebraic Programming 79(2): 144-173. http://dx.doi.org/10.1016/j.jlap.2009.07.002.

• Guttmann W., Partsch H., Schulte W. and Vullinghs T. (2003) Tool support for the interactive derivation of formally correct functional programs. Journal of Universal Computer Science 9(2): 173-188. http://dx.doi.org/10.3217/jucs-009-02-0173.

Conference Contributions - Published

• Guttmann W. (2021) Second-Order Properties of Undirected Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13027 LNCS: 209-224. http://dx.doi.org/10.1007/978-3-030-88701-8_13.

• Guttmann W. and Robinson-O’Brien N. (2021) Relation-Algebraic Verification of Borůvka’s Minimum Spanning Tree Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13027 LNCS: 225-240. http://dx.doi.org/10.1007/978-3-030-88701-8_14.

• Guttmann W. (2020) Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12167 LNAI: 236-253. http://dx.doi.org/10.1007/978-3-030-51054-1_14.

• Guttmann W. (2020) Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12062 LNCS: 134-151. http://dx.doi.org/10.1007/978-3-030-43520-2_9.

• Guttmann W. and Möller B. (2020) A Hierarchy of Algebras for Boolean Subsets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12062 LNCS: 152-168. http://dx.doi.org/10.1007/978-3-030-43520-2_10.

• Guttmann W. (2019) Connecting Fixpoints of Computations with Strict Progress. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11885 LNCS: 62-79. http://dx.doi.org/10.1007/978-3-030-31038-7_4.

• Guttmann WN. (2017) Stone Relation Algebras. In Höfner P; Pous D; Struth G (Eds). Relational and Algebraic Methods in Computer Science 10226: 127-143. Cham: Springer. http://dx.doi.org/10.1007/978-3-319-57418-9_8.

• Guttmann W. (2016) Relation-algebraic verification of Prim's minimum spanning tree algorithm. In LNCS 9965: 51-68. http://dx.doi.org/10.1007/978-3-319-46750-4_4.

• Berghammer R. and Guttmann W. (2015) A relation-algebraic approach to multirelations and predicate transformers. In Lecture Notes in Computer Science, Vol 9129: MPC 2015: 50-70. http://dx.doi.org/10.1007/978-3-319-19797-5_3.

• Berghammer R. and Guttmann W. (2015) Closure, Properties and Closure Properties of Multirelations. In Lecture Notes in Computer Science (LNCS), Vol 9348: RAMiCS 2015: 67-83. http://dx.doi.org/10.1007/978-3-319-24704-5_5.

• Guttmann W. (2014) Extended Conscriptions Algebraically. In Lecture Notes in Computer Science (LNCS) 8428: 139-156. http://dx.doi.org/10.1007/978-3-319-06251-8_9.

• Guttmann W. (2012) Unifying Correctness Statements. In Lecture Notes in Computer Science (LNCS) 7342: 198-219. http://dx.doi.org/10.1007/978-3-642-31113-0_11.

• Guttmann W. (2012) Unifying lazy and strict computations. In Lecture Notes in Computer Science (LNCS) 7560:: 17-32. http://dx.doi.org/10.1007/978-3-642-33314-9_2.

• Guttmann W. (2011) Towards a typed omega algebra. In Lecture Notes in Computer Science 6663: 196-211. http://dx.doi.org/10.1007/978-3-642-21070-9_16.

• Guttmann W., Struth G. and Weber T. (2011) A repository for Tarski-Kleene algebras. In CEUR Workshop Proceedings 760: 30-39.

• Guttmann W., Struth G. and Weber T. (2011) Automating algebraic methods in Isabelle. In Lecture Notes in Computer Science 6991: 617-632. http://dx.doi.org/10.1007/978-3-642-24559-6_41.

• Guttmann W. (2010) Lazy UTP. In Lecture Notes in Computer Science 5713: 82-101. http://dx.doi.org/10.1007/978-3-642-14521-6_6.

• Guttmann W. (2010) Partial, total and general correctness. In Lecture Notes in Computer Science 6120: 157-177. http://dx.doi.org/10.1007/978-3-642-13321-3_11.

• Guttmann W. (2010) Unifying recursion in partial, total and general correctness. In Lecture Notes in Computer Science 6445: 207-225. http://dx.doi.org/10.1007/978-3-642-16690-7_10.

• Kohlmeyer J. and Guttmann W. (2010) Unifying the semantics of UML 2 state, activity and interaction diagrams. In Lecture Notes in Computer Science 5947: 206-217. http://dx.doi.org/10.1007/978-3-642-11486-1_18.

• Guttmann W. (2009) General correctness algebra. In Lecture Notes in Computer Science 5827: 150-165. http://dx.doi.org/10.1007/978-3-642-04639-1_11.

• Guttmann W. (2008) Algebraic foundations of the Unifying Theories of Programming. In Lecture Notes in Informatics D-8: 141-150.

• Guttmann W. (2008) Lazy relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4988 LNCS: 138-154. http://dx.doi.org/10.1007/978-3-540-78913-0_12.

• Guttmann W. (2008) Lazy Relations. In Lecture Notes in Computer Science 4988: 138-154. http://dx.doi.org/10.1007/978-3-540-78913-0_12.

• Sarstedt S. and Guttmann W. (2007) An ASM semantics of token flow in UML 2 activity diagrams. In Lecture Notes in Computer Science 4378: 349-362. http://dx.doi.org/10.1007/978-3-540-70881-0_30.

• Guttmann W. (2006) Non-termination in unifying theories of programming. In Lecture Notes in Computer Science (LNCS) 3929: 108-120. http://dx.doi.org/10.1007/11734673_9.

• Guttmann W. and Maucher M. (2006) Variations on an ordering theme with constraints. In International Federation for Information Processing 209: 77-90. http://dx.doi.org/10.1007/978-0-387-34735-6_10.

• Guttmann W. and Möller B. (2006) Modal design algebra. In Lecture Notes in Computer Science (LNCS) 4010: 236-256. http://dx.doi.org/10.1007/11768173_14.

Other

• Guttmann W. (2021) Algebras for iteration, infinite executions and correctness of sequential computations. Archive of Formal Proofs [Formal proof development].

• Guttmann W. (2021) Relational forests. Archive of Formal Proofs [Formal proof development].

• Guttmann W. (2020) Relational disjoint set forests. Archive of Formal Proofs [Formal proof development].

• Guttmann W. and Höfner P. (2020) Relational characterisations of paths. Archive of Formal Proofs [Formal proof development].

• Guttmann W. and Möller B. (2020) A hierarchy of algebras for Boolean subsets. Archive of Formal Proofs [Formal proof development].

• Guttmann W. and Robinson-O'Brien N. (2020) Relational minimum spanning tree algorithms. Archive of Formal Proofs [Formal proof development].

• Guttmann WN. (2018) Aggregation algebras. Archive of Formal Proofs [Formal proof development].

• Guttmann WN. (2017) Stone Relation Algebras. Archive of Formal Proofs [Formal proof development].

• Guttmann WN. (2017) Stone-Kleene Relation Algebras. Archive of Formal Proofs [Formal proof development].

• Gomes VBF., Guttmann WN., Höfner P., Struth G. and Weber T. (2016) Kleene algebras with domain. Archive of Formal Proofs [Formal proof development].

• Guttmann WN. (2016) Stone Algebras. Archive of Formal Proofs [Formal proof development].

• Guttmann WN. (2015) Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations. Ulm, Germany: Universität Ulm. [Habilitation thesis (post-doctoral thesis)].

Theses / Dissertations

• Guttmann WN. (2015) Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations. Ulm, Germany. Universität Ulm.

• Guttmann W. (2007) Algebraic Foundations of the Unifying Theories of Programming. Ulm, Germany. Universität Ulm.

• Guttmann W. (2001) Transformationelle Entwicklung des Kerns eines Übersetzers für eine logische Programmiersprache. Ulm, Germany. Universität Ulm.

Student Supervision

Displaying all items.

Completed
• PhD - Sharma D: Software-Defined Networking-based Moving Target Defenses (2020)
• PhD - Welsh S: Exploratory Moral Code: Formalizing Normative Decisions Using Non-Modal Deontic Logic and Tiered Utility (2019)
• PhD - Yusuf S: Dynamic Cyber Security Modelling and Analysis (2018)
• Masters - Robinson-O'Brien N: A formal correctness proof of Boruvka’s minimum spanning tree algorithm (2020)
• Masters - Wimalasooriya C: Improving effort estimation for software maintenance in agile software development environments (2019)
• Honours - Avery J: A Similarity Ranking of Python Programs (2015)
• Honours - Glasson L: Lazy Execution in Imperative Programming Languages (2017)

Review and Refereeing

Displaying all items.

• Acta Informatica ( 2011 - 2023)
• Journal of Logic and Algebraic Programming ( 2008 - 2014)
• Journal of Logic and Computation ( 2013 - 2023)
• Journal of Logical and Algebraic Methods in Programming ( 2014 - 2023)
• Journal of Mathematical Analysis and Applications ( 2012 - 2023)
• Relational and Algebraic Methods in Computer Science ( 2014 - 2023)
• Science of Computer Programming ( 2003 - 2023)
• Unifying Theories of Programming ( 2014 - 2023)

Research Groups