Source code patches from dynamic analysis
Dynamic analysis can identify improvements to programs that cannot feasibly be identified by static analysis; concurrency improvements are a motivating example. However, mapping these dynamic-analysis-based improvements back to patch-like source-code changes is non-trivial. We describe a system, Scopda, for generating source-code patches for improvements identified by execution-trace-based dynamic analysis. Scopda uses a graph-based static program representation (abstract program graph, APG), containing inter-procedural control flow and local data flow information, to analyse and transform static source-code. We demonstrate Scopda’s ability to generate sensible source code patches for Java programs, though it is fundamentally language agnostic.
Tue 13 JulDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
14:00 - 16:35 | |||
14:00 5mTalk | Welcome FTfJP | ||
14:05 30mTalk | Refactoring traces to identify concurrency improvements FTfJP | ||
14:35 30mTalk | A Generic Type System for Featherweight Java FTfJP | ||
15:05 30mTalk | Source code patches from dynamic analysis FTfJP | ||
15:35 30mTalk | Reconstructing Z3 Proofs in KeY: There and Back Again FTfJP P: Wolfram Pfeifer Karlsruhe Institute of Technology (KIT), Jonas Schiffl , Mattias Ulbrich Karlsruhe Institute of Technology File Attached | ||
16:05 30mTalk | Using Dafny to Solve the VerifyThis 2021 Challenges FTfJP P: Marie Farrell University of Liverpool, Rosemary Monahan National University of Ireland, A: Conor Reynolds Maynooth University |