Program

UNIF 2011 Schedule: 

9.00-10.00 morning session 


INVITED TALK  by Chris Lynch

9:00-10:00 Christopher Lynch Unification in Cryptographic Protocol Analysis


10.00-10.30 coffee break


10.30-12.00 morning session 


10:30-11:00 Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt and Barbara Morawska Computing Local Unifiers in the Description Logic EL without the Top Concept

11:00-11:30 Jan Otop Unification of anti-terms

11:30-12:00 Łukasz Stafiniak Joint Constraint Abduction Problems

12:00-12:30 Wojciech Dzik and Piotr Wojtylak Projective Unifiers in Modal Logics


12.30-14.00 lunch break

------------------------------------------------------------ 

14.00-15.30 afternoon session 

-----------------------------------------------------------

14.00-14.30  Stefan Ciobaca Computing finite variants for subterm convergent rewrite systems

14:30-15:00  Conrad Rau and Manfred Schmidt-Schauss A Unification Algorithm to Compute Overlaps in a Call-by-Need Lambda-Calculus with Variable-Binding Chains

15:00-15:30 Ben Kavanagh and James Cheney Higher-Order Unification for the lambda-alpha-nu calculus 
 

---------------------------------------------------------

15.30-16.00 coffee break

--------------------------------------------------------- 

16.00-17.30 afternoon session 

------------------------------------------------------------------

16:00-16:30 Rakesh Verma and Wei Guo Does Unification Help in Normalization?

16:30-17:00 Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, Jose Meseguer, Paliath Narendran and Ralf Sasse Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis

17:00-17:30 Business meeting 

Comments