Process algebra
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
AXD 301: a new generation ATM switching system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Verification of Erlang programs using abstract interpretation and model checking
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Model checking
Verifying Erlang Code: A Resource Locker Case-Study
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Verifying fault-tolerant Erlang programs
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Verification of language based fault-tolerance
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Verification of timed erlang/OTP components using the process algebra μcrl
ERLANG '07 Proceedings of the 2007 SIGPLAN workshop on ERLANG Workshop
Verifying Erlang Telecommunication Systems with the Process Algebra μCRL
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Model-checking Erlang: a comparison between EtomCRL2 and McErlang
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
| Hi-index | 0.00 |
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 high-level 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.