The SCEAS System
Navigation Menu

Search the dblp DataBase


Georg Struth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernhard Möller, Georg Struth
    Greedy-Like Algorithms in Modal Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:202-215 [Conf]
  2. Thorsten Ehm, Bernhard Möller, Georg Struth
    Kleene Modules. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:112-124 [Conf]
  3. Georg Struth
    Calculating Church-Rosser Proofs in Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2001, pp:276-290 [Conf]
  4. Bernhard Möller, Georg Struth
    p Is. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2005, pp:200-211 [Conf]
  5. Georg Struth
    Knuth-Bendix Completion as a Data Structure. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2005, pp:225-236 [Conf]
  6. Bernhard Möller, Georg Struth
    Modal Kleene Algebra and Partial Correctness. [Citation Graph (0, 0)][DBLP]
    AMAST, 2004, pp:379-393 [Conf]
  7. Georg Struth
    Tableaux for Lattices. [Citation Graph (0, 0)][DBLP]
    AMAST, 2006, pp:323-337 [Conf]
  8. Bernhard Möller, Peter Höfner, Georg Struth
    Quantales and Temporal Logics. [Citation Graph (0, 0)][DBLP]
    AMAST, 2006, pp:263-277 [Conf]
  9. Georg Struth
    A Calculus for Set-Based Program Development. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2003, pp:541-559 [Conf]
  10. Jules Desharnais, Bernhard Möller, Georg Struth
    Termination in Modal Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:647-660 [Conf]
  11. Georg Struth
    Constructing Rewrite-Based Decision Procedures for Embeddings and Termination. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:416-432 [Conf]
  12. Georg Struth
    An Algebra of Resolution. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:214-228 [Conf]
  13. Georg Struth
    Deriving Focused Calculi for Transitive Relations. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:291-305 [Conf]
  14. Georg Struth
    Deriving Focused Lattice Calculi. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:83-97 [Conf]
  15. Georg Struth
    On the Word Problem for Free Lattices. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:128-141 [Conf]
  16. Georg Struth
    Automated Element-Wise Reasoning with Sets. [Citation Graph (0, 0)][DBLP]
    SEFM, 2004, pp:320-329 [Conf]
  17. Jules Desharnais, Bernhard Möller, Georg Struth
    Kleene algebra with domain [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  18. Michael Ebert, Georg Struth
    Diagram Chase in Relational System Development. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:127, n:4, pp:87-105 [Journal]
  19. Georg Struth
    Abstract abstract reduction. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2006, v:66, n:2, pp:239-270 [Journal]
  20. Bernhard Möller, Georg Struth
    Algebras of modal operators and partial correctness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:2, pp:221-239 [Journal]
  21. Georg Struth
    Knuth-Bendix Completion for Non-Symmetric Transitive Relations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:59, n:4, pp:- [Journal]
  22. Jules Desharnais, Bernhard Möller, Georg Struth
    Kleene algebra with domain. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:4, pp:798-833 [Journal]
  23. Peter Höfner, Georg Struth
    Automated Reasoning in Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:279-294 [Conf]

  24. The Structure of the One-Generated Free Domain Semiring. [Citation Graph (, )][DBLP]

  25. Non-termination in Idempotent Semirings. [Citation Graph (, )][DBLP]

  26. Foundations of Concurrent Kleene Algebra. [Citation Graph (, )][DBLP]

  27. Domain and Antidomain Semigroups. [Citation Graph (, )][DBLP]

  28. Domain Axioms for a Family of Near-Semirings. [Citation Graph (, )][DBLP]

  29. On Automating the Calculus of Relations. [Citation Graph (, )][DBLP]

  30. Concurrent Kleene Algebra. [Citation Graph (, )][DBLP]

  31. Modal Semirings Revisited. [Citation Graph (, )][DBLP]

  32. On Automated Program Construction and Verification. [Citation Graph (, )][DBLP]

  33. Automated verification of refinement laws. [Citation Graph (, )][DBLP]

  34. Can Refinement be Automated? [Citation Graph (, )][DBLP]

  35. Modal Tools for Separation and Refinement. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.007secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002