Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Appeared in Applicable Algebra in Engineering, Communi-cation and Computing, 12(1,2):39-72, 2001.
 

Summary: Appeared in Applicable Algebra in Engineering, Communi-
cation and Computing, 12(1,2):39-72, 2001.
Veri cation of Erlang Processes by
Dependency Pairs ?
Jurgen Giesl 1 , Thomas Arts 2
1 LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany,
E-mail: giesl@informatik.rwth-aachen.de
2 Computer Science Lab., Ericsson Utvecklings AB, Box 1505, 125 25 
Alvsjo,
Sweden, E-mail: thomas@cslab.ericsson.se
Received: date / Revised version: date
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 termination proof can be
performed automatically using dependency pairs.
The paper illustrates how the dependency pair technique can be ap-
plied for termination proofs of conditional TRSs. Secondly, we present three

  

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

 

Collections: Computer Technologies and Information Sciences