Impact Analysis of Erlang Programs Using Behaviour Dependency Graphs

Tóth, Melinda; Bozó, István; Lovei, Laszlo; Tejfel, Máté; Kozsik, Tamás

doi:10.1007/978-3-642-17685-2_11

Cited by 12 publications

(15 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We are currently defining a new dependence called partial-dependence to solve this problem. A solution to this problem has already been defined in [16]. Its implementation will be available soon in the webpage of Slicerl.…”

Section: Discussionmentioning

confidence: 99%

“…However, this graph solve the problem of flow dependence and thus it is subsumed by our graphs. Another related approach is based on the behavior dependency graphs (BDG) [16] that has been also defined for Erlang. Even though the BDG is able to handle pattern matching, composite expressions and all constructs present in Erlang, it has the same problem as previous approaches: the lack of the summary edges [6] used in the SDG implies a loss of precision.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

System Dependence Graphs in Sequential Erlang

Silva

Tamarit

Tomás

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The system dependence graph (SDG) is a data structure used in the imperative paradigm for different static analysis, and particularly, for program slicing. Program slicing allows us to determine the part of a program (called slice) that influences a given variable of interest. Thanks to the SDG, we can produce precise slices for interprocedural programs. Unfortunately, the SDG cannot be used in the functional paradigm due to important features that are not considered in this formalism (e.g., pattern matching, higher-order, composite expressions, etc.). In this work we propose the first adaptation of the SDG to a functional language facing these problems. We take Erlang as the host language and we adapt the algorithms used to slice the SDG to produce precise slices of Erlang interprocedural programs. As a proof-of-concept, we have implemented a program slicer for Erlang based on our SDGs.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

System Dependence Graphs in Sequential Erlang

Silva

Tamarit

Tomás

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In the area of program slicing for Erlang programs, M. Tóth et al [4,29] have investigated the use of data, behaviour and control dependency information to carry out inter-function forward slicing. Their aim was to detect the impact of a change on a certain point of the program so as to reduce the number of regression test cases to be rerun after the change.…”

Section: Refactoring and Slicing Support For Erlangmentioning

confidence: 99%

Safe Concurrency Introduction through Slicing

Thompson

2015

Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

show abstract

“…<<"q">> -> (34) MString = get value(<<"q">>, Msg), (35) Method = string to method(MString), (36) Params = get value(<<"a">>, Msg), (37) { Method, MsgID, Params }; (38) <<"r">> -> (39) Values = get value(<<"r">>, Msg), (40) { response, MsgID, Values }; (41) <<"e">> -> (42) [ECode, EMsg] = get value(<<"e">>, Msg), { ok, bcode() }|{ error, Reason }. (10) decode(Bin) when is binary(Bin) -> (11) decode(binary to list(Bin)); (12) decode(String) when is list(String) -> (13) try (14) { Res, Extra } = decode b(String), (15) { ok, Res } (16) catch (17) error:Reason -> { error, Reason } (18) end.…”

Section: Using Secer In a Concurrent Environmentmentioning

confidence: 99%

“…Most of the efforts in regression testing research have been put in the regression testing minimization, selection, and prioritization [1], although among practitioners it does not seem to be the most important issue [7]. In fact, in the particular case of the Erlang language, most of the works in the area are focused on this specific task [39][40][41][42]. We can find other works in Erlang that share similar goals but more focused on checking whether applying a refactoring rule will yield to a semantics-preserving new code [3,4].…”

Section: Related Workmentioning

confidence: 99%

Behaviour Preservation across Code Versions in Erlang

Insa

Pérez

Silva

et al. 2018

Scientific Programming

View full text Add to dashboard Cite

In any alive and nontrivial program, the source code naturally evolves along the lifecycle for many reasons such as the implementation of new functionality, the optimization of a bottleneck, or the refactoring of an obscure function. Frequently, these code changes affect various different functions and modules, so it can be difficult to know whether the correct behaviour of the previous version has been preserved in the new version. In this paper, we face this problem in the context of the Erlang language, where most developers rely on a previously defined test suite to check the behaviour preservation. We propose an alternative approach to automatically obtain a test suite that specifically focusses on comparing the old and new versions of the code. Our test case generation is directed by a sophisticated combination of several already existing tools such as TypEr, CutEr, and PropEr; and it introduces novel ideas such as allowing the programmer to choose one or more expressions of interest that must preserve the behaviour, or the recording of the sequences of values to which those expressions are evaluated. All the presented work has been implemented in an open-source tool that is publicly available on GitHub.

show abstract

Impact Analysis of Erlang Programs Using Behaviour Dependency Graphs

Cited by 12 publications

References 2 publications

System Dependence Graphs in Sequential Erlang

System Dependence Graphs in Sequential Erlang

Safe Concurrency Introduction through Slicing

Behaviour Preservation across Code Versions in Erlang

Contact Info

Product

Resources

About