Designing a static analysis is generally a substantial undertaking, requiring
significant expertise in both program analysis and the domain of the program
analysis, and significant development resources. As a result, most program
analyses target properties that are universallly of interest (e.g., absence of
null pointer dereference) or nearly so (e.g., deadlock freedom). However, many
interesting program properties that would benefit from static checking are
specific to individual programs, or sometimes programs utilizing a certain
library. It is impractical to devote program analysis and verification experts
to these problems.
We propose instead to work on example-based synthesis of program analyses
within well-understood domains like type qualifier systems and effect systems.
The dynamic behaviors behind the classes of problems these systems prevent
correspond to examples that developers who lack expertise in static analysis
can readily provide (data flow paths, or stack traces).
Metrics
17 Record Views
Details
Title
Synthesizing Program-Specific Static Analyses
Creators
Colin S Gordon
Publication Details
arXiv.org
Resource Type
Preprint
Language
English
Academic Unit
Computer Science (Computing)
Other Identifier
991021868727904721
Research Home Page
Browse by research and academic units
Learn about the ETD submission process at Drexel
Learn about the Libraries’ research data management services