Subject: Semantics Seminar Schedule
From: wand@ccs.neu.edu
Date: Mon Nov 12 2001 - 00:05:01 EST
NU Programming Languages Seminar
Wednesday, November 14, 2001, 10:30-12:30
149 Cullinane Hall, Northeastern University
(building 9 on the map at http://www.neu.edu/maps/maps.html)
Philippe Meunier
Selector-based Versus Conditional-constraint-based Data-flow Analysis
of Programs
Static analysis of programs encompasses a whole set of techniques used
during many stages of the software development process, from compiler
optimization, to debugging, to security analysis. One important such
technique is data-flow analysis, to compute the set of values each
expression in a program might evaluate to.
In this talk, I will first describe the set-based analysis used by
MrSpidey, the old PLT/DrScheme static debugger, and how this analysis
uses selectors to simulate the flow of values in a program. I will
show why selectors are not adequate enough when trying to analyze
language constructs such as case-lambda functions with rest arguments,
show how selectors can then be extended with annotations to improve
the analysis, and explain why adding annotations is, in the end, not
desirable. I will then describe a conditional-constraint-based
analysis, explain how it can compute results at least as good as the
ones computed by the old analysis, and present experimental data
showing why this analysis is preferable to the old one. Finally, I
will discuss some implementation issues encountered while implementing
the new analysis for R5RS Scheme, for the new, upcoming, version of
DrScheme.
Upcoming presentations:
11/21 no meeting
11/28 Doug Orleans
Most meetings will be 1030-1230 in 306 EG.
This archive was generated by hypermail 2b28 : Mon Nov 12 2001 - 00:05:43 EST