Translating Erlang to μCRL

Arts, Thomas; Earle, Clara Benac; Penas, Juan José Sánchez

doi:10.1109/csd.2004.1309124

Cited by 11 publications

(21 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As discussed in the introduction, Benac Earle et al [2,3,6,10] have studied the translation of Erlang programs into μCRL and developed a toolset, etomcrl, for automating the process of translation.…”

Section: Related Workmentioning

confidence: 99%

“…The stack, initially defined in [3] for coping with side effect functions, defines six actions, these being rcallvalue, wcallresult, push callstack, rcallresult, wcallvalue and pop callstack; rcallvalue | wcallresult = push callstack and rcallresult | wcallvalue = pop callstack. The action rcallvalue pushes a value to stack, while, the action rcallresult pops up the top value from stack.…”

Section: The Process Algebra µCrlmentioning

confidence: 99%

“…Recently this second approach has been applied to the verification of Erlang programs and OTP components [2,3,6,10]. Here the process algebra μCRL [13] has been used as the formal language upon which verification is carried out.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Verifying Erlang/OTP Components in μCRL

Guo

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Erlang is a concurrent functional programming language with explicit support for real-time and fault-tolerant distributed systems. Generic components encapsulated as design patterns are provided by the Open Telecom Platform (OTP) library. Although Erlang has many highlevel features, verification is still non-trivial. One (existing) approach is to perform an abstraction of an Erlang program into the process algebra µCRL, upon which standard verification tools can be applied. In this paper we extend this work and propose a model that supports the translation of an OTP finite state machine design pattern into a µCRL specification. Then a standard toolset such as CADP can be applied in order to check properties that should hold for the system under development. Two small examples are presented, which experimentally show how the proposed model assists in model checking Erlang OTP components in µCRL.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: The Process Algebra µCrlmentioning

confidence: 99%

See 1 more Smart Citation

Verifying Erlang/OTP Components in μCRL

Guo

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A number of possible approaches have been explored, including the one we investigate here: abstract an Erlang application into a formal model, upon which model checking [9] techniques can be applied. This approach has recently been applied to the verification of Erlang programs and OTP components [2,3,5,7,14,16] where the process algebra μCRL [13] has been used as the formal language upon which verification is carried out.…”

Section: Introductionmentioning

confidence: 99%

“…Arts et al [2,3] initiated this strand of work and proposed rules for translating Erlang syntax and the OTP components gen server, supervisor into μCRL. Benac-Earle [5] continued with the work and developed a toolset, etomcrl, to automate the process of translation.…”

Section: Introductionmentioning

confidence: 99%

Verifying Erlang Telecommunication Systems with the Process Algebra μCRL

Guo

Derrick

Hoch

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

View full text Add to dashboard Cite

Abstract.Verification is an important process in the development of Erlang systems. A recent strand of work has studied the verification of Erlang applications using the process algebra μCRL. The general idea is that Erlang programs are translated into a μCRL specification, upon which the standard model checkers can be applied for checking the system's properties. In this paper, we pull together some of the existing work and investigate the verification of an Erlang telecommunication system in μCRL. This case study uses a server-client structure and incorporates timing restrictions and is designed and implemented using a number of Erlang/OTP components. We show how this system is translated into a μCRL specification by using the defined rules, after which system properties are checked via the toolset CADP. Through studying the verification of such an application, we aim to validate the effectiveness of the translation rules in an integrated way.

show abstract

Verification of Language Based Fault-Tolerance

Earle

Fredlund

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we target the verification of fault tolerant aspects of distributed applications written in the Erlang programming language. Erlang programmers mostly work with ready-made language components. Our approach to verification of fault tolerance is to verify systems built using a central component of most Erlang software, a generic server component with fault tolerance handling.To verify such Erlang programs we automatically translate them into processes of the µCRL process algebra, generate their state spaces, and use a model checker to determine whether they satisfy correctness properties specified in the µ-calculus.The key observation of this paper is that, due to the usage of these higher-level design patterns, the state space generated from a Erlang program, even with failures occurring, is relatively small, and can be generated automatically.

show abstract

Translating Erlang to μCRL

Cited by 11 publications

References 14 publications

Verifying Erlang/OTP Components in μCRL

Verifying Erlang/OTP Components in μCRL

Verifying Erlang Telecommunication Systems with the Process Algebra μCRL

Verification of Language Based Fault-Tolerance

Contact Info

Product

Resources

About