Clipping: A semantics-directed syntactic approximation

Add to your list(s) Download to your calendar using vCal

• Dan Ghica
• Tuesday 10 November 2009, 13:00-14:00
• CS 217.

If you have a question about this talk, please contact Dan Ghica.

I will present a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for a given programming language. Like slicing, clipping reduces the size of the source code in preparation for automatic verification; but unlike slicing it is an imprecise but computationally inexpensive algorithm which does not require a whole-program analysis. The technique of clipping can be framed into an iterated refinement cycle to arbitrarily improve its precision.

[LICS 09 paper with A. Bakewell]

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Lab Lunch
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.