BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Explicit vs. symbolic algorithms for solving ALFP constraints - Pi
 otr Filipiuk -  Technical University of Denmark
DTSTART:20120207T130000Z
DTEND:20120207T140000Z
UID:TALK35574@talks.cam.ac.uk
CONTACT:William Denman
DESCRIPTION:ALFP\, Alternation-free Least Fixed Point logic\, has successf
 ully been used as an intermediate language in the implementation of static
  analysis and model checking problems. Clearly different analysis problems
  may give rise to ALFP clauses with different characteristics. There are a
 lso different approaches to solving ALFP clauses and some of those are bet
 ter suited for certain kinds of clauses than others. The aim of this talk 
 is to present two algorithms\, one that is based on differential worklists
  and one based on BDD's\, and experiment with them.
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR