Control-flow analysis of higher-order languages of taming lambda
Control-flow analysis of higher-order languages of taming lambda
Advanced compiler design and implementation
Advanced compiler design and implementation
A practical and flexible flow analysis for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of Program Analysis
Principles of Program Analysis
A formal, language-independent, and compositional approach to interprocedural control dependence analysis
Tool support for refactoring functional programs
Proceedings of the 2nd Workshop on Refactoring Tools
Impact analysis of erlang programs using behaviour dependency graphs
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Extending Erlang by utilising RefactorErl
Proceedings of the twelfth ACM SIGPLAN workshop on Erlang
| Hi-index | 0.00 |
Static software analyser tools use different levels of intermediate source code representations that depend on the syntax and semantics of the language to be analysed. Most of the analyser tools use graph representation to efficiently retrieve information. Building such graphs for dynamically typed languages, such as Erlang, is not straightforward. In this paper we present static analysis methods to define the Dependency Graph representation of Erlang programs. The introduced methods cover the data-, control-, behaviour-flow and dependency analyses for sequential and parallel language constructs.