SlicErl: Slicing of Erlang

Click here for a short description of the technique...

SlicErl is a program slicer for Erlang. It is based on the System Dependence Graph with some adaptations and extensions which are specific to Erlang.

Given an Erlang program, first, a graph representation is generated, that contains all the control and flow interrelations. Then, the standard program slicing algorithm is used to extract slices in linear time.

This webapp is a limited trial of SlicErl, with time and memory constraints to avoid abuse.
You can generate slices and graphs for simple programs.
The full version can be downloaded from Github.

You can either write down an Erlang program or choose one from the list of examples.

Usage instructions:

  1. Select/write your Erlang program.
  2. Press the Generate graph button. You can view the graph by pressing the View graph button.
  3. To extract a slice, select an expression of the program as slicing criterion (highlight it in the Erlang program editor) and get the sliced version of the code by pressing the Slice button.

Edges to show in the graph:
Slicing criterion (select it in the editor): ,
Graph:
Sliced graph: