Computer Science Seminar Series: Friday Feb 13, 2004
dvanhorn <[email protected]>
| Newsgroups | gmane.org.ballistichelmet.lambda |
|---|---|
| Message-ID | <[email protected]> |
Title: Path Grammars
Speaker: Dr Craig Damon
Department of Computer Science
University of Vermont
Burlington, VT
05405
cdamon-UYko1UTVIqz2fBVCVOL8/[email protected]
Date: Friday, February 13th, 2004
Time: 3:00 pm - 3:50 pm
Location: 002 Kalkin
Abstract
Describing possible program paths is central to many forms of program
analysis, including compiler optimizations, program understanding and
test coverage metrics. Control flow graphs are the traditional
representation for program paths. Although control flow graphs are well
suited to describing paths within a single procedure, global program
paths present problems for control flow graphs. Path grammars describe
the possible program paths using a traditional context free grammar,
providing both local and global analysis. For local analysis algorithms,
path grammars offer a similarly efficient representation to control flow
graphs. Path grammars can completely replace control flow graphs in
many, if not all, traditional data flow analyses. In addition, path
grammars expose new forms of analysis previously unrecognized using
control flow graphs.
URL: http://www.cs.uvm.edu/seminars/seminar_series.shtml