#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1990

2017

- This year (3)
- Last 5 years (14)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gert Smolka, Ralf Treinen
- J. Log. Program.
- 1992

CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where ner-grained constraints are used, and where subtrees are identiied by keywords rather than by position. CFT is deened by a rst-order structure consisting of… (More)

- Fabio Mancinelli, Jaap Boender, +4 authors Ralf Treinen
- 21st IEEE/ACM International Conference on…
- 2006

The widespread adoption of free and open source software (FOSS) in many strategic contexts of the information technology society has drawn the attention on the issues regarding how to handle the complexity of assembling and managing a huge number of (packaged) components in a consistent and effective way. FOSS distributions (and in particular… (More)

- Pascal Lafourcade, Denis Lugiez, Ralf Treinen
- RTA
- 2005

Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocols rely on rewriting techniques and automated deduction in order to implement or mimic the process calculus describing the protocol execution. We focus on the intruder deduction… (More)

- Alexander Koller, Joachim Niehren, Ralf Treinen
- LACL
- 1998

Dominance constraints for nite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their rst-order theory. We present two NP algorithms for solving dominance constraints, which have been… (More)

- Hubert Comon-Lundh, Ralf Treinen
- Verification: Theory and Practice
- 2003

- Ralf Treinen
- J. Symb. Comput.
- 1990

We claim that the reduction of Post's Correspondence Problem to the decision problem of a theory provides a useful tool for proving undecidability of rst order theories given by some interpretation. The goal of this paper is to deene a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a… (More)

- Roberto Di Cosmo, Michael Lienhardt, +4 authors Alexis Agahi
- ASE
- 2014

Complex networked applications are assembled by connecting software components distributed across multiple machines. Building and deploying such systems is a challenging problem which requires a significant amount of expertise: the system architect must ensure that all component dependencies are satisfied, avoid conflicting components, and add the right… (More)

- Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen
- Inf. Comput.
- 2008

We consider the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we take into account some algebraic properties satisfied by the operators involved in the protocol. This leads to a more realistic model than what we get under the perfect cryptography… (More)

- Hubert Comon-Lundh, Ralf Treinen
- Theor. Comput. Sci.
- 1997

The recursive path orderings (short rpo) are orderings on terms introduced by N. Dershowitz. They are the most popular orderings used for proving the termination of term rewriting systems (see [4] for a survey). The reason for the usefulness of these orderings lies in their stability properties: if s > rpo t, then, for every context C, C[s] > rpo C[t] (this… (More)

- Ralf Treinen
- RTA
- 1996