 | 2009 |
|---|
| 36 |       | Ralf Treinen:
Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings
Springer 2009 |
| 35 | | Ralf Treinen,
Stefano Zacchiroli:
Expressing advanced user preferences in component installation
CoRR abs/0909.5091: (2009) |
| 2008 |
|---|
| 34 | | Steve Kremer,
Antoine Mercier,
Ralf Treinen:
Proving Group Protocols Secure Against Eavesdroppers.
IJCAR 2008: 116-131 |
| 33 | | Ralf Treinen,
Stefano Zacchiroli:
Solving package dependencies: from EDOS to Mancoosi
CoRR abs/0811.3620: (2008) |
| 32 | | Ralf Treinen,
Stefano Zacchiroli:
Description of the CUDF Format
CoRR abs/0811.3621: (2008) |
| 31 | | Stéphanie Delaune,
Pascal Lafourcade,
Denis Lugiez,
Ralf Treinen:
Symbolic protocol analysis for monoidal equational theories.
Inf. Comput. 206(2-4): 312-351 (2008) |
| 2007 |
|---|
| 30 | | Pascal Lafourcade,
Denis Lugiez,
Ralf Treinen:
Intruder deduction for the equational theory of Abelian groups with distributive encryption.
Inf. Comput. 205(4): 581-623 (2007) |
| 2006 |
|---|
| 29 | | Fabio Mancinelli,
Jaap Boender,
Roberto Di Cosmo,
Jerome Vouillon,
Berke Durak,
Xavier Leroy,
Ralf Treinen:
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions.
ASE 2006: 199-208 |
| 28 | | Stéphanie Delaune,
Pascal Lafourcade,
Denis Lugiez,
Ralf Treinen:
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or.
ICALP (2) 2006: 132-143 |
| 2005 |
|---|
| 27 | | Pascal Lafourcade,
Denis Lugiez,
Ralf Treinen:
Intruder Deduction for AC-Like Equational Theories with Homomorphisms.
RTA 2005: 308-322 |
| 2003 |
|---|
| 26 | | Hubert Comon-Lundh,
Ralf Treinen:
Easy Intruder Deductions.
Verification: Theory and Practice 2003: 225-242 |
| 2002 |
|---|
| 25 | | Zhendong Su,
Alexander Aiken,
Joachim Niehren,
Tim Priesnitz,
Ralf Treinen:
The first-order theory of subtyping constraints.
POPL 2002: 203-216 |
| 2001 |
|---|
| 24 |  | Hubert Comon,
Claude Marché,
Ralf Treinen:
Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999, Revised Lectures
Springer 2001 |
| 23 | | Martin Müller,
Joachim Niehren,
Ralf Treinen:
The first-order theory of ordering constraints over feature trees.
Discrete Mathematics & Theoretical Computer Science 4(2): 193-234 (2001) |
| 22 | | Franck Seynhaeve,
Sophie Tison,
Marc Tommasi,
Ralf Treinen:
Grid structures and undecidable constraint theories.
Theor. Comput. Sci. 258(1-2): 453-490 (2001) |
| 2000 |
|---|
| 21 | | Ralf Treinen:
Predicate Logic and Tree Automata with Tests.
FoSSaCS 2000: 329-343 |
| 20 | | Joachim Niehren,
Sophie Tison,
Ralf Treinen:
On rewrite constraints and context unification.
Inf. Process. Lett. 74(1-2): 35-40 (2000) |
| 1999 |
|---|
| 19 | | Jean-Pierre Jouannaud,
Ralf Treinen:
Constraints and Constraint Solving: An Introduction.
CCL 1999: 1-46 |
| 1998 |
|---|
| 18 | | Alexander Koller,
Joachim Niehren,
Ralf Treinen:
Dominance Constraints: Algorithms and Complexity.
LACL 1998: 106-125 |
| 17 | | Martin Müller,
Joachim Niehren,
Ralf Treinen:
The First-Order Theory of Ordering Constraints over Feature Trees.
LICS 1998: 432-443 |
| 16 | | Nachum Dershowitz,
Ralf Treinen:
An On-line Problem Database.
RTA 1998: 332-342 |
| 15 | | Rolf Backofen,
Ralf Treinen:
How to Win a Game with Features.
Inf. Comput. 142(1): 76-101 (1998) |
| 14 | | Ralf Treinen:
The First-Order Theory of Linear One-Step Rewriting is Undecidable.
Theor. Comput. Sci. 208(1-2): 179-190 (1998) |
| 1997 |
|---|
| 13 | | Franck Seynhaeve,
Marc Tommasi,
Ralf Treinen:
Grid Structure and Undecidable Constraint Theories.
TAPSOFT 1997: 357-368 |
| 12 | | Hubert Comon,
Ralf Treinen:
The First-Order Theory of Lexicographic Path Orderings is Undecidable.
Theor. Comput. Sci. 176(1-2): 67-87 (1997) |
| 1996 |
|---|
| 11 | | Ralf Treinen:
The First-Order Theory of One-Step Rewriting is Undecidable.
RTA 1996: 276-286 |
| 1994 |
|---|
| 10 | | Hubert Comon,
Ralf Treinen:
Ordering Constraints on Trees.
CAAP 1994: 1-14 |
| 9 | | Rolf Backofen,
Ralf Treinen:
How to Win a Game with Features.
CCL 1994: 320-335 |
| 8 | | Gert Smolka,
Ralf Treinen:
Records for Logic Programming.
J. Log. Program. 18(3): 229-258 (1994) |
| 1993 |
|---|
| 7 | | Jana Koehler,
Ralf Treinen:
Constraint Deduction in an Interval-based Temporal Logic.
Executable Modal and Temporal Logics 1993: 103-117 |
| 6 | | Ralf Treinen:
Feature Constraints with First-Class Features.
MFCS 1993: 734-743 |
| 5 | | Joachim Niehren,
Andreas Podelski,
Ralf Treinen:
Equational and Membership Constraints for Finite Trees.
RTA 1993: 106-120 |
| 1992 |
|---|
| 4 | | Gert Smolka,
Ralf Treinen:
Records for Logic Programming.
JICSLP 1992: 240-254 |
| 3 | | Ralf Treinen:
A New Method for Undecidablity Proofs of First Order Theories.
J. Symb. Comput. 14(5): 437-458 (1992) |
| 1991 |
|---|
| 2 | | Ralf Treinen:
First Order Data Types and First Order Logic.
TACS 1991: 594-614 |
| 1990 |
|---|
| 1 | | Ralf Treinen:
A New Method for Undecidability Proofs of First Order Theories.
FSTTCS 1990: 48-62 |
