Walter Guttmann

Orcid: 0000-0003-2969-1688

Affiliations:
  • University of Canterbury, Christchurch, New Zealand
  • University of Ulm, Germany


According to our database1, Walter Guttmann authored at least 62 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An example of goal-directed proof.
CoRR, 2023

Cardinality and Representation of Stone Relation Algebras.
CoRR, 2023

Modal Algebra of Multirelations.
CoRR, 2023

Determinism of Multirelations.
CoRR, 2023

On the Inner Structure of Multirelations.
CoRR, 2023

Relation-Algebraic Verification of Disjoint-Set Forests.
CoRR, 2023

Inner Structure, Determinism and Modal Algebra of Multirelations.
Arch. Formal Proofs, 2023

Cardinality and Representation of Stone Relation Algebras.
Arch. Formal Proofs, 2023

Dependences Between Domain Constructions in Heterogeneous Relation Algebras.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2023

2021
Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations.
Arch. Formal Proofs, 2021

Relational Forests.
Arch. Formal Proofs, 2021

Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

Second-Order Properties of Undirected Graphs.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020
Relational characterisations of paths.
J. Log. Algebraic Methods Program., 2020

Relational Minimum Spanning Tree Algorithms.
Arch. Formal Proofs, 2020

A Hierarchy of Algebras for Boolean Subsets.
Arch. Formal Proofs, 2020

Relational Characterisations of Paths.
Arch. Formal Proofs, 2020

Relational Disjoint-Set Forests.
Arch. Formal Proofs, 2020

Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2020

2019
Connecting Fixpoints of Computations with Strict Progress.
Proceedings of the Unifying Theories of Programming - 7th International Symposium, 2019

2018
An algebraic framework for minimum spanning tree problems.
Theor. Comput. Sci., 2018

Verifying minimum spanning tree algorithms with Stone relation algebras.
J. Log. Algebraic Methods Program., 2018

Aggregation Algebras.
Arch. Formal Proofs, 2018

2017
A framework for automating security analysis of the internet of things.
J. Netw. Comput. Appl., 2017

An algebraic approach to multirelations and their properties.
J. Log. Algebraic Methods Program., 2017

Stone-Kleene Relation Algebras.
Arch. Formal Proofs, 2017

Stone Relation Algebras.
Arch. Formal Proofs, 2017

2016
An algebraic approach to computations with progress.
J. Log. Algebraic Methods Program., 2016

Stone Algebras.
Arch. Formal Proofs, 2016

Kleene Algebras with Domain.
Arch. Formal Proofs, 2016

Relation-Algebraic Verification of Prim's Minimum Spanning Tree Algorithm.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2016, 2016

2015
Infinite executions of lazy and strict computations.
J. Log. Algebraic Methods Program., 2015

A Relation-Algebraic Approach to Multirelations and Predicate Transformers.
Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

Closure, Properties and Closure Properties of Multirelations.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2015

2014
Algebras for correctness of sequential computations.
Sci. Comput. Program., 2014

Multirelations with infinite computations.
J. Log. Algebraic Methods Program., 2014

Extended Conscriptions Algebraically.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013
Extended designs algebraically.
Sci. Comput. Program., 2013

2012
Typing theorems of omega algebra.
J. Log. Algebraic Methods Program., 2012

Algebras for iteration and infinite computations.
Acta Informatica, 2012

Unifying Correctness Statements.
Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012

Unifying Lazy and Strict Computations.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

2011
Fixpoints for general correctness.
J. Log. Algebraic Methods Program., 2011

Automating Algebraic Methods in Isabelle.
Proceedings of the Formal Methods and Software Engineering, 2011

A Repository for Tarski-Kleene Algebras.
Proceedings of the First Workshop on Automated Theory Engineering, 2011

Towards a Typed Omega Algebra.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

2010
Normal design algebra.
J. Log. Algebraic Methods Program., 2010

Imperative abstractions for functional actions.
J. Log. Algebraic Methods Program., 2010

Unifying Recursion in Partial, Total and General Correctness.
Proceedings of the Unifying Theories of Programming - Third International Symposium, 2010

Partial, Total and General Correctness.
Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

2009
Unifying the Semantics of UML 2 State, Activity and Interaction Diagrams.
Proceedings of the Perspectives of Systems Informatics, 2009

General Correctness Algebra.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2009

2008
Lazy UTP.
Proceedings of the Unifying Theories of Programming, Second International Symposium, 2008

Lazy Relations.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

2007
Algebraic Foundations of the Unifying Theories of Programming.
Proceedings of the Ausgezeichnete Informatikdissertationen 2007, 2007

Algebraic foundations of the unifying theories of programming.
PhD thesis, 2007

2006
Modal Design Algebra.
Proceedings of the Unifying Theories of Programming, First International Symposium, 2006

Variations on an Ordering Theme with Constraints.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

An ASM Semantics of Token Flow in UML 2 Activity Diagrams.
Proceedings of the Perspectives of Systems Informatics, 2006

2005
Non-termination in Unifying Theories of Programming.
Proceedings of the Relational Methods in Computer Science, 2005

2003
Tool Support for the Interactive Derivation of Formally Correct Functional Programs.
J. Univers. Comput. Sci., 2003


  Loading...