Automatic Inference of Erlang Module Behaviour

Taylor, Ramsay; Bogdanov, Kirill; Derrick, John

doi:10.1007/978-3-642-38613-8_18

Cited by 2 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, the extraction of models for gen_server can hardly be completely automated since the library specifications are informal. Our future work will focus on applying model-inference techniques building upon our work on inferring finite state machines from Erlang code [14], and on inferring Extended Finite State Machines that are able to take account of the underlying data state [15]. Automatic inference of models will mitigate a disadvantage of our approach, which as is the case with most model-based analysis techniques, has two main repercussions.…”

Section: Discussionmentioning

confidence: 99%

Choreography-Based Analysis of Distributed Message Passing Programs

Taylor

Tuosto

Walkinshaw

et al. 2016

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

Self Cite

View full text Add to dashboard Cite

Abstract-Distributed programs are vulnerable to subtle communication faults (e.g. deadlocks, lost messages). Although the behaviour of individual processes can be relatively straightforward, faults can still be hard to detect because the macroscopic behaviour emerging from interactions can easily become very complex. This paper reports the analysis of gen_server, an Erlang popular library to build client-server applications. Our analysis uses a tool based on choreographic models of communicating finite state machines (CFSMs). We discuss how, once the library has been modelled in terms of CFSMs, an automated analysis can be used to detect potential communication errors. The results of our analysis suggest how to properly use gen_server in order to guarantee the absence of communication errors.

show abstract

Section: Discussionmentioning

confidence: 99%

Choreography-Based Analysis of Distributed Message Passing Programs

Taylor

Tuosto

Walkinshaw

et al. 2016

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our previous work has demonstrated the use of grammar inference techniques to infer models of behaviour for Erlang implementations [2,7]. Grammar inference techniques work by considering sequences of operations in the system -hereafter referred to as traces of the system.…”

Section: Background Work: Grammar and Comparisonmentioning

confidence: 99%

“…Previous work has demonstrated the practicality of automatically inferring state machine models of software behaviour [4,6,8,9]. The work presented in this paper builds on top of the existing techniques for extracting models from systems, as implemented in StateChum, including the PLTSDiff algorithm and the Erlang module inference system [7].…”

Section: Introductionmentioning

confidence: 99%