Newsletter 86
June 30, 2003

* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
  can be found at

  FLOPS 2004 - Call for Papers
  LPNMR-7 - Call for Papers
  CAV 2003 - Call for Participation
  TPLP Special Issue on Specification Analysis and Verification
    of Reactive Systems
  PhD studentship, University of Warwick UK

  Nara-Ken New Public Hall, Nara, Japan
  April 7-9, 2004
  Call for Papers
* The symposium is a forum for research on all issues concerning
  functional programming and logic programming.  In particular, it wants
  to stimulate the cross-fertilization as well as integration of the two
  paradigms.  The symposium takes place about every 1.5 years in Japan.
  Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village
  (1996), Kyoto(1998), Tsukuba (1999), Tokyo (2001) and Aizu (2002).
* The following three distinguished researchers have accepted to give
  invited talks at FLOPS 2004: Masami Hagiya (University of Tokyo);
  Carsten Schuermann (Yale University); Peter Selinger (University of Ottawa).
* Submissions must be unpublished and not submitted for publication
  elsewhere. Work that already appeared in unpublished or informally
  published workshops proceedings may be submitted.  Submissions
  should fall into one of the following categories: (i) regular research
  papers, these should describe new results and will be judged on
  originality, correctness and significance; (ii) system descriptions;
  these should contain a link to a working system and will be judged on
  originality, usefulness and design.
  All submissions must be written in English and can be up to 15
  proceedings pages long. Authors are strongly encouraged to use LaTeX2e
  and the Springer llncs class file.
* Submission Deadline: October 1, 2003.

  Call for Papers
  Ft. Lauderdale, USA, January 6 - 8, 2004
* Theme. LPNMR is a forum for exchanging ideas on declarative logic
  programming, nonmonotonic reasoning and knowledge representation. In the
  1980s researchers working in the area of nonmonotonic reasoning discovered
  that their formalisms could be used to describe the behavior of negation
  as failure in Prolog, and the first LPNMR conference was convened in
  1991 for the purpose of discussing this relationship.  This work has led
  to the creation of logic programming systems of a new kind - answer set
  solvers, and to the emergence of a new approach to solving combinatorial
  search problems, called answer set programming.  The aim of the
  conference is to facilitate interactions between researchers interested
  in the design and implementation of such declarative logic programming
  representation and nonmonotonic reasoning.
* Submission.  Max. 13 pages in Springer LNCS style. Paper submission is
  electronic via the conference home page
* Submission Deadline. July 22, 2003
* Program Co-Chairs. V. Lifschitz, I. Niemela
* Program Committee. J. Alferes, C. Baral, Y. Dimopoulos, J. Dix, P. M. Dung,
  E. Erdem, M. Gelfond, T. Janhunen, J. Lobo, F. Lin, R. Otero, V. Marek,
  G. Pfeifer, E. Pontelli, T. Przymusinski, C. Sakama, T. C. Son, H. Turner,
  D. Warren, J.-H. You

  Boulder, Colorado, USA
  July 8-12, 2003
  Call for Participation
* CAV 2003 is the 15th Computer-Aided Verification conference.
  The conference will start with one day of tutorials, and
  will be followed by five satellite events that relate to
  computer-aided verification.

* This special issue is inspired to the homonymous ICLP workshops that
  took place during iclp 2001 and iclp 2002. Nevertheless, submission is
  open to everyone.
* Deadline for submission: November 15, 2003
* Editors: Giorgio Delzanno (University of Genova), Sandro Etalle
  (University of Twente and CWI Amsterdam), Maurizio Gabbrielli (University
  of Bologna).

  Scalable Software Model Checking Based on Game Semantics
  Department of Computer Science, University of Warwick, UK
* A three-year PhD studentship funded by the Engineering and Physical
  Sciences Research Council is available from October 2003.  It covers
  academic fees, and living expenses at the following rates: GBP 9,000
  (2003/04), GBP 10,500 (2004/05), GBP 12,000 (2005/06).
* Project summary: Model checking has been a highly successful approach
  to verification of hardware and protocols.  Recently, model
  checking of software has become an active and important
  area of research and application.  In contrast to hardware
  and protocols, software is often highly structured, and contains
  objects, higher-order computation, complex control mechanisms, pointers,
  concurrency, and other features.  Although impressive tools have been built,
  a number of substantial challenges remain for software model checking.
  One of the main breakthroughs in theoretical computer science in the past
  decade has been the development of game semantics, which has produced
  the first accurate models for a variety of programming languages and
  logical systems.  Founding software model checking on game semantics has
  the potential to overcome most of the remaining challenges, because
  the models are compositional in the style of denotational semantics,
  yet have clear operational content.
  We propose contributions to theory and practice of the novel research
  direction of software model checking based on game semantics.  Our main goal
  is to enable compositional verification of programs and specifications which
  contain large, polymorphic or infinite data types.  This has not been
  addressed so far, but is necessary for the approach to scale to industrial
* The studentship will be supervised by Dr R Lazic, within the Theory and
  Practice of Programming research group led by Prof D Peled.
* Collaboration is planned with the Foundations of Computation research group
  at Oxford, and with Formal Systems (Europe) Ltd.
* Requirements and application:
  You should have at least a II.1 degree in Computer Science or Mathematics,
  or equivalent.  You need to have experience of at least one of:
  semantics of programming languages; automata theory; process algebra;
  category theory.
* Further information is available at:
* Informal enquiries by e-mail are welcome:
* You can apply on-line, stating the project title in Question 13:
* Closing date: 11 July 2003.

Back to the LICS web page.