… the development of program analysis tools. However, sometimes the analysis … analysis tasks, and the display of the results generated by the analysis … analysis tools defined using the K framework, a rewriting-based framework …
In Proceedings of the Fourth International Conference on Software Language Engineering (SLE 2011). 2011:… In general, aspect-oriented programs require a whole-program analysis …-oriented programming. We propose some simple modifications to AspectJ that permit modular reasoning. This eliminates the need for whole-program analysis …
Foundations of Aspect Languages, , 2002.… Many problems in program analysis can be expressed naturally and concisely … context-sensitive pointer analysis for large programs. …-to analysis implemented with bddbddb is about twice as fast as a carefully hand-tuned …
aplas 2005: 97-118 [doi]… of analysis problems — groundness analysis of logic programs, and strictness analysis …Many analysis problems can be cast in the form of evaluating minimal models … experimental evidence that the resultant groundness and strictness analysis systems …
PLDI 1996: 117-126… Several program analysis problems can be cast elegantly as a logic program … the changes to the analysis information due to small changes in the input program …-to analysis and evaluating this implementation for analyzing C programs with 10-70K …
ppdp 2005: 117-128 [doi]… , for example, using templates or rewrite rules. We apply dynamic analysis to program … the source of the bug. Our analysis focuses on syntactic language constraints … mechanisms to derive the analysis from the grammar. Moreover, we designed a run-time …
AOSD 2014: 17-20 [doi]… for program analysis through language extensions and the underlying capabilities …
RTA 2007: 246-256 [doi]… Interprocedural analysis concerns the static examination of a program … of interprocedural analysis address the exhaustive version of the problem: summary … the solution of demand versions of interprocedural analysis problems: summary …
deductive 1993: 163-196… Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. In this paper, many-sorted first-order term …
ENTCS, 70(6):100-117, 2002. [doi]… Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in complex analyses like pointer analysis or program slicing. One …
In Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on. 2004: [doi]