Advertisement
Published in:
2018 | OriginalPaper | Chapter
Using Functional Directives to Analyze Code Complexity
Authors : Daniel Rubio Bonilla, Colin W. Glass
Published in: Tools and Methods of Program Analysis
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Functional programming languages bring a set of benefits, programmability and lack of state to name a few, that are missing on typical procedural languages. In recent years efforts have been made to introduce a set of the functional concepts into procedural languages (like C++11 or python). Research projects, such as POLCA, have develop means to introduce functional-like semantics to procedural code that describe the algorithmic behavior of the application. This allows compilers to perform aggressive code transformations that increase performance and allow portability across different architectures. In this work we describe how the static analysis of functional semantics directives can be used to determine the algorithmic complexity.