Walter Guttmann
According to our database^{1},
Walter Guttmann
authored at least 43 papers
between 2003 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
An algebraic framework for minimum spanning tree problems.
Theor. Comput. Sci., 2018
Verifying minimum spanning tree algorithms with Stone relation algebras.
J. Log. Algebr. Meth. Program., 2018
Relational Characterisations of Paths.
CoRR, 2018
Aggregation Algebras.
Archive of Formal Proofs, 2018
2017
A framework for automating security analysis of the internet of things.
J. Network and Computer Applications, 2017
An algebraic approach to multirelations and their properties.
J. Log. Algebr. Meth. Program., 2017
StoneKleene Relation Algebras.
Archive of Formal Proofs, 2017
Stone Relation Algebras.
Archive of Formal Proofs, 2017
Stone Relation Algebras.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2017
2016
An algebraic approach to computations with progress.
J. Log. Algebr. Meth. Program., 2016
Stone Algebras.
Archive of Formal Proofs, 2016
Kleene Algebras with Domain.
Archive of Formal Proofs, 2016
RelationAlgebraic 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. Algebr. Meth. Program., 2015
A RelationAlgebraic 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. Algebr. Meth. 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. Algebr. Program., 2012
Algebras for iteration and infinite computations.
Acta Inf., 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. Algebr. Program., 2011
Automating Algebraic Methods in Isabelle.
Proceedings of the Formal Methods and Software Engineering, 2011
A Repository for TarskiKleene 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. Algebr. Program., 2010
Imperative abstractions for functional actions.
J. Log. Algebr. 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
Nontermination 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. UCS, 2003