St.Petersburg, Russia
November 14–15, 2019

Talks & master-classes

CFL-Reachability Based Framework for Interprocedural Static Code Analysis Development

  • Programming / Tools
  • Accepted

November 14, 18:10
Room III|III зал
Add to gCal    Add to iCal/Outlook

Discuss the presentation

We propose an extensible framework for interprocedural static code analysis implementation. Our solution is based on CFL-reachability: analysis is formulated in terms of context-free constrained reachability in the interprocedural graph. Extensible architecture allows one to implement new analysis and integrate it into the IDE of choice or static code analysis tool. To demonstrate the abilities of our solution, we implement the plugin which provides basic taint analysis and label flow analysis upon ReSharper infrastructure. We demonstrate its applicability for real-world problems. Sources are available here:

Ilya Nozhkin photo

Ilya Nozhkin

Student, SPbSU

A student of the faculty of mathematics and mechanics.

Semyon Grigorev

Associate Professor, SPbSU

Researcher at Programming Languages and Tools lab.