DIMACS Workshop on Applications of Lattices and Ordered Sets to Computer Science

July 8 - 10, 2003
DIMACS Center, CoRE Building, Rutgers University

Organizers:

Jonathan Farley, Massachusetts Institute of Technology

Mel Janowitz, DIMACS / Rutgers University, melj@dimacs.rutgers.edu

Jimmie Lawson, Louisiana State Univeristy, lawson@math.lsu.edu

Michael Mislove, Tulane University, mwm@math.tulane.edu

• Mick Adams, SUNY at New Paltz
  Two Notions of Universality Considered for
  Bounded Lattices and Kleene Algebras

• Roland Backhouse, University of Nottingham
  Language-Processing Problems

• Bob Coecke, Oxford University
  Probability As Order

• Federico Crazzolara, NEC Europe, C&C Research Laboratories
  Event-based Methods for Security Protocols

• Melvin Fitting, City University of New York
  Bilattices

• Patrice Godefroid, Bell Laboratories, Lucent Technologies
  Partial-Order Methods for Model Checking

• Michael Huth, Imperial College
  Consistent Partial Model Checking
  Consistent Partial Model Checking(Condensed Version)

• Dexter Kozen, Cornell University
  Representation of Kleene Algebra with Tests

• George Markowsky, University of Maine
  Posets, Lattices and Computer Science

• Catherine Meadows, US Naval Research Laboratory
  Applications of Lattices to Computer Security

• Bernhard Moeller, University of Augsburg
  Modal Kleene Algebra

• Frank Oles, IBM
  Precedence-Inclusion Patterns and Relational Learning

• Alex Pogel, New Mexico State University
  Visualization of Weighted Lattices
  for Data Analysis

• Ales Pultr, Charles University
  A General View of Approximation

• Georg Struth, University of Augsburg
  A Calculus for Set-Based Program Development

• Miroslaw Truszczynski, Kentucky University
  Ultimate Approximations of Lattice Operators and Their
  Applications in Knowledge Representation

• Guo-Qiang Zhang, Case Western Reserve University
  Topology, Lattices, and Logic Programming

Next: Call for Participation

Workshop Index

DIMACS Homepage