BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Layered Fixed Point Logic - Piotr Filipiuk\, Technical University 
 of Denmark (DTU)
DTSTART:20120120T140000Z
DTEND:20120120T150000Z
UID:TALK35476@talks.cam.ac.uk
CONTACT:Bjarki Holm
DESCRIPTION:We present a logic for the specification of static analysis pr
 oblems that goes beyond the logics traditionally used. Its most prominent 
 feature is the direct support for both inductive computations of behaviors
  as well as co-inductive specifications of properties. Two main theoretica
 l contributions are a Moore Family result and a parametrized worst case ti
 me complexity result. We show that the logic and the associated solver can
  be used for rapid prototyping and illustrate a wide variety of applicatio
 ns within Static Analysis\, Constraint Satisfaction Problems and Model Che
 cking. In all cases the complexity result specializes to the worst case ti
 me complexity of the classical methods. 
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR