2007 |
22 | EE | Werner Damm,
Stefan Disch,
Hardi Hungar,
Swen Jacobs,
Jun Pang,
Florian Pigorsch,
Christoph Scholl,
Uwe Waldmann,
Boris Wirtz:
Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space.
ATVA 2007: 425-440 |
21 | EE | Michel Ludwig,
Uwe Waldmann:
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties.
LPAR 2007: 348-362 |
20 | EE | Swen Jacobs,
Uwe Waldmann:
Comparing Instance Generation Methods for Automated Reasoning.
J. Autom. Reasoning 38(1-3): 57-78 (2007) |
2006 |
19 | EE | Werner Damm,
Stefan Disch,
Hardi Hungar,
Jun Pang,
Florian Pigorsch,
Christoph Scholl,
Uwe Waldmann,
Boris Wirtz:
Automatic Verification of Hybrid Systems with Large Discrete State Space.
ATVA 2006: 276-291 |
18 | EE | Harald Ganzinger,
Viorica Sofronie-Stokkermans,
Uwe Waldmann:
Modular proof systems for partial functions with Evans equality.
Inf. Comput. 204(10): 1453-1492 (2006) |
2005 |
17 | EE | Swen Jacobs,
Uwe Waldmann:
Comparing Instance Generation Methods for Automated Reasoning.
TABLEAUX 2005: 153-168 |
2004 |
16 | EE | Harald Ganzinger,
Viorica Sofronie-Stokkermans,
Uwe Waldmann:
Modular Proof Systems for Partial Functions with Weak Equality.
IJCAR 2004: 168-182 |
2003 |
15 | EE | Harald Ganzinger,
Thomas Hillenbrand,
Uwe Waldmann:
Superposition Modulo a Shostak Theory.
CADE 2003: 182-196 |
2002 |
14 | EE | Uwe Waldmann:
Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I).
J. Symb. Comput. 33(6): 777-829 (2002) |
13 | EE | Uwe Waldmann:
Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II).
J. Symb. Comput. 33(6): 831-861 (2002) |
2001 |
12 | EE | Uwe Waldmann:
Superposition and Chaining for Totally Ordered Divisible Abelian Groups.
IJCAR 2001: 226-241 |
1999 |
11 | | Uwe Waldmann:
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups.
LPAR 1999: 131-147 |
1998 |
10 | EE | Uwe Waldmann:
Superposition for Divisible Torsion-Free Abelian Groups.
CADE 1998: 144-159 |
9 | EE | Uwe Waldmann:
Extending Reduction Orderings to ACU-Compatible Reduction Orderings.
Inf. Process. Lett. 67(1): 43-49 (1998) |
1996 |
8 | | Harald Ganzinger,
Uwe Waldmann:
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract).
CADE 1996: 388-402 |
1994 |
7 | | Leo Bachmair,
Harald Ganzinger,
Uwe Waldmann:
Refutational Theorem Proving for Hierachic First-Order Theories.
Appl. Algebra Eng. Commun. Comput. 5: 193-212 (1994) |
1993 |
6 | | Leo Bachmair,
Harald Ganzinger,
Uwe Waldmann:
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality.
Kurt Gödel Colloquium 1993: 83-96 |
5 | | Leo Bachmair,
Harald Ganzinger,
Uwe Waldmann:
Set Constraints are the Monadic Class
LICS 1993: 75-83 |
1992 |
4 | | Leo Bachmair,
Harald Ganzinger,
Uwe Waldmann:
Theorem Proving for Hierarchic First-Order Theories.
ALP 1992: 420-434 |
3 | | Harald Ganzinger,
Uwe Waldmann:
Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems.
CTRS 1992: 430-437 |
2 | | Uwe Waldmann:
Semantics of Order-Sorted Specifications.
Theor. Comput. Sci. 94(1): 1-35 (1992) |
1990 |
1 | | Uwe Waldmann:
Compatibility of Order-Sorted Rewrite Rules.
CTRS 1990: 407-416 |