Summary: Applying Rewriting Techniques to the
Verification of Erlang Processes ?
Thomas Arts 1 and J¨urgen Giesl 2
1 Computer Science Laboratory, Ericsson Utvecklings AB, Box 1505, 125 25 ¨
Alvsj¨o,
Sweden, E­mail: thomas@cslab.ericsson.se
2 Dept. of Computer Science, Darmstadt University of Technology, Alexanderstr. 10,
64283 Darmstadt, Germany, E­mail: giesl@informatik.tu­darmstadt.de
Abstract. Erlang is a functional programming language developed by
Ericsson Telecom which is particularly well suited for implementing con­
current processes. In this paper we show how methods from the area
of term rewriting are presently used at Ericsson. To verify properties of
processes, such a property is transformed into a termination problem of
a conditional term rewriting system (CTRS). Subsequently, this termi­
nation proof can be performed automatically using dependency pairs.
The paper illustrates how the dependency pair technique can be applied
for termination proofs of conditional TRSs. Secondly, we present two
refinements of this technique, viz. narrowing and rewriting dependency
pairs. These refinements are not only of use in the industrial application
sketched in this paper, but they are generally applicable to arbitrary

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences