Contributors: Lund University, Profile areas and other strong research environments, Strategic research areas (SRA), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Lunds universitet, Profilområden och andra starka forskningsmiljöer, Strategiska forskningsområden (SFO), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Originator; Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Software Development and Environments, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Programvaruteknik, Originator; Lund University, Faculty of Engineering, LTH, LTH Profile areas, LTH Profile Area: AI and Digitalization, Lunds universitet, Lunds Tekniska Högskola, LTH profilområden, LTH profilområde: AI och digitalisering, Originator; Hedin, Görel; Fors, Niklas; Pop, Adrian
نبذة مختصرة : Source code analysis is ubiquitous in the development of software tools, for example in compilers to detect compile-time errors and possible optimizations, in IDEs to provide interactive coding assistance, and in stand-alone analysis tools to detect bugs. There are several techniques that have been developed to help the analysis developer, including one called Reference Attribute Grammars (RAGs). With RAGs, the developer specifies functionality for their analysis as a set of high level equations. The concern of how to apply the equations is abstracted away, and handled by a RAG evaluation system. This abstraction can enable more concise and efficient implementations, but also calls for adequate debugging tools. When things break down, being able to see how things execute in terms of these abstractions helps the developer identify and fix issues. The aim of this thesis is to provide source code analysis developers with a live, exploratory view of the inner workings of their analyses. We are particularly interested in helping developers using the RAG formalism. In this thesis, we introduce the concept of property probes to support this goal. Property probes enable efficient and robust interaction with computation associated with nodes on abstract syntax trees (ASTs). The different kinds of probes, and associated algorithms for creating and applying them, are presented in this thesis. We also present benchmarks showing that performance scales well for real-world development tasks. We have implemented property probes in a tool called CODEPROBER. CODEPROBER has been integrated into two university courses on compilers and program analysis, as an aid during lab assignments. We wanted to determine the use- and user experience of the students that used it, and to this end we performed a mixedmethod user study with students from the program analysis course. The focus of the study is a set of in-person interviews, and the overall feedback from students has been very positive.
Processing Request
No Comments.