The talk announced for 2/20 will be given
instead on Friday 2/21 at 4:00 PM in 1325 CS.
--------------------------------------------------------
Symbolic Implementation of the Best Transformer
Speaker:Thomas Reps, University of Wisconsin
This talk describes how to create, under certain conditions,
abstract-interpretation algorithms that enjoy the best
possible precision for a given abstraction. The key idea is a
simple process of successive approximation that makes
repeated calls to a theorem prover, and obtains the best
abstract value for a set of concrete stores that are
represented symbolically, using a logical formula.
Joint work with Mooly Sagiv and Greta Yorsh.
|
![[Computer Systems Lab]](http://www.cs.wisc.edu/pics/csl_logo.gif){kind=logo}