Write a Blog >>
ECOOP and ISSTA 2021
Sun 11 - Sat 17 July 2021 Online
Tue 13 Jul 2021 15:05 - 15:35 at FTfJP - FTfJP Workshop-1

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 Jul

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

14:00 - 16:35
FTfJP Workshop-1FTfJP at FTfJP
14:00
5m
Talk
Welcome
FTfJP

14:05
30m
Talk
Refactoring traces to identify concurrency improvements
FTfJP
P: Indigo Orton University of Cambridge, UK, Alan Mycroft University of Cambridge, UK
14:35
30m
Talk
A Generic Type System for Featherweight Java
FTfJP
Ulrich Schöpp fortiss GmbH, P: Chuangjie Xu fortiss GmbH
15:05
30m
Talk
Source code patches from dynamic analysis
FTfJP
P: Indigo Orton University of Cambridge, UK, Alan Mycroft University of Cambridge, UK
15:35
30m
Talk
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
30m
Talk
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