LICS Newsletter 52

Newsletter 52

May 20, 1998


[Past issues of the newsletter are available at
 http://www.bell-labs.com/topic/conferences/lics/ 

The following item was inadvertently left out when the newsletter
was sent to the mailing list:

CAV'98 Tutorials on Formal Verification
  June 28, 1998, preceding the CAV'98 conference
  University of British Columbia, Vancouver, Canada
* Tutorials. Model Checking for Beginners:  A Tutorial Introduction to
  Finite-State Verification (Bob Kurshan, Ken McMillan); 
  Synchronous Programming of Reactive Systems (Nicolas Halbwachs);
  Ten Years of Partial Order Reduction (Doron Peled).
* These tutorials are included in the conference registration fee. 
  For more information, see the URL above. 


Below is the newsletter that was sent to the mailing list:

BOOK ANNOUNCEMENT
  Programming with Constraints: an Introduction
  Kim Marriott and Peter J. Stuckey
  MIT Press, Cambridge, U.S.A. 1998
  ISBN: 0-262-13341-5 
* The job of the constraint programmer is to use mathematical
  constraints to model real world constraints and objects. This book,
  provides the first comprehensive introduction to the discipline of
  constraint programming and, in particular, constraint logic
  programming. The book covers the necessary background material from
  artificial intelligence, logic programming, operations research, and
  mathematical programming. Topics discussed range from
  constraint-solving techniques to programming methodologies for
  constraint programming languages. Because there is not yet a
  universally used syntax for constraint logic programming languages,
  the authors present the programs in a way that is independent of any
  existing programming language. Practical exercises cover how to use
  the book with a number of existing constraint languages.
* Ordering information: see 
  http://mitpress.mit.edu/book-home.tcl?isbn=0262133415
* Course material is available for use with the book at
  http://www.cs.mu.oz.au/~pjs/book/course.html

WORKSHOP ON APPLICATIONS OF CATEGORY THEORY TO COMPUTER SCIENCE
  June 8-12, 1998
  Mount Allison University, Sackville, New Brunswick, Canada
* In conjunction with the Category Theory Session at the Canadian
  Mathematical Society's Summer 1998 Meeting, there will be a workshop
  on the Applications of Category Theory to Computer Science, directed
  towards graduate students and young researchers. On the evening of
  Friday June 12 the Workshop participants will receive free
  transportation to Saint John, New Brunswick, site of the
  aforementioned Category Theory Symposium.
* Invited instructors. M. Barr (McGill) and R.F.C. Walters (Sydney).
* Registration. There will be a registration fee of $50 for the
  workshop. To preregister send  e-mail to ct95@mscs.dal.ca. 


BOOK ANNOUNCEMENT
  Natural Dualities for the Working Algebraist
  David M. Clark and Brian A. Davey 
  Cambridge University Press, 1998, ISBN 0-521-45415-8
* The theory of natural dualities, as  presented in this text, is broad 
  enough to encompass many known dualities through a rich assortment of 
  substantive theorems, yet concrete enough to be used to generate an 
  array of previously undiscovered dualities. This text will serve as a 
  user manual for algebraists, for category theorists and for those who 
  use algebra in their work, particularly mathematicians and computer 
  scientists interested in non-classical logics. It will also give the 
  specialist a complete account of the foundations, leading to the 
  research frontier of this rapidly developing field. As the first text 
  devoted to the theory of Natural Dualities, it provides an efficient 
  path through a large body of results, examples and applications in 
  this subject which is otherwise available only in scattered research 
  papers. To enable the book to be used in courses, each chapter ends 
  with an extensive exercise set. Several fundamental unsolved problems 
  are included.
* Chapter Contents. 1. Dual adjunctions and where to find them; 
  2. Natural dualities; 3. Strong dualities; 4. Examples of strong 
  dualities; 5. Sample applications; 6. What makes a duality useful? 
  7. Piggyback dualities; 8. Optimal dualities and entailment; 
  9. Completeness theorems for entailment; 10. Dualisable algebras; 
  Appendix A. Algebras; Appendix B. Boolean spaces; Bibliography; 
  Notation index; Index.
* Detailed Contents and the Preface may be found at 
  http://www.mcs.newpaltz.edu/~clark
  The Publisher may be contacted at 
  http://www.cup.cam.ac.uk/  [Outside North America]
  http://www.cup.org/        [Within North America]


WORKSHOP ON FORMAL TECHNIQUES FOR HARDWARE AND HARDWARE-LIKE SYSTEMS
  June 19, 1998, Marstrand, Sweden 
  in conjunction with MPC '98, WGP '98, and CMPP '98
* The workshop focusses on formal techniques for the design and
  analysis of hardware and reactive systems. In recent years, formal
  techniques have taken the step from the research laboratory to
  industrial use. The available methods and tools are advancing
  rapidly and are being applied to increasingly complex case
  studies. This workshop aims to present the state of the art in this
  exciting area. The scope of the workshop is broad, ranging from
  theoretical underpinnings to real industrial applications. We aim to
  bring together developers and users of formal techniques. Topics
  include formal approaches to modelling, specification, verification,
  deductive design, of hardware and reactive systems.
* Further information. See the URL above. 


IFIP WORKING CONFERENCE ON PROGRAMMING CONCEPTS AND METHODS (PROCOMET '98)
  June 8-12, 1998
  Shelter Island, New York
  Call for participation
* See the above URL for further details.


THE 1998 ACM SIGPLAN WORKSHOP ON ML
  Call for Papers
  September 26, 1998, Mt. Washington Conference Center
  To be held in conjunction with ICFP'98
* Topics. all ML-related topics including (but not limited to):
  applications, extensions: objects, classes, concurrency; type
  systems: inference, modules, specification, error reporting;
  implementation: compilers, interpreters, partial evaluators, garbage
  collectors; environments: libraries, tools, editors, debuggers;
  semantics.
* Submission. Technical summaries, in English and not to exceed 5000
  words (approximately 10 pages), should be submitted to the program
  chair by Friday, July 10, 1998.  To submit, authors should complete
  the following two steps by the submission deadline.  1. Send an
  email message to ml98@cs.cornell.edu containing the title, authors'
  contact information, and an abstract (not to exceed 200 words) in
  ASCII.  2. Send the technical summary itself.  The summary may be
  sent either electronically to ml98@cs.cornell.edu or via post.  See
  the web page for further details.
* Program Committee.  Dave Berry, Mark Lillibridge, Greg Morrisett
  (chair), John Reppy, Francois Rouaix, Peter Sestoft, Mads Tofte.
* Further info. Send mail to jgm@cs.cornell.edu.


TWO SENIOR LECTURER POSITIONS IN COMPUTING SCIENCE
  Computing Science Department, Uppsala University, Sweden.
* Applications are invited for two new senior lecturerships in 
  computing science at the Faculty of Science and Technology. 
  To be eligible for a lecturership, a candidate must hold a 
  doctoral degree and possess pedagogical skill.
* The applications should be directed to the Vice Chancellor, 
  Uppsala University, Box 256, SE-751 05 UPPSALA, Sweden. 
  Telefax +46 18 4712000.  Closing date: 25 May 1998.  
  If an application is sent by fax, the original should follow 
  as soon as possible.
* For further information, please contact Roland Bol 
  (rolandb@csd.uu.se), phone + 46 18 4717606, fax +46 18 511925.


5th INTERNATIONAL AMAST WORKSHOP ON REAL-TIME AND PROBABILISTIC SYSTEMS
  May 26 - 28, 1999, Bamberg, Germany
  Call for papers  
* Topics. Aspects of real-time and probabilistic systems for the
  workshop include (but are not limited to): Compositional
  construction and verification techniques; Automatic and
  machine-supported verification; Case studies; Formal methods for
  performance analysis; Semantics; Algorithms and tools; Hybrid
  systems.
* Submission.  Submit a paper not exceeding 6000 words, preferably by
  e-mail to arts99@informatik.uni-erlangen.de, before October 30, 1998.
* Program Committee.  Rajeev Alur, Jos Baeten, Christel Baier, Miquel
  Bertran, Antonio Cerone, Rance Cleaveland, Jim Davies, Colin Fidge,
  David de Frutos, Hubert Garavel, Constance Heitmeyer, Tom Henzinger,
  Jane Hillston, Joost-Pieter Katoen, Rom Langerak, Kim G. Larsen,
  Diego Latella, Jonathan Ostroff, Steve Schneider, Roberto Segala,
  Walter Vogler.


WORKSHOP ON FORMAL DESIGN OF SAFETY CRITICAL EMBEDDED SYSTEMS (FEmSys '99)
  March, 15th - 17th, 1999, Munich, Germany 
  First announcement
* Topics. Hybrid modelling & simulation; Objectorientation and
  reactive programming; Synchronous Programming; Distribution of
  Reactive Programs; Modelchecking; Tool certification and code
  validation;
* Tutorial speakers. A. Benveniste, R. Budde, E. Clarke, L. Feijs,
  N. Halbwachs, D. Harel, K. MuellerGlaser, A. Pnueli. 
* Submission.  Any company or university willing to demonstrate a tool
  relevant to the scope of FEmSys, should send a 3-5 pages abstract
  describing the tool.  The abstract should be sent, or preferrably
  mailed in Latex or postscript format before September 30th, 1998, to
  Albert Benveniste, IRISA, Campus de Beaulieu, F 35042 Rennes cedex,
  France, e-mail: Albert.Benveniste@inria.fr.
* Further information. Contact Axel Poigne, GMD - Forschungszentrum
  Informationstechnik GmbH, D-53754 Sankt Augustin, Germany,
  poigne@gmd.de.


WORKSHOP ON PROOF THEORY AND COMPLEXITY
  August 3-7, 1998
  BRICS, University of Aarhus, Denmark
  Call for participation
* Program Committee. C. Butz, S. Cook, U. Kohlenbach, J. Krajicek,
  G. Mints, S. Riis, H. Schwichtenberg and A.S. Troelstra.
* Confirmed speakers.  N. Arai, J. Avigad, A. Beckmann, S. Bellantoni,
  M. L. Bonet, W. Burr, H. de Nivelle, R. Dyckhoff, S. Feferman,
  A. Hendriks, M. Hofmann, J. Hudelmaier, M. Hyland, J. Johannsen,
  D. Leivant, G. Mints, I. Moerdijk, V. Orevkov, C. Pollett,
  A. A. Razborov, H. Schwichtenberg, D. Scott, T. Strahm, G. Takeuti,
  L. Trevisan, J. van Oosten,


ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL99)
  San Antonio, Texas, January 20-22, 1999
* Topics. The 26th symposium on Principles of Programming Languages
  (POPL99) will address fundamental principles and important
  innovations and accomplishments in the design, definition, analysis,
  and implementation of programming languages, programming systems,
  and programming interfaces. Both practical and theoretical papers on
  principles and innovations are welcome, including both frameworks
  for them and reports on experiences with their use.  Papers on a
  diversity of topics are welcomed, particularly ones that point out
  new directions. POPL98 is not limited to topics discussed in
  previous symposia or to formal approaches. In particular, papers
  integrating new principles into mainstream programming languages or
  widely used systems are encouraged. Authors concerned about the
  appropriateness of a topic may communicate by electronic mail with
  the program chair prior to submission.
* Submission. Submissions consist of a 100-200 word ASCII abstract and
  a 5000 words summary. Submissions must be either electronic
  (encouraged) or postal (discouraged). For electronic submissions, a
  mail message with the title and ASCII abstract must be received by
  6:00 AM Pacific Daylight Time, Friday, July 17, 1998. Send the
  message to popl99@cs.berkeley.edu.  Papers must be received by 6:00
  AM Pacific Daylight Time, Friday, July 24, 1998. Send a single
  message to popl99@cs.berkeley.edu. The message should contain both
  the previously submitted title (in ASCII) and the summary, which
  must be Postscript that is interpretable by Ghostscript.
* Program Chair. Alex Aiken (University of California, Berkeley)
* Program Committee.  Martin Abadi, Laurie Hendren, Urs Holzle, Trevor
  Jim, Mark Jones, Simon Peyton Jones, Hanne Riis Nielson, Benjamin
  Pierce, Todd Proebsting, Didier Remy, Jon Riecke, Martin Rinard,
  Scott Smolka, Mads Tofte.