Verification of timed erlang/OTP components using the process algebra μcrl

Guo, Qiang; Derrick, John

doi:10.1145/1292520.1292529

Cited by 3 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At FORTE'07 we defined the rules for translating gen fsm into μCRL, and evaluated the rules with two case studies. This was extended in [16] by defining the rules for coping with Erlang timeout events and evaluated the work with some case studies. The experimental results show quite a promising effect for system verification.…”

Section: Discussionmentioning

confidence: 99%

“…Afterwards, the process is terminated by setting the FTM to true. Thus we have the following output from the translation process: The process fsm timing and the process count down are parameterized with a timer [16]. By using an explicit tick action in the process count down, we apply a discrete-time timing model to support the translation of timeout event.…”

Section: Translating the Client Componentmentioning

confidence: 99%

“…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%

“…Benac-Earle [5] continued with the work and developed a toolset, etomcrl, to automate the process of translation. Guo et al extended the work by proposing a model for the translation of the OTP finite state machine gen fsm [14] and defining rules for coping with Erlang timeout events in μCRL [16].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Section: Discussionmentioning

confidence: 99%

Section: Translating the Client Componentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

show abstract

“…McErlang [6] is a finite-state on-thefly model-checker for Büchi properties and EtomCRL2 [7] translates Erlang programs to µCRL which allows verification. Soter instead operates on the semantics of Erlang directly and model-checks an infinite-state transition system.…”

Section: Related Workmentioning

confidence: 99%

Soter

D'Osualdo

Kochems

Ong

2012

Proceedings of the 2nd Edition on Programming Systems, Languages and Applications Based on Actors, Agents, and Decentralized Co

View full text Add to dashboard Cite

This paper presents Soter, a fully-automatic program analyser and verifier for Erlang modules. The fragment of Erlang accepted by Soter includes the higher-order functional constructs and all the key features of actor concurrency, namely, dynamic and possibly unbounded spawning of processes and asynchronous message passing. Soter uses a combination of static analysis and infinite-state model checking to verify safety properties specified by the user. Given an Erlang module and a set of properties, Soter first extracts an abstract (approximate but sound) model in the form of an actor communicating system (ACS), and then checks if the properties are satisfied using a Petri net coverability checker, BFC. To our knowledge, Soter is the first fully-automatic, infinitestate model checker for a large fragment of Erlang. We find that in practice our abstraction technique is accurate enough to verify an interesting range of safety properties such as mutual-exclusion and boundedness of mailboxes. Though the ACS coverability problem is EXPSPACE-complete, Soter can analyse these problems surprisingly efficiently.

show abstract

Verification of Timed Erlang Programs Using McErlang

Earle

Fredlund

2012

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

There is a large number of works that apply model checking to timed specifications, however, there are far fewer attempts at model checking concurrent programs for which correct timed behaviour is crucial. In this work we explore the formal verification of timed programs written in the Erlang concurrent programming language, in its full complexity, using the McErlang model checker. We have extended the McErlang model checker with a timed semantics, similar to the timed semantics Lamport has developed for TLA and TLC, but with a few notable differences. In the paper we present the resulting semantics, its implementation in McErlang, and evaluate it using a number of examples. Among the examples is a process supervision component for controlling the processes in an Erlang application, which provides fault-tolerance.

show abstract

Verification of timed erlang/OTP components using the process algebra μcrl

Cited by 3 publications

References 16 publications

Verifying Erlang Telecommunication Systems with the Process Algebra μCRL

Verifying Erlang Telecommunication Systems with the Process Algebra μCRL

Soter

Verification of Timed Erlang Programs Using McErlang

Contact Info

Product

Resources

About