Tuesday, July 8, 2003 8:00 - 9:00 Breakfast and Registration 8:45 - 9:00 Welcoming Remarks by Melvin Janowitz (DIMACS) Jonathan Farley, Jimmie Lawson, and Michael Mislove SESSION ON SECURITY Session chair: Melvin Janowitz 9:00 - 9:55 PLENARY TALK 1: A Decidable Class of Security Protocols Joshua Guttman, Mitre 10:00 - 10:35 Applications of Lattices to Computer Security Catherine Meadows, Naval Research Laboratory 10:40 - 11:10 BREAK Session chair: Jonathan Farley 11:10 - 11:45 Event-based Methods for Security Protocols Federico Crazzolara, NEC Europe, C&C Research Laboratories 11:50 - 12:25 Secret Sharing Schemes Realizing Access Hierarchies Stefan Schmidt, New Mexico State University 12:25 - 2:00 Lunch SESSION ON KLEENE ALGEBRAS Session chair: Mel Fitting 2:00 - 2:55 PLENARY TALK 2: Dexter Kozen, Cornell 3:00 - 3:35 The Theory of Fixed Points and Galois Connections Applied to Language-Processing Problems Roland Backhouse, University of Nottingham 3:35 - 4:05 BREAK Session chair: Joshua Guttman 4:05 - 4:40 Modal Kleene Algebra Bernhard Moeller, University of Augsburg 4:45 - 5:20 Some Open Problems in Kleene and Omega Algebras Ernie Cohen, Microsoft 5:25 - 6:00 A Calculus for Set-Based Program Development Georg Struth, University of Augsburg 7:00 Reception and Dinner at the Hotel Wednesday, July 9, 2003 8:30 - 9:00 Breakfast and Registration SESSION ON QUANTUM COMPUTING Session chair: Jimmie Lawson 9:00 - 9:55 PLENARY TALK 3: Domains and Interaction Samson Abramsky, Oxford University 10:00 - 10:35 Probability as Order Bob Coecke, Oxford 10:35 - 11:05 BREAK 11:05 - 11:40 Physics and Domain Theory Keye Martin, Oxford University 11:45 - 1:15 LUNCH SESSION ON LOGIC PROGRAMMING Session chair: Dexter Kozen 1:15 - 2:10 PLENARY TALK 4: Bilattices Melvin Fitting, City University of New York 2:15 - 2:50 Ultimate Approximations of Lattice Operators and Their Applications in Knowledge Representation Miroslaw Truszczynski and Victor W. Marek, Kentucky University Marc Denecker, K.U.Leuven 2:50 - 3:20 BREAK Session chair: Michael Mislove 3:20 - 3:55 Precedence-Inclusion Patterns and Relational Learning Frank Oles, IBM 4:00 - 4:35 Sequents, Lattices, and Logic Programming Guo-Qiang Zhang, Case Western Reserve University 4:40 - 5:15 A General View of Approximation Ales Pultr, Charles University, B. Banaschewski Thursday, July 10, 2003 8:30 - 9:00 Breakfast and Registration SESSION ON MODEL CHECKING Session chair: Samson Abramsky 9:00 - 9:55 PLENARY TALK 5: Partial-Order Methods for Model Checking Patrice Godefroid, Bell Laboratories 10:00 - 10:35 Lattices in Multi-Valued Model Checking Glenn Bruns, Bell Laboratories 10:35 - 11:00 BREAK 11:00 - 11:35 Consistent Partial Model Checking Michael Huth, Imperial and Shekhar Pradan 11:35 - 12:55 LUNCH INVITED SPEAKERS SESSION Session Chair: Michael Huth 12:55 - 1:30 Two Notions of Universality Considered for Bounded Lattices and Kleene Algebras Mick Adams, SUNY 1:35 - 2:10 The Visualization of Weighted Lattices for Data Representation Alex Pogel, New Mexico State University Tim Hannan and Lance Miller 2:15 - 2:45 BREAK Session Chair: Mick Adams 2:45 - 3:20 Posets, Lattices and Computer Science George Markowsky, University of Maine 3:25 - 4:00 Minimal bicompletions Dusko Pavlovic, Kestrel Institute 4:05 - 4:40 Universality and Language Inclusion for Open and Closed Timed Automata James Worrell, Tulane University 4:45 - 5:20 Implementing Operations on Set Covers via Lattice Algebra Deborah S. Franzblau, CUNY/College of Staten Island 5:20 - 5:30 CLOSING REMARKS and FAREWELL