Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Georg Struth
2010 – today
- 2013
[j16]- [c39]Alasdair Armstrong, Georg Struth, Tjark Weber: Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL. ITP 2013: 197-212
- [i4]Annabelle McIver, Tahiry M. Rabehaja, Georg Struth: Weak Concurrent Kleene Algebra with Application to Algebraic Verification. CoRR abs/1301.7153 (2013)
- [i3]Annabelle McIver, Tahiry M. Rabehaja, Georg Struth: Probabilistic Concurrent Kleene Algebra. CoRR abs/1306.2697 (2013)
- 2012
- [j15]Georg Struth: Left omega algebras and regular equations. J. Log. Algebr. Program. 81(6): 705-717 (2012)
- [c38]Alasdair Armstrong, Georg Struth: Automated Reasoning in Higher-Order Regular Algebra. RAMICS 2012: 66-81
- [c37]
- [c36]
- [c35]Simon Foster, Ondrej Rypacek, Georg Struth: Correctness of Object Oriented Models by Extended Type Inference. ICTAC 2012: 46-60
- [c34]Alasdair Armstrong, Simon Foster, Georg Struth: Dependently Typed Programming Based on Automated Theorem Proving. MPC 2012: 220-240
- 2011
- [j14]Jules Desharnais, Bernhard Möller, Georg Struth: Algebraic Notions of Termination. Logical Methods in Computer Science 7(1) (2011)
- [j13]Tony Hoare, Bernhard Möller, Georg Struth, Ian Wehrman: Concurrent Kleene Algebra and its Foundations. J. Log. Algebr. Program. 80(6): 266-296 (2011)
- [j12]Jules Desharnais, Georg Struth: Internal axioms for domain semirings. Sci. Comput. Program. 76(3): 181-203 (2011)
- [c33]Simon Foster, Georg Struth, Tjark Weber: Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL - (Invited Tutorial). RAMICS 2011: 52-67
- [c32]
- [c31]Annabelle McIver, Tahiry M. Rabehaja, Georg Struth: On Probabilistic Kleene Algebras, Automata and Simulations. RAMICS 2011: 264-279
- [c30]Walter Guttmann, Georg Struth, Tjark Weber: A Repository for Tarski-Kleene Algebras. ATE 2011: 30-39
- [c29]C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth: On Locality and the Exchange Law for Concurrent Processes. CONCUR 2011: 250-264
- [c28]Walter Guttmann, Georg Struth, Tjark Weber: Automating Algebraic Methods in Isabelle. ICFEM 2011: 617-632
- [c27]Simon Foster, Georg Struth: Integrating an Automated Theorem Prover into Agda. NASA Formal Methods 2011: 116-130
- [e3]Peter Höfner, Annabelle McIver, Georg Struth (Eds.): Proceedings of the First Workshop on Automated Theory Engineering, Wrocław, Poland, July 31, 2011. CEUR Workshop Proceedings 760, CEUR-WS.org 2011
- [i2]Alasdair Armstrong, Simon Foster, Georg Struth: Dependently Typed Programming based on Automated Theorem Proving. CoRR abs/1112.3833 (2011)
- 2010
- [j11]Rudolf Berghammer, Bernhard Möller, Georg Struth: Relations and Kleene algebras in computer science. J. Log. Algebr. Program. 79(8): 705-706 (2010)
- [j10]Peter Höfner, Georg Struth: Algebraic notions of nontermination: Omega and divergence in idempotent semirings. J. Log. Algebr. Program. 79(8): 794-811 (2010)
- [c26]Rudolf Berghammer, Georg Struth: On Automated Program Construction and Verification. MPC 2010: 22-41
2000 – 2009
- 2009
- [j9]Peter Höfner, Georg Struth, Geoff Sutcliffe: Automated verification of refinement laws. Ann. Math. Artif. Intell. 55(1-2): 35-62 (2009)
- [c25]
- [c24]C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman: Foundations of Concurrent Kleene Algebra. RelMiCS 2009: 166-186
- [c23]C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman: Concurrent Kleene Algebra. CONCUR 2009: 399-414
- 2008
- [j8]Peter Höfner, Georg Struth: Can Refinement be Automated? Electr. Notes Theor. Comput. Sci. 201: 197-222 (2008)
- [j7]Georg Struth: Modal Tools for Separation and Refinement. Electr. Notes Theor. Comput. Sci. 214: 81-101 (2008)
- [j6]Renate A. Schmidt, Georg Struth: Relations and Kleene Algebras in Computer Science. J. Log. Algebr. Program. 76(1): 1-2 (2008)
- [c22]
- [c21]Peter Jipsen, Georg Struth: The Structure of the One-Generated Free Domain Semiring. RelMiCS 2008: 234-242
- [c20]
- [c19]
- [c18]
- [e2]Rudolf Berghammer, Bernhard Möller, Georg Struth (Eds.): Relations and Kleene Algebra in Computer Science, 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 7-11, 2008. Proceedings. Lecture Notes in Computer Science 4988, Springer 2008, ISBN 978-3-540-78912-3
- 2007
- [c17]
- 2006
- [j5]
- [j4]Bernhard Möller, Georg Struth: Algebras of modal operators and partial correctness. Theor. Comput. Sci. 351(2): 221-239 (2006)
- [j3]Jules Desharnais, Bernhard Möller, Georg Struth: Kleene algebra with domain. ACM Trans. Comput. Log. 7(4): 798-833 (2006)
- [c16]
- [c15]
- [c14]Georg Struth: Constructing Rewrite-Based Decision Procedures for Embeddings and Termination. MPC 2006: 416-432
- 2005
- [j2]Michael Ebert, Georg Struth: Diagram Chase in Relational System Development. Electr. Notes Theor. Comput. Sci. 127(4): 87-105 (2005)
- [c13]
- [c12]
- 2004
- [c11]
- [c10]Jules Desharnais, Bernhard Möller, Georg Struth: Termination in Modal Kleene Algebra. IFIP TCS 2004: 647-660
- [c9]
- [e1]Rudolf Berghammer, Bernhard Möller, Georg Struth (Eds.): Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Germany, May 12-17, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3051, Springer 2004, ISBN 3-540-22145-X
- 2003
- [c8]
- [c7]Bernhard Möller, Georg Struth: Greedy-Like Algorithms in Modal Kleene Algebra. RelMiCS 2003: 202-215
- [c6]
- [i1]Jules Desharnais, Bernhard Möller, Georg Struth: Kleene algebra with domain. CoRR cs.LO/0310054 (2003)
- 2002
- [c5]
- 2001
- [j1]Georg Struth: Knuth-Bendix Completion for Non-Symmetric Transitive Relations. Electr. Notes Theor. Comput. Sci. 59(4): 341-357 (2001)
- [c4]
- [c3]
- 2000
- [c2]
1990 – 1999
- 1997
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:09 CEST by the dblp team