Ralf Treinen

Affiliations:
  • Paris Diderot University, IRIF, France
  • Pierre and Marie Curie University, Paris, France


According to our database1, Ralf Treinen authored at least 53 papers between 1990 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The CoLiS platform for the analysis of maintainer scripts in Debian software packages.
Int. J. Softw. Tools Technol. Transf., 2022

2020
Morbig: A Static parser for POSIX shell.
J. Comput. Lang., 2020

Analysing installation scenarios of Debian packages.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

2019
Logics for unordered trees with data constraints.
J. Comput. Syst. Sci., 2019

2018
Deciding the First-Order Theory of an Algebra of Feature Trees with Updates.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Automata for unordered trees.
Inf. Comput., 2017

A Formally Verified Interpreter for a Shell-Like Programming Language.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2017

2015
Mining Component Repositories for Installability Issues.
Proceedings of the 12th IEEE/ACM Working Conference on Mining Software Repositories, 2015

Logics for Unordered Trees with Data Constraints on Siblings.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Learning from the future of component repositories.
Sci. Comput. Program., 2014

Deterministic Automata for Unordered Trees.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Automated synthesis and deployment of cloud applications.
Proceedings of the ACM/IEEE International Conference on Automated Software Engineering, 2014

2013
A modular package manager architecture.
Inf. Softw. Technol., 2013

Aeolus: Mastering the Complexity of Cloud Application Deployment.
Proceedings of the Service-Oriented and Cloud Computing - Second European Conference, 2013

2012
Dependency solving: A separate concern in component evolution management.
J. Syst. Softw., 2012

Reducing Equational Theories for the Decision of Static Equivalence.
J. Autom. Reason., 2012

Why do software packages conflict?
Proceedings of the 9th IEEE Working Conference of Mining Software Repositories, 2012

Formal Aspects of Free and Open Source Software Components - A Short Survey.
Proceedings of the Formal Methods for Components and Objects, 2012

2011
Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus.
Proceedings of the Theory of Security and Applications - Joint Workshop, 2011

MPM: a modular package manager.
Proceedings of the 14th International ACM Sigsoft Symposium on Component Based Software Engineering, 2011

2009
Expressing advanced user preferences in component installation
CoRR, 2009

2008
Symbolic protocol analysis for monoidal equational theories.
Inf. Comput., 2008

Description of the CUDF Format
CoRR, 2008

Solving package dependencies: from EDOS to Mancoosi
CoRR, 2008

Proving Group Protocols Secure Against Eavesdroppers.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007
Intruder deduction for the equational theory of Abelian groups with distributive encryption.
Inf. Comput., 2007

2006
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions.
Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 2006

Symbolic Protocol Analysis in Presence of a Homomorphism Operator and <i>Exclusive Or</i>.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Intruder Deduction for <i>AC</i>-Like Equational Theories with Homomorphisms.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2003
Easy Intruder Deductions.
Proceedings of the Verification: Theory and Practice, 2003

2002
The first-order theory of subtyping constraints.
Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

2001
Grid structures and undecidable constraint theories.
Theor. Comput. Sci., 2001

The first-order theory of ordering constraints over feature trees.
Discret. Math. Theor. Comput. Sci., 2001

2000
On rewrite constraints and context unification.
Inf. Process. Lett., 2000

Predicate Logic and Tree Automata with Tests.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

1999
Constraints and Constraint Solving: An Introduction.
Proceedings of the Constraints in Computational Logics: Theory and Applications, 1999

1998
The First-Order Theory of Linear One-Step Rewriting is Undecidable.
Theor. Comput. Sci., 1998

How to Win a Game with Features.
Inf. Comput., 1998

An On-line Problem Database.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Dominance Constraints: Algorithms and Complexity.
Proceedings of the Logical Aspects of Computational Linguistics, 1998

1997
The First-Order Theory of Lexicographic Path Orderings is Undecidable.
Theor. Comput. Sci., 1997

Grid Structure and Undecidable Constraint Theories.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1996
The First-Order Theory of One-Step Rewriting is Undecidable.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1995
Feature Trees over Arbitrary Structures.
Proceedings of the 9th International Workshop on Unification, 1995

1994
Records for Logic Programming.
J. Log. Program., 1994

Ordering Constraints on Trees.
Proceedings of the Trees in Algebra and Programming, 1994

1993
Equational and Membership Constraints for Finite Trees.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

Feature Constraints with First-Class Features.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Constraint Deduction in an Interval-based Temporal Logic.
Proceedings of the Executable Modal and Temporal Logics, 1993

1992
A New Method for Undecidablity Proofs of First Order Theories.
J. Symb. Comput., 1992

1991
First Order Data Types and First Order Logic.
Proceedings of the Theoretical Aspects of Computer Software, 1991

Modulare Datentypdefinitionen und ihre Beziehungen zur Logik erster Stufe.
PhD thesis, 1991

1990
A New Method for Undecidability Proofs of First Order Theories.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990


  Loading...