default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Guttmann
Person information
- affiliation: University of Canterbury, Christchurch, New Zealand
- affiliation: University of Ulm, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Walter Guttmann:
Relation-Algebraic Verification of Disjoint-Set Forests. Fundam. Informaticae 192(1): 77-120 (2024)- [j31]Roland Carl Backhouse, Walter Guttmann, Michael Winter:
An example of goal-directed, calculational proof. J. Funct. Program. 34 (2024) - [j30]Hitoshi Furusawa, Walter Guttmann
, Georg Struth:
Determinism of multirelations. J. Log. Algebraic Methods Program. 139: 100976 (2024) - 2023
- [j29]Walter Guttmann:
Cardinality and Representation of Stone Relation Algebras. Arch. Formal Proofs 2023 (2023) - [j28]Walter Guttmann, Georg Struth:
Inner Structure, Determinism and Modal Algebra of Multirelations. Arch. Formal Proofs 2023 (2023) - [c27]Walter Guttmann:
Dependences Between Domain Constructions in Heterogeneous Relation Algebras. RAMiCS 2023: 105-121 - [i7]Walter Guttmann:
Relation-Algebraic Verification of Disjoint-Set Forests. CoRR abs/2301.10311 (2023) - [i6]Hitoshi Furusawa, Walter Guttmann, Georg Struth:
On the Inner Structure of Multirelations. CoRR abs/2305.11342 (2023) - [i5]Hitoshi Furusawa, Walter Guttmann, Georg Struth:
Determinism of Multirelations. CoRR abs/2305.11344 (2023) - [i4]Hitoshi Furusawa, Walter Guttmann, Georg Struth:
Modal Algebra of Multirelations. CoRR abs/2305.11346 (2023) - [i3]Hitoshi Furusawa, Walter Guttmann:
Cardinality and Representation of Stone Relation Algebras. CoRR abs/2309.11676 (2023) - [i2]Roland Carl Backhouse, Walter Guttmann, Michael Winter:
An example of goal-directed proof. CoRR abs/2310.08946 (2023) - 2021
- [j27]Walter Guttmann:
Relational Forests. Arch. Formal Proofs 2021 (2021) - [j26]Walter Guttmann:
Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations. Arch. Formal Proofs 2021 (2021) - [c26]Walter Guttmann:
Second-Order Properties of Undirected Graphs. RAMiCS 2021: 209-224 - [c25]Walter Guttmann, Nicolas Robinson-O'Brien:
Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm. RAMiCS 2021: 225-240 - 2020
- [j25]Walter Guttmann:
Relational Disjoint-Set Forests. Arch. Formal Proofs 2020 (2020) - [j24]Walter Guttmann, Peter Höfner:
Relational Characterisations of Paths. Arch. Formal Proofs 2020 (2020) - [j23]Walter Guttmann, Bernhard Möller:
A Hierarchy of Algebras for Boolean Subsets. Arch. Formal Proofs 2020 (2020) - [j22]Walter Guttmann, Nicolas Robinson-O'Brien:
Relational Minimum Spanning Tree Algorithms. Arch. Formal Proofs 2020 (2020) - [j21]Rudolf Berghammer, Hitoshi Furusawa, Walter Guttmann, Peter Höfner:
Relational characterisations of paths. J. Log. Algebraic Methods Program. 117: 100590 (2020) - [c24]Walter Guttmann:
Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras. RAMiCS 2020: 134-151 - [c23]Walter Guttmann, Bernhard Möller:
A Hierarchy of Algebras for Boolean Subsets. RAMiCS 2020: 152-168 - [c22]Walter Guttmann:
Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL. IJCAR (2) 2020: 236-253
2010 – 2019
- 2019
- [c21]Walter Guttmann:
Connecting Fixpoints of Computations with Strict Progress. UTP 2019: 62-79 - 2018
- [j20]Walter Guttmann:
Aggregation Algebras. Arch. Formal Proofs 2018 (2018) - [j19]Walter Guttmann:
Verifying minimum spanning tree algorithms with Stone relation algebras. J. Log. Algebraic Methods Program. 101: 132-150 (2018) - [j18]Walter Guttmann:
An algebraic framework for minimum spanning tree problems. Theor. Comput. Sci. 744: 37-55 (2018) - [e1]Jules Desharnais, Walter Guttmann, Stef Joosten:
Relational and Algebraic Methods in Computer Science - 17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29 - November 1, 2018, Proceedings. Lecture Notes in Computer Science 11194, Springer 2018, ISBN 978-3-030-02148-1 [contents] - [i1]Rudolf Berghammer, Hitoshi Furusawa, Walter Guttmann, Peter Höfner:
Relational Characterisations of Paths. CoRR abs/1801.04026 (2018) - 2017
- [j17]Walter Guttmann:
Stone Relation Algebras. Arch. Formal Proofs 2017 (2017) - [j16]Walter Guttmann:
Stone-Kleene Relation Algebras. Arch. Formal Proofs 2017 (2017) - [j15]Rudolf Berghammer, Walter Guttmann:
An algebraic approach to multirelations and their properties. J. Log. Algebraic Methods Program. 88: 45-63 (2017) - [j14]Mengmeng Ge, Jin B. Hong, Walter Guttmann, Dong Seong Kim:
A framework for automating security analysis of the internet of things. J. Netw. Comput. Appl. 83: 12-27 (2017) - [c20]Walter Guttmann:
Stone Relation Algebras. RAMiCS 2017: 127-143 - 2016
- [j13]Victor B. F. Gomes, Walter Guttmann, Peter Höfner, Georg Struth, Tjark Weber:
Kleene Algebras with Domain. Arch. Formal Proofs 2016 (2016) - [j12]Walter Guttmann:
Stone Algebras. Arch. Formal Proofs 2016 (2016) - [j11]Walter Guttmann:
An algebraic approach to computations with progress. J. Log. Algebraic Methods Program. 85(4): 520-539 (2016) - [c19]Walter Guttmann:
Relation-Algebraic Verification of Prim's Minimum Spanning Tree Algorithm. ICTAC 2016: 51-68 - 2015
- [j10]Walter Guttmann:
Infinite executions of lazy and strict computations. J. Log. Algebraic Methods Program. 84(3): 326-340 (2015) - [c18]Rudolf Berghammer, Walter Guttmann:
Closure, Properties and Closure Properties of Multirelations. RAMiCS 2015: 67-83 - [c17]Rudolf Berghammer, Walter Guttmann:
A Relation-Algebraic Approach to Multirelations and Predicate Transformers. MPC 2015: 50-70 - 2014
- [j9]Walter Guttmann:
Multirelations with infinite computations. J. Log. Algebraic Methods Program. 83(2): 194-211 (2014) - [j8]Walter Guttmann:
Algebras for correctness of sequential computations. Sci. Comput. Program. 85: 224-240 (2014) - [c16]Walter Guttmann:
Extended Conscriptions Algebraically. RAMiCS 2014: 139-156 - 2013
- [j7]Walter Guttmann:
Extended designs algebraically. Sci. Comput. Program. 78(11): 2064-2085 (2013) - 2012
- [j6]Walter Guttmann:
Algebras for iteration and infinite computations. Acta Informatica 49(5): 343-359 (2012) - [j5]Walter Guttmann:
Typing theorems of omega algebra. J. Log. Algebraic Methods Program. 81(6): 643-659 (2012) - [c15]Walter Guttmann:
Unifying Lazy and Strict Computations. RAMiCS 2012: 17-32 - [c14]Walter Guttmann:
Unifying Correctness Statements. MPC 2012: 198-219 - 2011
- [j4]Walter Guttmann:
Fixpoints for general correctness. J. Log. Algebraic Methods Program. 80(6): 248-265 (2011) - [c13]Walter Guttmann:
Towards a Typed Omega Algebra. RAMiCS 2011: 196-211 - [c12]Walter Guttmann, Georg Struth, Tjark Weber:
A Repository for Tarski-Kleene Algebras. ATE 2011: 30-39 - [c11]Walter Guttmann, Georg Struth, Tjark Weber:
Automating Algebraic Methods in Isabelle. ICFEM 2011: 617-632 - 2010
- [j3]Walter Guttmann, Bernhard Möller:
Normal design algebra. J. Log. Algebraic Methods Program. 79(2): 144-173 (2010) - [j2]Walter Guttmann:
Imperative abstractions for functional actions. J. Log. Algebraic Methods Program. 79(8): 768-793 (2010) - [c10]Walter Guttmann:
Partial, Total and General Correctness. MPC 2010: 157-177 - [c9]Walter Guttmann:
Unifying Recursion in Partial, Total and General Correctness. UTP 2010: 207-225
2000 – 2009
- 2009
- [c8]Walter Guttmann:
General Correctness Algebra. RelMiCS 2009: 150-165 - [c7]Jens Kohlmeyer, Walter Guttmann:
Unifying the Semantics of UML 2 State, Activity and Interaction Diagrams. Ershov Memorial Conference 2009: 206-217 - 2008
- [c6]Walter Guttmann:
Lazy Relations. RelMiCS 2008: 138-154 - [c5]Walter Guttmann:
Lazy UTP. UTP 2008: 82-101 - 2007
- [b1]Walter Guttmann:
Algebraic foundations of the unifying theories of programming. University of Ulm, Germany, 2007, pp. 1-95 - [p1]Walter Guttmann:
Algebraic Foundations of the Unifying Theories of Programming. Ausgezeichnete Informatikdissertationen 2007: 141-150 - 2006
- [c4]Stefan Sarstedt, Walter Guttmann:
An ASM Semantics of Token Flow in UML 2 Activity Diagrams. Ershov Memorial Conference 2006: 349-362 - [c3]Walter Guttmann, Markus Maucher:
Variations on an Ordering Theme with Constraints. IFIP TCS 2006: 77-90 - [c2]Walter Guttmann, Bernhard Möller:
Modal Design Algebra. UTP 2006: 236-256 - 2005
- [c1]Walter Guttmann:
Non-termination in Unifying Theories of Programming. RelMiCS 2005: 108-120 - 2003
- [j1]Walter Guttmann, Helmuth Partsch, Wolfram Schulte, Ton Vullinghs:
Tool Support for the Interactive Derivation of Formally Correct Functional Programs. J. Univers. Comput. Sci. 9(2): 173- (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
