Hide search tips...
- The wildcard * means "match zero or more characters" and may only be used at the end of a word.
- The wildcard ? means "match exactly one character" and cannot be used as the first character of a word.
- To search for a phrase in a document, use double-quotes to delimit your search terms -- for example, "search phrase".
- Find out more information about searching.
[Sy-cg-global] [Publicity-list] DIMACS Workshop on Applications of Lattices and Ordered Sets to Computer Science
Linda Casals
lindac at dimacs.rutgers.edu
Wed Jun 25 15:09:37 EDT 2003
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 at dimacs.rutgers.edu
Jimmie Lawson, Louisiana State University, lawson at math.lsu.edu
Michael Mislove, Tulane University, mwm at math.tulane.edu
Presented under the auspices of the DIMACS Special Focus
on Mathematics and the Foundations of Computer & Information Science.
Further information see:
http://dimacs.rutgers.edu/Workshops/Lattices/
**********************************************************************
Lattices and ordered sets play an important role in many areas of
computer science. These range from lattices as models for logics,
which are fundamental to understanding computation, to the ordered
sets as models for computation, to the role both lattices and ordered
sets play in combinatorics, a fundamental aspect of computation. In
addition, many applications utilize lattices and ordered sets in
fundamental ways. These include such areas as knowledge
representation, text categorization and data mining, where order plays
a fundamental organizing principle, to the use of lattices and ordered
sets to analyze crypto-protocols in security, to inductive logic
programming, where ordered sets form basic models. A number of more
esoteric structures, such as Kleene algebras and quantales, also
feature in recent advances to understanding computation. This workshop
will bring researchers from the many areas which rely on lattices and
ordered sets together with those doing research in these and related
structures, in order to accomplish two goals:
1) to survey the many areas of computation where lattices and ordered
sets play a role in order to better understand the problems common
across these areas, and
2) to enhance the interactions between researchers in the areas of
lattice theory and ordered sets, and those who utilize these
structures in modeling computation and in areas of application.
It is expected that researchers in lattice theory and ordered sets
will benefit by discovering new and interesting problems where their
expertise can be applied, and those who work on applications will have
a chance to learn of new advances in these areas that could be applied
to problems where lattice theory and ordered sets traditionally have
played an important role. In addition to these goals, the intention
also is to present talks which are accessible to the broader public
that will help those working in related areas to understand the role
lattice theory and ordered sets play in theoretical computation and
its applications.
The workshop will feature several plenary lectures, whose goal will be
to give a broad background to the workshop, These lectures will be
complimented by several shorter talks that focus on particular areas
of application, as well as on recent advances in lattice theory and
ordered sets. The talks by leaders in lattice theory and ordered sets
will focus on applications to computer science, while the talks by
leading researchers in these areas will describe how techniques from
lattice theory and ordered sets have recently led to results and
applications to problems in computation.
**********************************************************************
Workshop Program:
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
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, Oxford University
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
*************************************************************************
Registration Fees:
(Pre-registration deadline: June 23, 2003)
Regular rate
Preregister before deadline $120/day
After preregistration deadline $140/day
Reduced Rate*
Preregister before deadline $60/day
After preregistration deadline $70/day
Postdocs
Preregister before deadline $10/day
After preregistration deadline $15/day
DIMACS Postdocs $0
Non-Local Graduate & Undergraduate students
Preregister before deadline $5/day
After preregistration deadline $10/day
Local Graduate & Undergraduate students $0
(Rutgers & Princeton)
DIMACS partner institution employees** $0
DIMACS long-term visitors*** $0
Registration fee to be collected on site, cash, check, VISA/Mastercard
accepted.
Our funding agencies require that we charge a registration fee for the
workshop. Registration fees cover participation in the workshop, all
workshop materials, breakfast, lunch, breaks, and any scheduled social
events (if applicable).
* College/University faculty and employees of non-profit organizations
will automatically receive the reduced rate. Other participants may
apply for a reduction of fees. They should email their request for the
reduced fee to the Workshop Coordinator at
workshop at dimacs.rutgers.edu. Include your name, the Institution you
work for, your job title and a brief explanation of your situation.
All requests for reduced rates must be received before the
preregistration deadline. You will promptly be notified as to the
decision about it.
** Fees for employees of DIMACS partner institutions are waived.
DIMACS partner institutions are: Rutgers University, Princeton
University, AT&T Labs - Research, Bell Labs, NEC Laboratories America
and Telcordia Technologies. Fees for employees of DIMACS affiliate
members Avaya Labs, IBM Research and Microsoft Research are also
waived.
***DIMACS long-term visitors who are in residence at DIMACS for two or
more weeks inclusive of dates of workshop.
***************************************************************
Information on participation, registration, accommodations, and travel
can be found at:
http://dimacs.rutgers.edu/Workshops/Lattices/
**PLEASE BE SURE TO PRE-REGISTER EARLY**
***************************************************************
More information about the Dimacs-sy-cg-global
mailing list
Show search tips...