Also co-located with ISSTA is the workshop on Designing Code Analysis Frameworks. We talked to the organizers.
What is the main problem that motivates your workshop?
We would like to gather the minds behind various code analysis frameworks to share their experience in designing those frameworks. We believe this is going to be a great opportunity for the research community to discuss the tradeoffs usually made when designing code analysis frameworks, and how that affects the way those frameworks are used in practice.
How did this workshop come to be?
It all started when Julian Dolby (IBM Research) was giving a talk about WALA (The T. J. Watson Libraries for Analysis) at the Static Analysis Seminar taught by Karim Ali. After the talk, Karim, Julian, and Eric Bodden (now at Paderborn University & Fraunhofer IEM) were commiserating on some aspects of the code analysis frameworks they have been using over the years, and thinking about how their ideal framework would look like. We then reached out to Yannis Smaragdakis (University of Athens) and many other researchers in the community to discuss the idea of organizing an event where we have informal talks to highlight what has worked well and the lessons that we could learn from each other. And that event came to be DECAF!
Who should submit to your workshop?
We invite those of us who build core static analysis infrastructure to present core ideas and lessons learnt from their systems.
Do you primarily cater towards researchers, towards practitioners, or both?
Whether you are working in industry or academia, we believe that there are many experiences out there to learn from, and we would love to hear about them from you.
What’s the planned format?
The workshop will mainly consist of talks by participants. We will end the day with an open discussion to highlight the main points that have been discussed during the workshop and how we can put some of those ideas into action to advance the current status of static analysis infrastructure.
Find more interviews behind the link.