Walter Guttmann - Academic Staff - People - Computer Science and Software Engineering - University of Canterbury - New Zealand
Walter Guttmann

Walter Guttmann

Position

Associate Professor

Qualifications

Dipl.-Inf., Dr. rer. nat., PD

Contact details

Room: Erskine 300
Email: walter.guttmann@canterbury.ac.nz
Phone: +64 3 36 92451
Fax: +64 3 364 2569

Postal address

Computer Science and Software Engineering
University of Canterbury
Private Bag 4800
Christchurch 8140
New Zealand

Courses

  • COSC121 (2018-2, 2017-2, 2016-2, 2015-1, 2013-2, 2012-2)
  • COSC261 (2024-1, 2023-1, 2022-1, 2021-1, 2020-1, 2019-1, 2018-1, 2017-1, 2016-1, 2015-1, 2014-1, 2013-1)
  • COSC262 (2024-1, 2023-1, 2022-1, 2019-1, 2017-1)
  • COSC366 (2014)
  • COSC367 (2018-2, 2017-1)
  • COSC432 (2024-2, 2022-2, 2021-2, 2020-2, 2018-2, 2017-2, 2016-2, 2014-2, 2013-2 as COSC473)
  • COSC460 (2016, 2015, 2014, 2013)
  • COSC461 (2017)
  • COSC469 (2021-1)
  • MATH230 (2021-2, 2020-2)
  • SENG365 (2014-2, 2013-2, 2012-2)
  • SENG402 (2022, 2021, 2020, 2018)

Course coordination

  • COSC261 (2024-1, 2023-1, 2022-1, 2021-1, 2020-1, 2019-1, 2018-1, 2017-1, 2016-1, 2015-1, 2014-1, 2013-1)
  • COSC432 (2024-2, 2022-2, 2021-2, 2020-2, 2018-2, 2017-2, 2016-2, 2014-2, 2013-2 as COSC473)
  • COSC460 (2014, 2013)
  • COSC461 (2018)
  • COSC470 (2024, 2022, 2021, 2020)

Research interests

Programme committee memberships

Recent publications

  • ... all publications
  • Cardinality and Representation of Stone Relation Algebras, AFP, 2023
  • Inner structure, determinism and modal algebra of multirelations (with G. Struth), AFP, 2023
  • Dependences between Domain Constructions in Heterogeneous Relation Algebras, RAMiCS 2023
  • Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (with N. Robinson-O'Brien), LNCS 13027:225-240, RAMiCS 2021
  • Second-order properties of undirected graphs, LNCS 13027:209-224, RAMiCS 2021
  • Algebras for iteration, infinite executions and correctness of sequential computations, AFP, 2021
  • Relational Forests, AFP, 2021
  • Relational Minimum Spanning Tree Algorithms (with N. Robinson-O'Brien), AFP, 2020
  • Relational Characterisations of Paths (with R. Berghammer, H. Furusawa, P. Höfner), JLAMP 117:100590, 2020
  • Relational Disjoint-Set Forests, AFP, 2020
  • Relational Characterisations of Paths (with P. Höfner), AFP, 2020
  • Reasoning about Algebraic Structures with Implicit Carriers in Isabelle/HOL, LNCS 12167:251-268, IJCAR 2020
  • A Hierarchy of Algebras for Boolean Subsets (with B. Möller), LNCS 12062:152-168, RAMiCS 2020
  • Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras, LNCS 12062:134-151, RAMiCS 2020
  • A Hierarchy of Algebras for Boolean Subsets (with B. Möller), AFP, 2020
  • Connecting Fixpoints of Computations with Strict Progress, LNCS 11185:62-79, UTP 2019
  • Verifying Minimum Spanning Tree Algorithms with Stone Relation Algebras, JLAMP 101:132-150, 2018
  • Relational and Algebraic Methods in Computer Science, LNCS 11194, RAMiCS 2018
  • An Algebraic Framework for Minimum Spanning Tree Problems, TCS 744:37-55, 2018
  • Aggregation Algebras, AFP, 2018
  • Stone-Kleene Relation Algebras, AFP, 2017
  • Stone Relation Algebras, LNCS 10226:127-143, RAMiCS 2017
  • An Algebraic Approach to Multirelations and their Properties (with R. Berghammer), JLAMP 88:45-63, 2017
  • A Framework for Automating Security Analysis of the Internet of Things (with M. Ge, J. B. Hong, D. S. Kim), JNCA 83:12-27, 2017
  • Stone Relation Algebras, AFP, 2017
  • Relation-algebraic verification of Prim's minimum spanning tree algorithm, LNCS 9965:51-68, ICTAC 2016
  • Stone Algebras, AFP, 2016
  • An Algebraic Approach to Computations with Progress, JLAMP 85(4):520-539, 2016
  • Kleene Algebras with Domain (with V. B. F. Gomes, P. Höfner, G. Struth, T. Weber), AFP, 2016
  • Closure, Properties and Closure Properties of Multirelations (with R. Berghammer), LNCS 9348:67-83, RAMiCS 2015
  • A Relation-Algebraic Approach to Multirelations and Predicate Transformers (with R. Berghammer), LNCS 9129:50-70, MPC 2015
  • Infinite executions of lazy and strict computations, JLAMP 84(3):326-340, 2015
  • Algebras for Correctness of Sequential Computations, SCP 85(B):224-240, 2014
  • Extended Conscriptions Algebraically, LNCS 8428:139-156, RAMiCS 2014
  • Multirelations with Infinite Computations, JLAMP 83(2):194-211, 2014

Programming contests

  • Phone: +64 3 369 2777
    Fax: +64 3 364 2569
    CSSEadministration@canterbury.ac.nz
  • Computer Science and Software Engineering
    University of Canterbury
    Private Bag 4800, Christchurch
    New Zealand
  • Follow us
    FacebookYoutubetwitterLinked In