Verifying fault-tolerant Erlang programs

Earle, Clara Benac; Fredlund, Lars–Åke; Derrick, John

doi:10.1145/1088361.1088367

Cited by 7 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fault Tolerance. Erlang has various primitives which have been proven to guarantee high fault tolerance level [7]. It also supports unified monitoring and automatic process failover after a crash.…”

Section: Erlang Technologymentioning

confidence: 99%

Erlang-Based Sensor Network Management for Heterogeneous Devices

Nieć

Pikuła

Mamla

et al. 2012

csci

View full text Add to dashboard Cite

The paper describes a system designed to manage and collect data from the network of heterogeneous sensors. It was implemented using Erlang OTP and CouchDB for maximum fault tolerance, scalability and ease of deployment. It is resistant to poor network quality, shows high tolerance for software errors and power failures, operates on ﬂexible data model. Additionally, it is available to users through an Web application, which shows just how easy it is to use the server HTTP API to communicate with it. The whole platform was implemented and tested on variety of devices like PC, Mac, ARM-based embedded devices and Android tablets

show abstract

Section: Erlang Technologymentioning

confidence: 99%

Erlang-Based Sensor Network Management for Heterogeneous Devices

Nieć

Pikuła

Mamla

et al. 2012

csci

View full text Add to dashboard Cite

show abstract

Verifying Erlang Telecommunication Systems with the Process Algebra μCRL

Guo

Derrick

Hoch

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

Self Cite

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