Newsletter 73
April 27, 2001
*******************************************************************
* Past issues of the newsletter are available at
http://logik.mathematik.uni-freiburg.de/lics/newsletters/
http://www.math.uic.edu/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
can be found at
http://logik.mathematik.uni-freiburg.de/lics/newsletters/inst.html
http://www.math.uic.edu/lics/newsletters/inst.html
********************************************************************
TABLE OF CONTENTS
* Calls for Papers
Partial Evaluation and Semantic-Based Program Manipulation
Foundations of Software Technology and Theoretical Computer Science
* Book Announcements
Handbook of Process Algebra,
edited by J.A. Bergstra, A. Ponse and S.A. Smolka
A Fascinating Country in the World of Computing
by L.Wos and G.W. Pieper
The Collected Works of Larry Wos by L. Wos with G.W. Pieper
* Position Announcement
Research Assistant at TU Munich
* Miscellaneous
UNIF 2001 Junior Researcher Travel Award
ACM SIGPLAN WORKSHOP ON PARTIAL
EVALUATION AND SEMANTICS-BASED PROGRAM MANIPULATION (PEPM'02)
Call for Papers
Portland, Oregon, USA
January 14-15, 2002 (co-located with POPL'02)
http://www.informatik.uni-freiburg.de/~thiemann/pepm02
* Theme. The PEPM'02 workshop will bring together researchers working in
the areas of semantics-based program manipulation and partial evaluation.
The workshop focuses on theory and practice for the analysis
and manipulation of programs. Technical topics include, but are not
limited to program manipulation techniques, program analysis
techniques, programs as data objects, and applications.
* Submission is done electronically via the workshop
Web-page. Exceptionally, submissions may be emailed to the program
chair: thiemann@informatik.uni-freiburg.de
* Submission deadline: 8 October 2001.
* Program committee. Maria Alpuente, Evelyn Duesterwald, Robert Glück,
Michael Hanus, Zhenjiang Hu, John Hughes, Mark Jones, Siau-Cheng
Khoo, Jakob Rehof, João Saraiva, Ulrik Schultz, Peter Thiemann
(chair), David Walker.
21st FOUNDATIONS OF SOFTWARE TECHNOLOGY
AND THEORETICAL COMPUTER SCIENCE CONFERENCE
Call for Papers
December 13--15, 2001
Indian Institute of Science, Bangalore, India
http://www.fsttcs.org/
* The FSTTCS conference is a forum for presenting original results in
foundational aspects of Computer Science and Software
Technology. Authors are invited to submit papers presenting original
and unpublished research on any theoretical aspect of Computer
Science. Papers with a strong foundational emphasis are also welcome
in applied areas such as engineering of algorithms, programming
language design and verification techniques.
* Representative areas include, but are not limited to: Automata,
Languages and Computability, Automated Reasoning, Rewrite Systems,
and Applications, Combinatorial Optimization, Computational
Geometry, Computational Biology, Complexity Theory, Concurrent,
Real-time and Hybrid Systems, Cryptography and Security Protocols,
Database Theory and Information Retrieval, Graph and Network
Algorithms, Logic, Proof Theory, Model Theory and Applications,
Logics of Programs and Modal Logics, New Models of Computation,
Parallel and Distributed Computing, Randomized and Approximation
Algorithms, Semantics of Programming Languages, Software
Specification and Verification, Static Analysis and Type Systems,
Theory of Functional and Constraint-based Programming,
* Important Dates
Deadline for Submission: 31 May 2001
Notification to Authors: 15 August 2001
Final Version of Accepted Papers due on: 15 September 2001
* Program Committee: S. Arun-Kumar (IIT, Delhi), Julian Bradfield
(Edinburgh), Harry Buhrman (CWI), Gautam Das (Microsoft Res), Anuj
Dawar (Cambridge), Alan Frieze (CMU), Naveen Garg (IIT, Delhi),
Ramesh Hariharan (IISc) (Co-Chair), Oded Maler (Verimag), Peter Bro
Miltersen (BRICS, Aarhus), Madhavan Mukund (CMI), (Co-Chair),
Paritosh Pandya (TIFR), Sanjiva Prasad (IIT, Delhi), Jaikumar
Radhakrishnan (TIFR), Uday Reddy (Birmingham), Natarajan Shankar
(SRI), Aravind Srinivasan (Bell Labs), Madhu Sudan (MIT), Amnon
Ta-Shma (Tel-Aviv), V. Vinay (IISc) (Co-Chair), Pascal Weil
(Bordeaux), Thomas Wilke (Kiel), D. Williamson (IBM, Almaden),
BOOK ANNOUNCEMENT
Handbook of Process Algebra
Edited by Jan A. Bergstra, Alban Ponse and Scott A. Smolka
Elsevier (North-Holland)
http://www.science.uva.nl/~alban/Handbook-free/
* Process Algebra is a formal description technique for complex
computer systems, especially those involving communicating,
concurrently executing components. It is a subject that touches many
topic areas of computer science and discrete math, including system
design notations, logic, concurrency theory, specification and
verification, operational semantics, algorithms, complexity theory,
and, of course, algebra. This Handbook documents the fate of process
algebra since its inception in the late 1970's to the present. It is
intended to serve as a reference source for researchers, students,
and system designers and engineers interested in either the theory
of process algebra or in learning what process algebra brings to the
table as a formal system description and verification technique.
* The Handbook is divided into six parts spanning a total of 19
self-contained chapters. The organization is as follows. Part 1,
consisting of four chapters, covers a broad swath of the basic
theory of process algebra. Part 2 contains two chapters devoted to
the sub-specialization of process algebra known as finite-state
processes, while the three chapters of Part 3 look at infinite-state
processes, value-passing processes and mobile processes in
particular. Part 4, also three chapters in length, explores several
extensions to process algebra including real-time, probability and
priority. The four chapters of Part 5 examine non-interleaving
process algebras, while Part 6's three chapters address
process-algebra tools and applications.
BOOK ANNOUNCEMENT
A Fascinating Country in the World of Computing
Larry Wos and Gail W. Pieper
World Scientific, 1999, ISBN 981-02-3910-6
586 pages
http://www.mcs.anl.gov/~pieper/twobooks.html
* This book shows you -- through examples and puzzles and
intriguing questions -- how to make your computer reason logically.
To help you, the book includes a CD-ROM with OTTER, one of the most
powerful general-purpose reasoning system. The automation of reasoning
has advanced markedly in the past few decades, and this book discusses
some of the remarkable successes that automated reasoning
programs have had in tackling challenging problems in mathematics, logic,
program verification, and circuit design. Because the intended audience
includes students and teachers, the book presents many exercises
(with hints and also answers), as well as tutorial chapters that gently
introduce readers to the field of logic and to automated reasoning.
For more advanced researchers, the book presents challenging questions,
many of which are still unsolved.
* Ordering information: See the Web site
BOOK ANNOUNCEMENT
The Collected Works of Larry Wos
Larry Wos with Gail W. Pieper
World Scientific, 2000, ISBN 981-02-4001 (2-vol. set)
approx. 1600 pages
http://www-unix.mcs.anl.gov/~pieper/twobooks.html
* Automated reasoning programs are successfully tackling challenging
problems in mathematics and logic, program verification, and circuit
design. This two-volume book includes all the published papers of
Dr. Larry Wos, one of the world's pioneers in automated reasoning.
* The book has the following special features: (1) It presents the
strategies that have made automated reasoning a practical tool for
solving deep problems in mathematics and logic. (2) It provides a
history of the field. (3) It includes a CD-ROM, with a searchable
index of all the papers.
* Ordering information: See the Web site
RESEARCH ASSISTANT / PHD VACANCY: TOOL SUPPORT FOR LOGICAL CALCULI
Technical University Munich
http://www4.in.tum.de/~kleing/group/group.html
* The theorem proving group at the Technical University Munich is
looking for a research assistant to join a DFG-funded project
focussing on the development and application of the theorem prover
Isabelle (http://isabelle.in.tum.de). The appointment is initially
for 2 years with an optional extension.
* We seek a candidate with a strong background in one of the following areas:
theorem proving, logic, semantics of programming languages,
functional/logic programming, specification languages
who should like to work on the boundary between theory and practice.
Depending on the candidates interests, the work will focus on of the
following topics:
- logical calculi for the development of (object oriented) programs
- structuring mechanisms for large theories
- tool support for automated reasoning
* Informal inquiries and formal applications should be addressed to
nipkow@in.tum.de (http://www.in.tum.de/~nipkow).
UNIF 2001 JUNIOR RESEARCHER TRAVEL AWARD
* The award is intended to cover much of the expenses for up to four
university students or post-docs working in the field of unification
to attend UNIF 2001, which will be held in Siena, Italy, June 18-19,
2001. Each winner will be reimbursed (to a maximum of US $1,000) for
his or her workshop registration, transportation, and accommodation
expenses.
* Application and recommendation letters should be sent by e-mail to
unif2001@cs.uiowa.edu no later than April 15, 2001.
* Please consult http://goedel.cs.uiowa.edu/unif2001/ .
Back to the LICS web page.