Difference between revisions of "WG211/M3Kamin"
m (1 revision) |
|||
| Line 2: | Line 2: | ||
| − | + | Sam Kamin | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Title: | Title: | ||
Partial evaluation of static analyses for programs with holes | Partial evaluation of static analyses for programs with holes | ||
| − | + | ||
| − | + | Speaker: Sam Kamin | |
| − | Slides: [[ | + | |
| − | + | Slides: [[Media:talk.ppt |talk.ppt]] | |
| − | Abstract: | + | |
| + | Abstract: | ||
| + | |||
Suppose we are given a program with holes. Another program (a "plug") is to fill the hole at run time. Once the hole is plugged and a complete program obtained, we would like to perform some static analysis. Can we statically perform a partial analysis on the program and the plug so that the analysis can be completed more quickly than if we had to do it from scratch? Defining analyses compositionally makes it easier to address this question, and we discuss a compositional framework for static analyses. We define several analyses within this framework, and we give experimental results showing the potential benefits of the approach. | Suppose we are given a program with holes. Another program (a "plug") is to fill the hole at run time. Once the hole is plugged and a complete program obtained, we would like to perform some static analysis. Can we statically perform a partial analysis on the program and the plug so that the analysis can be completed more quickly than if we had to do it from scratch? Defining analyses compositionally makes it easier to address this question, and we discuss a compositional framework for static analyses. We define several analyses within this framework, and we give experimental results showing the potential benefits of the approach. | ||
| − | |||
| − | |||
| − | |||
Latest revision as of 14:32, 16 December 2011
Sam Kamin
Title: Partial evaluation of static analyses for programs with holes
Speaker: Sam Kamin
Slides: talk.ppt
Abstract:
Suppose we are given a program with holes. Another program (a "plug") is to fill the hole at run time. Once the hole is plugged and a complete program obtained, we would like to perform some static analysis. Can we statically perform a partial analysis on the program and the plug so that the analysis can be completed more quickly than if we had to do it from scratch? Defining analyses compositionally makes it easier to address this question, and we discuss a compositional framework for static analyses. We define several analyses within this framework, and we give experimental results showing the potential benefits of the approach.
