- Worklist approach implemented through a Config flag in SummaryTable.
- Unconstrained and constrained variantes (TabularAlgorithm & ConstrainedTabularAlgorithm). The constrained version features a limit to the size of the stack.
- Constrained subsumed variant for efficiency (ConstrainedSubsumedTabularAlgorithm).
- Efficient EdgeList (linked-list) to store edges visited through a traversal.
- Bump language level to 16.
- eKnife cli: added switch to use tabular algorithms.
- Moved benchmarks out of eKnife and BencherTest.

- ️️SummaryTable: actual-out node may none or multiple matching formal-out.
- EDG, SummaryTable: get and clear methods for stats.
- EKnife, BencherTest: adapted for benchmarks in which running the benchmark alters the graph itself.

- Add flag to EDGFactory to enable the creation of interprocedural edges.

- A flag has been added to make slices intraprocedural if desired.

- Remember, to run benchmarks you require a "server" process for Erlang (see previous commits).
- If you output slices, astCounter.erl can be used to count the number of AST nodes in a given program.

- Basic support for records, bin, float, try, catch
- Feature to count access constraints traversed
- Feature to count access constraints present in the graph
- Bugs fixed:
  - Can handle empty string represented as list `[]`.
  - Can handle other unary operators apart from `-int`.
  - Can handle nested list comprehensions.
- Now requires a running instance of erlang, use the following command:

    erl -pa (pwd)/e-Knife/src/main/resources -name server@localhost -setcookie erlang -noshell

- BencherTest now accepts `-DiterGen=NUM` and `-DiterSlice=NUM` as Java arguments.

* Statistical functions to build tables

 * Added bencher intra- and inter-procedural suits
 * Added Dockerfile

* Measured the generation time of the different graph edges
* Added EKnife.timedRun to evaluate the slicer against all the possible slicing criteria of a program
* Added intraprocedural bencher suite

* Measured the generation time of the different graph edges
* Added EKnife.timedRun to evaluate the slicer against all the possible slicing criteria of a program
* Added intraprocedural bencher suite

* Added clarifying comma to help message.

* Now generating fat jars via maven
* Packaging of scripts via Makefile
* Fix detection of scripts file
* Updated README
* Disabled printing in Flusher
* Removed iml project files
* Added optional printing of the graph (to dot or pdf)

* Erlang script path defined
* Fixes in code generation: some sliced expressions removed instead of replaced
* Fix guard stacks in CFG generation
* Logic simplification in Node-Result creation process
* Fixed dead clause detection
* Improvements added to summary generation:
    + Function calls associated to a particular formal-out-formal-in summary edge are only repended when the grammar term is created, and not for each added production
    + The list of constraints stacked after an AsteriskConstraint are removed when another AsteriskConstraint is pushed to the stack

* AdHoc anonymous function calls (fun(X)-> X+1 end(5))
* Named anonymous function / function calls

* Anonymous functions considered (fun(X) -> ... end)
* Shadowing in Anonymous Functions and LCs improved

* ast.erl and saver.erl has been moved to e-knife resources folder
* CFG and Value arcs are now in e-Knife
* CFGs are built with a the visitor pattern
* The graph library is now jgrapht
* CFGs of the clauses of the same method are now independent
* Interprocedural clause matching has been improved to not link unreachable clauses
* Shadowed variables and its value are now delimited to their context
* Classic algorithm has been added to slicing computed algorithms