Newsletter 104
April 18, 2006
*******************************************************************
* Past issues of the newsletter are available at
http://www.informatik.hu-berlin.de/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
can be found at
http://www.informatik.hu-berlin.de/lics/newsletters/inst.html
* To unsubscribe, send an email with "unsubscribe" in the
subject line to lics@informatik.hu-berlin.de
*******************************************************************
TABLE OF CONTENTS
* BOOK ANNOUNCEMENT
Parameterized Complexity Theory by Jörg Flum and Martin Grohe
* VACANCIES
15 PhD Positions and 1 Postdoc Position at RWTH Aachen
PhD Studentships, Dept. of Computer Science, Univ. of Leicester, UK
European Masters Program in Computational Logic
* CONFERENCES AND WORKSHOPS
LOPSTR 2006 - Deadline Extension
VERIFICATION AND DEBUGGING - Call for Papers
FMCAD 2006 - Call for Papers
CSL 2006 - Call for Papers
DCM 2006 - Call for Papers
LPAR-13 - Call for Papers
WS-FM 2006 - Call for Papers
WRS 2006 - Call for Papers
HOR 2006 - Call for Abstracts
LFMTP 2006 -Call for Papers
STM 2006 - Call for Papers
WST 2006 - Call for Papers
GALOP II - Call for Papers
LaSh-06 - Call for Papers
DISPROVING06 - Call for Papers
HyLo 2006 - Call for Papers
PCC 2006 - Call for Papers
VODCA 2006 - Call for Papers
ICDT 2007 - Call for Papers
LFCS 2007 - Call for Papers
BOOK ANOUNCEMENT:
Parameterized Complexity Theory
by Jörg Flum and Martin Grohe
Springer Verlag 2006, 493 Pages
ISBN: 3540299521
* Parameterized complexity theory is a recent branch of computational
complexity theory that provides a framework for a refined analysis of hard
algorithmic problems. The central notion of the theory, fixed-parameter
tractability, has led to the development of various new algorithmic
techniques and a whole new theory of intractability.
* This book is a state-of-the-art introduction into both algorithmic
techniques for fixed-parameter tractability and the structural theory of
parameterized complexity classes, and it presents detailed proofs of recent
advanced results that have not appeared in book form before. Several
chapters each are devoted to intractability, algorithmic techniques for
designing fixed-parameter tractable algorithms, and bounded fixed-parameter
tractability and subexponential time complexity. The treatment is
comprehensive, and the reader is supported with exercises, notes, a detailed
index, and some background on complexity theory and logic.
* Further information can be found at
http://www2.informatik.hu-berlin.de/~grohe/pub/pkbuch.html
15 PHD POSITIONS AND 1 POSTDOC POSITION AT RWTH AACHEN
For the Research Training Group (Graduiertenkolleg) 1298 AlgoSyn:
"Algorithmic Synthesis of Reactive and Discrete-Continuous Systems"
that is funded by the German Research Council (DFG), 15 Grants for
PhD studentships + 1 Grant for a Postdoc are available.
* The positions can be filled in either 2006 or 2007. First deadline
for applications: April 24, 2006.
* The aim of AlgoSyn is to develop algorithmic synthesis methods for
software and hardware and to push forward the desired integration of
methods. This is realised by a strong cooperation between research
groups in computer science and various engineering disciplines.
* The RTG is divided into four research areas: Algorithmics for agent-
based probabilistic and hybrid systems, formal methods of reactive
systems and game-theoretic methods, software development and modelling
languages, and applications and demonstrators (in the areas: processor
architectures, automatic control, process control engineering, and
train traffic systems).
* For more information about the RTG, research themes, and applications
consult: http://www.algosyn.rwth-aachen.de/
or the director of Algo-Syn: Prof. Dr. W. Thomas, e-mail: thomas@informatik.rwth-aachen.de
PHD STUDENTSHIPS, DEPT. OF COMPUTER SCIENCE, UNIV. OF LEICESTER, UK
http://www.cs.le.ac.uk
* Studentship: Untaxed bursary of £12,000 (circa €18,000) per annum for
3 years plus home/EU (not overseas) fees.
* We have two research studentships starting anytime before September
2006 to work on the FP6-IST project SENSORIA – a collaborative
project involving a number of European academic and industrial
partners (see http://www.cs.le.ac.uk/projects.html#sensoria).
* The overall aim of the project is to develop a comprehensive approach
to the engineering of software systems for the emerging Service-
Oriented Computing paradigm, integrating foundational theories,
techniques, and methods, as well as a pragmatic software engineering
approach. The studentships are available within work packages 1 and
7 of the project. WP1 is intended to establish algebraic and logical
foundations for service description, interaction and composition at
the higher-level of business architecture modelling. WP7 will
support the development and verification of service-oriented systems
by means of automated, verifiable model transformations based on
algebraic graph transformation techniques.
* The students will join a very strong, young and dynamic team put
together from researchers of many nationalities, which reflects the
cultural diversity of life in the Department and the University as a
whole.
* All applicants should have at least a distinction or first in a
Diploma/Masters level degree in Computer Science or Mathematics and,
in any case, be in possession of a good mathematical background.
* Informal enquiries are welcome and should be emailed to Dr. Reiko
Heckel (reiko@mcs.le.ac.uk), or Professor José Fiadeiro
(jwf4@mcs.le.ac.uk). General information on postgraduate studies at
Leicester can be found in http://www.le.ac.uk/graduateoffice/pgprospectus/
* Each studentship will be awarded as soon as a good application is
received. Therefore, potential applicants are advised to express
their interest as soon as possible even if they would not be able to
start immediately.
EUROPEAN MASTERS PROGRAM IN COMPUTATIONAL LOGIC
http://www.inf.unibz.it/mcs/emcl/
* It is an international distributed Master of Science course, in
cooperation with the computer science departments in the following
universities: Free Univ. of Bozen-Bolzano, Italy; Technische Univ.
Dresden, Germany; Univ. Nova de Lisboa, Portugal; Technische
Univ. Wien, Austria; Univ. Politecnica de Madrid, Spain.
* This program, completely in English, involves studying one year at
the Free University of Bozen-Bolzano, and possibly completing the
second year with a stay in one of the partner universities.
* Many scholarships for non-European and European students.
* Application deadlines:
- 10 FEBRUARY 2006: early deadline for all students
(notification of acceptance: 10 March 2006)
- 30 June 2006: late deadline for all students
(notification of acceptance: 30 July 2006)
- 25 August 2006: last deadline for European students
starting at the Free University of Bozen-Bolzano, Italy
(notification of acceptance: 11 September 2006)
* NOTE: 10 February 2006 is the final deadline for requesting an
Erasmus Mundus scholarship for non-European students.
LOPSTR'06: INTERNATIONAL SYMPOSIUM ON LOGIC-BASED PROGRAM SYNTHESIS
AND TRANSFORMATION
July 12 - 14, 2006, Venice, Italy
http://www.dsi.unive.it/lopstr2006
* New deadline for full papers is Monday April 24
* Co-located with
ICALP'06: Intl. Colloquium on Automata, Languages and Programming
PPDP'06: ACM Symp. on Principles & Practice of Declarative Programming
CSFW'06: IEEE Computer Security Foundations Workshop.
* Scope of the Symposium:
The aim of the LOPSTR series is to stimulate and promote international
research and collaboration on logic-based program development. LOPSTR
is open to contributions in logic-based program development in any
language paradigm.
* LOPSTR has a reputation for being a lively, friendly forum for
presenting and discussing work in progress, so it is a real workshop
in the sense that it is also intended to provide useful feedback to
authors on their research. Formal proceedings are produced only after
the conference, so that authors can incorporate this feedback in the
published papers. This year, tool demonstrations are also solicited
as a separate submission category. Since 1994 the formal proceedings
have been published in the LNCS series of Springer-Verlag.
* Previous LOPSTR events were held in London (2005, 2000), Verona
(2004), Uppsala (2003), Madrid (2002), Paphos (2001), Venice (1999),
Manchester (1998, 1992, 1991), Leuven (1997), Stockholm (1996), Arnhem
(1995), Pisa (1994), and Louvain-la-Neuve (1993).
* Invited Speakers:
Shaz Qadeer. Microsoft Research, Redmond, USA
Massimo Marchiori. MIT, USA and Univ. of Padova, Italy
* Topics:
Topics of interest cover all aspects of logic-based program
development, all stages of the software life cycle, and issues of both
programming-in-the-small and programming-in-the-large. Papers
describing applications in these areas are especially welcome.
* Program Committee:
Slim Abdennadher, Roberto Bagnara, Gilles Barthe, John Gallagher,
Robert Glück, Michael Hanus, Pat Hill, Kazuhiko Kakehi,
Andy King, Michael Leuschel, Fred Mesnard, German Puebla (Program Chair),
Sabina Rossi, Grigore Rosu, Wim Vanhoof, German Vidal
* Important dates:
- Submission of full papers (new!): April 24, 2006
- Submission of extended abstracts: April 30, 2006
- Notification: May 20, 2006
- Camera-ready: June 10, 2006
- Conference: July 12-14, 2006
* Authors are asked to register with the online site at
http://www.easychair.org/LOPSTR06
and submit titles and abstracts of their intended submissions three days before the
deadline, i.e., on April 21 for full papers and on April 27 for
extended abstracts.
* More details as well as submission guidelines can be found at
http://www.dsi.unive.it/lopstr2006/cfp.html
FIRST WORKSHOP ON VERIFICATION AND DEBUGGING
21 August '06, Seattle, Associated with CAV 2006
http://www.ist.tugraz.at/vandd.html
* Scope: Knowing that a design violates its specification is only the first
step towards a correct system. The violation may be caused by a fault
in the design, but also by an error in the specification or in the
environment constraints. A designer needs to understand the violation
and to locate and correct the fault that causes it.
Industrial experience shows that fault localization and rectification
take much more time, effort, and expense than fault detection. Also,
debugging often takes place late in the design cycle, which makes it a
high-risk activity that may, if not done quickly and correctly, delay
the release of a product.
The workshop addresses the technologies and methodologies that need to
be employed after verification has detected the presence of a bug. It
aims to combine the efforts of the computer-aided verification and
software engineering communities, attracting work in the areas of
algorithms, tools, and methodologies for failure analysis. We welcome
submissions addressing debugging of software, circuit designs, or
combinations of the two.
* Topics of interest include
- explanation and simplification of error traces,
- fault localization,
- rectification of the design, the specification, or the
environment description,
- test case generation for debugging,
- debugging techniques,
- methodologies that facilitate debugging,
- overviews that provide a novel view of the state of the art and
stimulate discussion and further research, and
- empirical studies on debugging.
* Papers should contain original research, and sufficient detail to
assess the merits and relevance of the contribution. For papers
reporting experimental results, authors are strongly encouraged to
make their data available with their submission. Simultaneous
submission to other conferences with proceedings or submission of
material that has already been published elsewhere is not allowed.
Accepted papers will be published in a special issue of Elsevier's
Electronic Notes in Theoretical Computer Science. Papers should be at
most 19 pages long in ENTCS format.
* Important Dates:
- Paper submission deadline: 24 April 2006
- Notice of acceptance/rejection: 22 May 2006
- Final version due: 19 June 2006
- CAV conference: 16-20 August
- V&D Workshop 21 August '06
* The 2006 conference on Computer-Aided Verification will be a part of
the Federated Logic Conference in Seattle. The workshop will be held
the day after CAV.
* Further info: http://www.ist.tugraz.at/vandd.html.
The program committee can be reached at vandd2006@ist.tu-graz.ac.at.
* For further info on FLOC, see http://research.microsoft.com/floc06/.
* Program Committee:
Roderick Bloem (Graz University of Technology),
Alex Groce (Laboratory for Reliable Software, Jet Propulsion Laboratory),
John Moondanos (Future Formal Technologies Group, Logic Design Group, Intel),
Marco Roveri (ITC-irst),
Fabio Somenzi (University of Colorado at Boulder),
Markus Stumptner (University of South Australia), and
Andreas Zeller (University of Saarbruecken).
FMCAD 2006: INTERNATIONAL CONFERENCE ON FORMAL METHODS IN
COMPUTER-AIDED DESIGN
November 12-16, 2006, San Jose, California
http://fmcad.org/2006
* Note: ICCAD also takes place in San Jose the previous week, Nov. 5-9
* Sponsored by IEEE, CEDA (Council on Electronic Design Automation)
* Important Dates:
Submission deadline: April 24, 2006
Acceptance notification: June 23, 2006
Final version due: July 28, 2006
* Scope of Conference:
FMCAD 2006 is the sixth in a series of conferences on the theory and
applications of formal methods in hardware and system verification. FMCAD
provides a leading forum to researchers in academia and industry for
presenting and discussing groundbreaking methods, technologies,
theoretical results, and tools for reasoning formally about computing
systems. In addition to the technical program, FMCAD will offer a full
day of tutorials on model checking, theorem proving, decision procedures,
and the application of such methods in industry. FMCAD will also include
panels and affiliated workshops.
Details on topics of interest can be found at the conference webpage.
* Paper Submissions:
Submissions must be made electronically in PDF format through the FMCAD
Web site, http://fmcad.org/2006. There are two categories of papers:
Regular papers (up to 8 pages) and Short papers (up to 2 pages).
Details can be found on the conference webpage.
* Tutorials:
Jason Baumgartner, IBM Corporation
Edmund M. Clarke, Carnegie Mellon University
Leonardo de Moura, SRI
J Strother Moore, University of Texas at Austin
* Program Committee:
Clark Barrett, New York University, USA
Jason Baumgartner, IBM Corporation, USA
Valeria Bertacco, University of Michigan, USA
Dominique Borrione, Grenoble University, France
Supratik Chakraborty, Indian Institute of Technology Bombay, India
Alessandro Cimatti, Istituto per la Ricerca Scientifica e Tecnologica, Italy
Edmund M. Clarke, Carnegie Mellon University, USA
Leonardo de Moura, SRI International, USA
Rolf Drechsler, University of Bremen, Germany
Malay K. Ganai, NEC Laboratories America, USA
Ganesh Gopalakrishnan, University of Utah, USA
Susanne Graf, VERIMAG, France
Orna Grumberg, Technion - Israel Institute of Technology, Israel
Aarti Gupta, NEC Laboratories America, USA
Alan J. Hu, University of British Columbia, Canada
Warren Hunt, University of Texas, USA
Andreas Kuehlmann, Cadence Laboratories, USA
Panagiotis Manolios, Georgia Institute of Technology, USA
Andy Martin, IBM Research Division, USA
Ken McMillan, Cadence Labs, USA
John O'Leary, Intel Corp., USA
Wolfgang Paul, Saarland University, Germany
Carl Pixley, Synopsys Inc., USA
Amir Pnueli, NYU, USA
Natarajan Shankar, SRI International, USA
Mary Sheeran, Chalmers University of Technology, Sweden
Eli Singerman, Intel Corp., Israel
Vigyan Singhal, Oski Technology, Inc., USA
Anna Slobodova, Intel Corp., USA
Fabio Somenzi, University of Colorado at Boulder, USA
Richard Trefler, University of Waterloo, Canada
Matthew Wilding, Rockwell Collins Inc., USA
Yaron Wolfsthal, IBM, Israel
CSL'06: COMPUTER SCIENCE LOGIC
25-29 September, 2006, Szeged, Hungary
http://www.inf.u-szeged.hu/~csl06/
Call For Papers
* Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL).
* The conference is intended for computer scientists whose research
activities involve logic, as well as for logicians working on issues
significant for computer science.
* Invited speakers: Martin Escardo (Birmingham), Paul-Andre Mellies
(Paris), Luke Ong (Oxford), Luc Segoufin (Orsay), Miroslaw
Truszczynski (Lexington, KY).
* Program Committee: Krzysztof Apt (Amsterdam/Singapore), Matthias Baaz
(Vienna), Michael Benedikt (Chicago), Pierre-Louis Curien (Paris),
Rocco De Nicola (Florence), Zoltan Esik (Szeged, chair), Dov Gabbay
(London), Fabio Gadducci (Pisa), Neil Immerman (Amherst), Michael
Kaminski (Haifa), Bakhadyr Khoussainov (Auckland), Ulrich Kohlenbach
(Darmstadt), Marius Minea (Timisoara), Damian Niwinski (Warsaw),
R. Ramanujam (Chennai), Philip Scott (Ottawa), Philippe Schnoebelen
(Cachan), Alex Simpson (Edinburgh).
* Proceedings will be published in the LNCS series. Each paper accepted
by the Programme Committee must be presented at the conference by one
of the authors, and final copy prepared according to Springer's
guidelines.
* Submitted papers must be in Springer's LNCS style and of no more
than 15 pages, presenting work not previously published. They must
not be submitted concurrently to another conference with refereed
proceedings. The PC chair should be informed of closely related work
submitted to a conference or journal by 1 April, 2006. Papers
authored or coauthored by members of the Programme Committee are not
allowed.
* Dates and Deadlines:
- Submission of abstract 24 April, 2006
- Submission of full paper 1 May, 2006
- Notification 12 June, 2006
- Submission of final paper 3 July, 2006
* The Ackermann Award for 2006 will be presented to the recipients at
CSL'06.
* For more information refer to: http://www.inf.u-szeged.hu/~csl06/
DCM 2006: WORKSHOP ON DEVELOPMENTS IN COMPUTATIONAL MODELS
16 July 2006, S. Servolo, Venice, Italy
A Satellite Event of ICALP 2006
Call for Papers
http://www.dcm-workshop.org.uk/2006
* 2nd International Workshop on Developments in Computational Models
* Several new models of computation have emerged in the last few
years, and many developments of traditional computational models
have been proposed with the aim of taking into account the new
demands of computer systems users and the new capabilities of
computation engines. A new computational model, or a new feature in
a traditional one, usually is reflected in a new family of
programming languages, and new paradigms of software development.
The aim of this workshop is to bring together researchers who are
currently developing new computational models or new features for
traditional computational models, in order to foster their
interaction, to provide a forum for presenting new ideas and work in
progress, and to enable newcomers to learn about current activities
in this area. The first DCM workshop took place in Lisbon in 2005,
as a satellite event of ICALP 2005.
* Topics of interest include all abstract models of computation and
their applications to the development of programming languages and
systems. This includes (but is not limited to): Functional calculi:
lambda-calculus, rho-calculus, term and graph rewriting; Object
calculi; Interaction-based systems: interaction nets, games;
Concurrent models: process calculi, action graphs; Calculi
expressing locality, mobility, and active data; Quantum
computational models; Biological or chemical models of computation.
* Deadline for submission: 30 April 2006 (5 pages)
* For more information see web page
LPAR-13: 13TH INTERNATIONAL CONFERENCE ON LOGIC FOR PROGRAMMING,
ARTIFICIAL INTELLIGENCE AND REASONING
13th-17th November 2006, Phnom Penh, Cambodia
http://www.lix.polytechnique.fr/~hermann/LPAR2006/
2nd Call for Papers
* The 13th International Conference on Logic for Programming Artificial
Intelligence and Reasoning (LPAR-13) will be held 13th-17th November 2006,
at the Hotel Cambodiana, Phnom Penh, Cambodia.
* Dates and Deadlines:
+ Submission of full paper abstracts 2nd May
+ Submission of full papers 9th May
+ Notification of acceptance of full papers 10th July
+ Camera ready versions of full papers due 5th September
+ Submission of short papers 28th August
+ Notification of acceptance of short papers 11th September
+ Camera ready versions of short papers due 25th September
* Submission of papers for presentation at the conference is now invited.
Topics of interest include:
+ automated reasoning + propositional reasoning
+ interactive theorem proving + description logics
+ software verification + hardware verification
+ software testing + logic and ontologies
+ proof assistants + network and protocol verification
+ proof planning + nonmonotonic reasoning
+ proof checking + constructive logic and type theory
+ rewriting and unification + lambda and combinatory calculi
+ logic programming + knowledge representation and reasoning
+ modal and temporal logics + constraint programming
+ systems specification and synthesis + logical foundations of programming
+ model checking + computational interpretations of logic
+ proof-carrying code + logic and computational complexity
+ logic and databases + logic in artificial intelligence
+ reasoning for the semantic web + reasoning about actions
* Full and short papers are welcome. Full papers may be either regular
papers containing new results, or experimental papers describing
implementations or evaluations of systems. Short papers may describe work
in progress or provide system descriptions. Submitted papers must be
original, and not submitted concurrently to a journal or another
conference.
The full paper proceedings of LPAR-13 will be published by Springer-Verlag
in the LNAI series. Authors of accepted full papers will be required to
sign a form transferring copyright of their contribution to Springer-Verlag.
The short paper proceedings of LPAR-13 will be published by the conference.
* More details can be found on the conference webpage.
* Questions related to submission may be sent to the program chairs, Miki
Hermann and Andrei Voronkov.
WS-FM 2006: THIRD INTERNATIONAL WORKSHOP ON WEB SERVICES AND FORMAL METHODS
8-9 September 2006, Vienna, Austria
http://cs.unibo.it/ws-fm06
* Official event of "The Process Modelling Group"
http://www.process-modelling-group.org
Co-located with BPM 2006: 4th International Conference on
Business Process Management, http://bpm2006.tuwien.ac.at
* Scope: Web Services technology aims at providing standard mechanisms for
describing the interface and the services available on the web, as well
as protocols for locating such services and invoking them (e.g. WSDL,
UDDI, SOAP). Innovations are mainly devoted to the definition of
standards that support the specification of complex services out of
simpler ones (the so called Web Service orchestration and
choreography). Several proposals have been already set up: BPML, XLANG
and BizTalk, WSFL, WS-BPEL, WS-CDL, etc...
Formal methods, which provide formal machinery for representing and
analysing the behavior of communicating concurrent/distributed systems,
are playing a fundamental role in the development of such
innovations. First of all they are exploited to understand the basic
mechanisms (in terms of semantics) which characterize different
orchestration and choreography languages and to focus on the essence
of new features that are needed. Secondly they provide a formal
basis for reasoning about Web Service semantics (behaviour and
equivalence): e.g. for realizing registry services where retrieval
is based on the meaning and behaviour of a service and not just a
Web Service name. Thirdly, the studies on formal coordination paradigms
can be exploited for developing mechanisms for complex run-time Web
Service coordination. Finally, given the importance of critical
application areas for Web Services like E-commerce, the development of
the Web Service technology can certainly take advantage from formal
analisys of security properties and performance in concurrency theory.
The aim of the workshop is to bring together researchers working on Web
Services and Formal Methods in order to facilitate fruitful
collaboration in this direction of research. This, potentially, could
also have a great impact on the current standardization phase of Web
Service technologies.
* The topics of interest include, but are not limited to:
- Protocols and standards for WS (SOAP, WSDL, UDDI, etc... )
- Languages and description methodologies for Coreography/Orchestration/
Workflow (BPML, XLANG and BizTalk, WSFL, WS-BPEL, WS-CDL, YAWL, etc... )
- Coordination techniques for WS
(transactions, agreement, coordination services, etc...)
- Semantics-based dynamic WS discovery services
(based on Semantic Web/Ontology techniques or other semantic theories)
- Security, Performance Evaluation and Quality of Service of WS
- Semi-structured data and XML related technologies
* Submissions: Submissions must be original and should not have been
published previously or be under consideration for publication while
being evaluated for this workshop.
We encourage also the submission of tool papers, describing tools
based on formal methods, to be exploited in the context of Web Services
applications. Papers are to be prepared in LNCS format and must not exceed
15 pages. Accepted papers will be published in the workshop proceedings
as a volume of Lecture Notes in Computer Science (LNCS).
As done for previous editions of the workshop, we intend to publish a
journal special issue inviting full versions of papers selected among
those presented at the workshop.
* Important Dates:
May 2, 2006: Submission deadline (EXTENDED DEADLINE)
June 6, 2006: Notification of acceptance
June 20, 2006: Camera ready
September 8-9, 2006: Workshop dates
* Program Committee Co-Chairs:
Mario Bravetti University of Bologna, Italy
Gianluigi Zavattaro University of Bologna, Italy
* More information, including the PC members and the
Board of "The Process Modelling Group", can be found at
http://www.cs.unibo.it/projects/ws-fm06/
WRS06: THE SIXTH INTERNATIONAL WORKSHOP ON
REDUCTION STRATEGIES IN REWRITING AND PROGRAMMING
The Seattle Sheraton Hotel and Towers,
Seattle, Washington, August 11, 2006
http://www.cs.pdx.edu/~antoy/wrs06/
* Scope:
The workshop intends to promote and stimulate international
research and collaboration in the area of evaluation
strategies. It encourages the presentation of new
directions,developments and results as well as surveys and
tutorials on existing knowledge in this area. Reduction strategies
study which subexpression(s) of an expression should be
selected for evaluation and which rule(s) should be applied. These
choices affect fundamental properties of a computation such as
laziness, strictness, completeness and need to name a few. For this
reason some programming languages, e.g., Elan, Maude, *OBJ* and
Stratego, allow the explicit definition of the evaluation
strategy, whereas other languages,e.g., Clean, Curry, and Haskell,
allow its modification. Strategies pose challenging theoretical
problems and play an important role in practical tools such as
theorem provers, model checkers and programming languages. In
implementations of languages, strategies bridge the gap between
operational principles, e.g., graph and term rewriting,narrowing
and lambda-calculus, and semantics, e.g., normalization,
computation of values and head-normalization. The previous
editions of the workshop were: WRS 2001 (Utrecht, The
Netherlands),WRS 2002 (Copenhagen, Denmark), WRS 2003 (Valencia,
Spain), WRS 2004 (Aachen, Germany), and WRS 2005 (Nara,
Japan). See also the WRS permanent page at
http://www.dsic.upv.es/~wrs/
* Important Dates:
Abstract Submission: May 8, 2006
Paper Submission: May 15, 2006
Author Notification: June 12, 2006
Camera-Ready: July 10, 2006
Conference: Aug 11, 2006
* Program Committee:
Sergio Antoy, (chair) Portland State University
Santiago Escobar, Universidad Politecnica de Valencia
Juergen Giesl, RWTH Aachen
Bernhard Gramlich, Technische Universitat Wien
Ralf Laemmel, Microsoft Corp.
Salvador Lucas, Universidad Politecnica de Valencia
Narciso Marti-Oliet, Universidad Complutense de Madrid
Mizuhito Ogawa, Japan Advanced Institute of Science and Technology
Jaco van de Pol, Centrum voor Wiskunde en Informatica
Manfred Schmidt-Schauss, Johann Wolfgang Goethe-Universitat
* Invited Speakers:
Talks will be given at joint sessions with RULE by:
- Dick Kieburtz, OHSU/OGI School of Science & Engineering
- Claude Kirchner, INRIA & LORIA
* Contact: Sergio Antoy, antoy@cs.pdx.edu
* Submissions: Submissions must be original and not submitted for
publication elsewhere. The page limit for regular papers is
13 pages in Springer Verlag LNCS style. Surveys and
tutorials maybe longer. Use the WRS06 submission page,
handled by the EasyChair conference system, to submit
abstracts, papers and to update a previous submission.
* Publication: Informal proceedings of accepted contributions will be
available on-line. A hard copy will be distributed at the
workshop to registered participants. Authors of
selected contributions will be invited to submit a revised
version, after the workshop, for inclusion in a
collection. We anticipate the publication of formal
proceedings in the Elsevier ENTCS series.
HOR 2006: THIRD INTERNATIONAL WORKSHOP ON HIGHER-ORDER REWRITING
Tuesday August 15, 2006, Sheraton, Seattle, WA
http://hor.pps.jussieu.fr/06
Call for Abstracts
* Important Dates:
May 8, 2006 : deadline electronic submission of paper
May 29, 2006 : notification of acceptance of papers
June 8, 2006 : deadline for final version of accepted papers
* The aim of HOR is to provide an informal and friendly setting to discuss
recent work and work in progress concerning higher-order rewriting.
HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark.
HOR 2004 was part of RDP 2004 in Aachen, Germany.
HOR 2006 will be part of FLoC 2006 in Seattle, USA.
* Invited Talks:
Hugo Herbelin (INRIA Futurs, Paris)
Eelco Visser (Universiteit Utrecht, The Netherlands)
* Topics of interest include (but are not limited to):
Applications: proof checking, theorem proving, generic programming,
declarative programming, program transformation.
Foundations: pattern matching, unification, strategies, narrowing,
termination, syntactic properties, type theory.
Frameworks: term rewriting, conditional rewriting, graph rewriting,
net rewriting, comparisons of different frameworks.
Implementation: explicit substitution, rewriting tools,
compilation techniques.
Semantics: semantics of higher-order rewriting,
higher-order abstract syntax
* Program/Organizing Committee:
Delia Kesner Universite Paris 7, France kesner@pps.jussieu.fr
Femke van Raamsdonk Vrije Universiteit, The Netherlands femke@cs.vu.nl
Mark-Oliver Stehr SRI International, USA stehr@csl.sri.com
* HOR'06 Submissions:
Abstracts between 2 and 5 pages. As HOR is meant
to be a platform to discuss ongoing research we
are also interested in abstracts describing work
in progress, or problems in higher-order rewriting.
Please use the EasyChair page http://www.easychair.org/HOR06/
to submit or update your paper.
* Proceedings:
The proceedings of HOR 2006 will be made available on the
HOR 2006 web page and copies will be distributed to the
participants at the workshop.
* Local Arrangements:
Gopal Gupta University of Texas, Dallas, USA gupta@utdallas.edu
Ashish Tiwari SRI International, USA tiwari@csl.sri.com
LFMTP'06: INTERNATIONAL WORKSHOPS ON LOGICAL FRAMEWORKS AND META-LANGUAGES:
THEORY AND PRACTICE
Affiliated with LICS and IJCAR at FLOC'06
Call for Papers
Seattle, Washington, 16 August, 2006.
http://www.cs.mcgill.ca/~bpientka/lfmtp06/index.html
* Theme. The automation and implementation of the meta-theory of
programming languages and related calculi, particularly work which
involves variable binding and fresh name generation. The theoretical
and practical issues concerning the encoding of variable binding and
fresh name generation, especially the representation of, and
reasoning about, datatypes defined from binding signatures. Case
studies of meta-programming, and the mechanization of the
(meta)theory of programming languages and calculi.
* Paper Submissions.
Category A: Detailed and technical accounts of new research: up
to fifteen pages including bibliography.
Category B: Shorter accounts of work in progress: up to eight
pages including bibliography.
Category C: System descriptions, presenting an implemented tool
and its novel features: up to six pages. A demonstration is
expected to accompany the presentation.
Submission is electronic. For instructions, see the LFMTP web page:
http://www.cs.mcgill.ca/~bpientka/lfmtp06/index.html
* Submission Deadline: May 15, 2006
* Program Committee. Andrew Appel (Princeton University), Thierry
Coquand (Goteborg University), Martin Hofmann (LMU Munich), Furio
Honsell (University of Udine), Dale Miller (Inria Futurs), Brigitte
Pientka (McGill University) Andrew Pitts (Cambridge University)
Kevin Watkins (Carnegie Mellon University).
STM'06: 2ND INTERNATIONAL WORKSHOP ON SECURITY AND TRUST MANAGEMENT
Hamburg,Germany - September 20, 2006 (in conjunction with ESORICS 2006)
http://www.hec.unil.ch/STM06/
* STM (Security and Trust Management) is a recently established working
group of ERCIM (European Research Consortium in Informatics and
Mathematics). STM 2006 is the second workshop in this series, and has
the following aims:
- to investigate the foundations and applications of security and trust in ICT
- to study the deep interplay between trust management and common
security issues such as confidentiality, integrity and availability
- to identify and promote new areas of research connected with security
management, e.g. dynamic and mobile coalition management (e.g., P2P,
MANETs, Web/GRID services)
- to identify and promote new areas of research connected with trust
management, e.g. reputation, recommendation, collaboration etc
- to provide a platform for presenting and discussing emerging ideas
and trends
* Topics of interest include but are not limited to:
- semantics and computational models for security and trust
- security and trust management architectures, mechanisms and policies
- networked systems security
- privacy and anonymity
- Identity management
- ICT for securing digital as well as physical assets
- cryptography
* The primary focus is on high-quality original unpublished research, case
studies, and implementation experiences. We encourage submissions
discussing the application and deployment of security technologies in
practice.
* Paper submissions: Submitted papers must not substantially overlap papers
that have been published or that are simultaneously submitted to a
journal or a conference with proceedings. Papers must have authors'
affiliation and contact information on the first page. Papers are limited
to 12 pages in ENTCS style format (using the generic template).
Excessively long papers will be returned without review. Accepted papers
will be published in a post-workshop ENTCS volume. To submit a paper,
please visit http://www.easychair.org/STM06/ . For more information
contact stm06@dti.unimi.it
Papers must be received by the deadline of May 15, 2006.
* Important Dates:
Paper submission due: May 15, 2006
Acceptance notification: June 26, 2006
Final Papers due: August 20, 2006
* General Chairs:
Solange Ghernaouti Hélie, Univ. Lausanne, CH, email: sgh@unil.ch
Ulrich Ultes-Nitsche, Univ. Fribourg, CH, email: uun@unifr.ch
* Program Co-Chairs:
Sandro Etalle, University of Twente, NL, email: sandro.etalle@utwente.nl
Pierangela Samarati, Universita' di Milano - Italy, email: samarati@dti.unimi.it
* This call for papers and additional information about the conference
can be found at http://www.hec.unil.ch/STM06
WST 2006: EIGHTH INTERNATIONAL WORKSHOP ON TERMINATION
(part of FLOC 2006, affiliated with RTA 2006)
Call for Papers
Seattle, August 15 - 16, 2006
http://www.cs.mu.oz.au/wst2006/wst2006.cfp.html
* Themes: Termination of programs; Termination of rewriting;
Strong/weak normalization of lambda calculi; Challenging
termination problems/proofs; Implementations of termination
methods; Termination methods for theorem provers; Termination
analysis for different language paradigms; Applications to
program transformation and compilation; Comparisons and
classification of termination methods; Non-termination and
loop detection; Termination in distributed systems; Size-change
analysis; Proof methods for liveness and fairness; Well-founded
orderings; Well-quasi-order theory; Ordinal notations; Fast/slow
growing hierarchies; Derivational complexity.
Contributions from the constraint, functional, and logic
programming communities, and papers investigating new
applications of termination are particularly welcome.
* Submission details: http://www.cs.mu.oz.au/wst2006/wst2006.cfp.html
* Submission deadline: May 19, 2006
* Competition: The termination competition will run again in 2006.
Details to appear http://www.lri.fr/~marche/termination-competition/
* Program committee: Thomas Arts (IT Uni Goteborg, SE), Alfons Geser
(HTWK Leipzig, DE), Dieter Hofbauer (Uni Kassel, DE), Claude Marche
(Uni Paris-Sud, FR), Andreas Podelski (Max-Planck Informatik, DE),
Henny Sipma (Stanford, US), Harald Sondergaard (Uni Melbourne, AU),
Andreas Weiermann (Uni Utrecht, NL).
GALOP II: GAMES FOR LOGIC AND PROGRAMMING LANGUAGES 2006
August 10 - 22, 2006, Seattle, Washington, USA, a FLoC 2006 workshop
http://www.cs.bham.ac.uk/galop
Call for Papers
* Topic:
Game semantics has emerged as a successful paradigm in the field of
semantics of logics and programming languages. Game-semantic
techniques led to the development of the first syntax-independent
fully-abstract models for a variety of programming languages, ranging
from the purely functional to languages with imperative features such
as control, references or concurrency. There are also connections
between game semantics and other semantic theories, including the the
pi-calculus and domain theory. In addition to semantic analysis, an
algorithmic approach to game semantics has recently been developed,
with a view to applications in computer assisted verification and
program analysis.
* Submissions: Submission: May 19, Notification: June 9
* This is intended to be an informal workshop. Participants are
encouraged to present work in progress, overviews of more extensive
work, and programmatic/position papers, as well as completed
projects. We therefore ask for submission both of short abstracts
outlining what will be presented at the workshop and of longer papers
describing completed work, either published or unpublished, in the
following areas:
* Game theory and interaction models in semantics
* Games-based design and verification
* Logics for games and games for logics
* Algorithmic aspects of games
* To submit please follow the EasyChair link http://www.easychair.org/GALOP2/.
* A special journal issue associated with the workshop is being
considered; this will be discussed at the workshop.
* Invited Speakers:
Luke Ong, Oxford
Madhusudan Parthasarathy, UIUC
* Program Committee:
Samson Abramsky, Oxford
Pierre-Louis Curien, Paris VII
Claudia Faggian, Padova
Dan Ghica, Birmingham
Radha Jagadeesan, DePaul (Chair)
Paul-André Melliès, Paris VII
Guy McCusker, Sussex
Olivier Laurent, Paris VII
Andrea Schalk, Manchester
WORKSHOP -- SEARCH AND LOGIC: ANSWER SET PROGRAMMING AND SAT (LaSh-06)
Affiliated with ICLP-06, as part of FLoC-06
Call for Papers
August 16, 2006, Seattle, Washington, USA
http://www.cs.sfu.ca/~SearchAndLogic/
* Theme. An approach, of growing importance, to solving combinatorial
search problems is to describe properties of solutions in some logic,
and use a model-finder for the logic to obtain solutions. SAT and
Answer Set Programming (ASP) are two versions of this. The workshop
will bring together researchers from SAT and ASP to exchange ideas on t
he state-of-the-art in techniques, results and methodologies; to discuss
problems which are exhibited in both areas; and to formulate challenges
and opportunities.
* Submission of papers is electronic; for details see the web page.
* Submission deadline: May 22, 2006.
* Invited Speakers: Henry Kautz (Washington), Mirek Truszczynski (Kentucky)
* Organizers: Enrico Giunchiglia (Genova),
Victor Marek (Kentucky),
David Mitchell (SFU),
Eugenia Ternovska (SFU)
WORKSHOP ON DISPROVING - NON-THEOREMS, NON-VALIDITY, NON-PROVABILITY
(affiliated with IJCAR 2006, in connection with FLoC 2006)
Call for Papers
Seattle, Washington, August 16, 2006
www.cs.chalmers.se/~ahrendt/FLoC06-ws-disproving/
* Theme: Disproving aims at identifying non-theorems, i.e. showing
non-validity, and providing some kind of proof of non-validity.
In the scope of the workshop is every method that is able to discover
non-theorems and, ideally, provides explanation why the formula is not a
theorem. Possible subjects are decision procedures, model generation
methods, reduction to SAT, formula simplification methods, abstraction
based methods, failed-proof analysis, and others.
* Submissions should not exceed 10 pages, and be uploaded at
www.easychair.org/DISPROVING06/
* Submission Deadline : 26th of May, 2006
* Workshop Organizers: Wolfgang Ahrendt, Peter Baumgartner, Hans de Nivelle
* Program committee: Johan Bos, Simon Colton, Christian Ferm?ller, Bernhard Gramlich,
Bill McCune, Michael Norrish, Renate Schmidt, Carsten Sch?rmann, John Slaney,
Graham Steel, Cesare Tinelli, Calogero Zarba, and the WS organizers
WORKSHOP ON HYBRID LOGIC 2006 (HyLo 2006)
(affiliated with LICS 2006)
Second Call for Papers
Seattle, August 11, 2006
http://hylomol.ruc.dk/HyLo2006
* Theme. Hybrid logic is a branch of modal logic where it is
possible to directly refer to worlds/times/states or whatever
the elements of the model are meant to represent. It is easy to
justify interest in hybrid logic because of the usefulness of
the additional expressive power, and moreover, hybridization
often improves the behavior of the underlying modal formalism.
The workshop HyLo 2006 is relevant to a wide range of people,
including those interested in description logic, feature logic,
applied modal logics, temporal logic, and labelled deduction.
* Invited speakers. Patrick Blackburn (INRIA Lorraine, France),
Valeria de Paiva (PARC, USA),
Ian Horrocks (University of Manchester, UK)
* Submission. Details are announced at the workshop web page.
The proceedings have been accepted for publication in ENTCS.
* Submission deadline: May 26, 2006
* Program committee. Carlos Areces (INRIA Lorraine, France),
Patrick Blackburn (INRIA Lorraine, France),
Thomas Bolander (Technical University of Denmark),
Torben Braüner (Roskilde University, Denmark) --- Chair,
Valeria de Paiva (PARC, USA),
Melvin Fitting (Lehman College, New York, USA),
Balder ten Cate (University of Amsterdam, The Netherlands),
Jørgen Villadsen (Roskilde University, Denmark)
PCC 2006: INTERNATIONAL WORKSHOP ON PROOF-CARRYING CODE
(affiliated with LICS 2006, part of FLoC 2006)
Call for Posters
Seattle, USA, August 11, 2006
http://www.cs.stevens.edu/~abc/PCC-Workshop.html
* Submission Deadline: 31 May 2006
Send 2-page abstract to pcc2006@cs.stevens.edu
* Keynote Speakers: Andrew Appel (Princeton University), Ian Stark
(University of Edinburgh)
* Invited Speakers: Amal Ahmed (Harvard University), Gilles Barthe
(INRIA Sophia-Antipolis), Ricardo Medel (Stevens Institute of
Technology), Zhong Shao (Yale University), Dachuan Yu (DoCoMo Labs)
* Description: The aim of the workshop is to bring together people
from academia and industry and to promote the collaboration between
those adapting PCC ideas to new industrial applications and experts
in logic, type theory, programming languages, static analysis, and
compilers.
* Program Committee: Adriana Compagnoni, Chair (Stevens Institute of
Technology), Amy Felty (University of Ottawa)
VODCA'06: 2ND INTERNATIONAL WORKSHOP ON VIEWS ON DESIGNING COMPLEX
ARCHITECTURES
16-17 September, 2006, Bertinoro, Italy
http://coba.dc.fi.udc.es/~parama/vodca/
* Important Dates:
Submission of papers: June 25, 2006
Notification of acceptance: July 25, 2006
Camera-ready version due: August 20, 2006
VODCA workshop: September 16-17, 2006
* Aims and Scope: Security and management of information are key issues
in informatics, and are among its fast-developing fields. This
workshop aims to provide a platform for junior researchers
to present their research views on all areas related to the
design of complex architectures, with a special focus on the
security and management of information. The workshop topics
thus include, but are not limited to, the following issues:
Information Security Information Management
* Security protocols * Knowledge management
* Privacy and anonymity * Data and knowledge sharing
* Protocol analysis * Component-based design
* Access control policies * Service-oriented computing
* Intrusion detection * Workflow management
strategies * CSCW and groupware systems
* Mobile secure code * Intelligent information
* Formal methods for security systems
* Language-based security * Information retrieval
* Availability * Distributed systems
* Confidentiality * Identity and trust management
* Model-driven security * Fault-tolerance
* Verification of security * Business process management
properties
* Submission of Papers: Submissions must be sent, either in postscript
or PDF format, to Maurice ter Beek (maurice.terbeek@isti.cnr.it).
Papers must be original and not under consideration for publication
elsewhere. Authors must clearly explain the contribution of
their work in terms of its theoretical and/or practical
value, as well as its relationships with related literature.
Submissions must be in English, may not exceed 15 pages, and
should include an abstract and a list of keywords.
Preproceedings will be made available at the workshop. The
final proceedings should be published in the Electronic
Notes in Theoretical Computer Science (ENTCS) series, as was
the case for the first edition of VODCA in 2004 (published
as ENTCS volume 142). Authors are thus advised to follow the
ENTCS guidelines (available through http://www.entcs.org/)
when preparing their paper.
* The workshop will take place directly following FOSAD 2006
(the 6th International School on Foundations of Security
Analysis and Design). For further information, please visit
http://www.sti.uniurb.it/events/fosad06/.
* Organising Committee:
Fabio Gadducci (CHAIR, University of Pisa, Italy)
Alessandro Aldini (University of Urbino, Italy)
Maurice ter Beek (ISTI-CNR, Pisa, Italy)
Raymond McGowan (ARL-ERO, London, UK)
Jose Ramon Parama Gabia (PUBLICITY CHAIR, University of A Coruna, Spain)
* Programme Committee:
Maurice ter Beek (CHAIR, ISTI-CNR, Pisa, Italy)
Alessandro Aldini (University of Urbino, Italy)
Alejandra Cechich (University of Comahue, Neuquen, Argentina)
Ricardo Corin (University of Twente, The Netherlands)
Fernando Dotti (Catholic University of Rio Grande do Sul, Porto Alegre, Brazil)
Fabio Gadducci (University of Pisa, Italy)
Jan Juerjens (Technical University of Munich, Germany)
Stefanie Lindstaedt (Know-Center, Graz, Austria)
Reiko Heckel (University of Leicester, UK)
Jose Ramon Parama Gabia (University of A Coruna, Spain)
* Further Information:
See the VODCA'06 page: http://coba.dc.fi.udc.es/~parama/vodca/
ICDT 2007: 11TH INTERNATIONAL CONFERENCE ON DATABASE THEORY
Call for Papers
Barcelona, Spain. January 10-12, 2007.
http://www.lsi.upc.edu/~icdt2007
* Topics of interest for submissions
include: Access methods and physical design; Active databases;
Complexity and performance; Constraint databases; Data
integration and interoperability; Data mining; Data models;
Database programming and query languages; Databases and
information retrieval; Probabilistic Databases; Databases and
workflow; Databases and the Semantic Web; Databases in
e-commerce; Databases in e-services; Deductive databases and
knowledge bases; Distributed databases; Integrity and security;
Logic and databases; Multimedia databases; Query optimization;
Query processing; Real-time databases; Semi-structured, XML, and
Web data; Spatial data; Temporal data; Concurrency and recovery;
Transaction management; Views and data warehousing.
* Paper submission will be electronic. Authors are required to
submit a paper title and short abstract (about 100 words) before
submitting the paper.
* The deadline for abstract submissions is July 10, 2006. The deadline for
paper submission is July 17, 2006.
* Programme commitee: Marcelo Arenas (PUC Chile), Albert Atserias (UPC
Barcelona), Michael Benedikt (Bell Laboratories), Diego Calvanese (Free
University of Bozen-Bolzano), Alin Deutsch (UC San Diego), Amr El Abbadi (UC
Santa Barbara), Wenfei Fan (University of Edinburgh), Floris Geerts
(University of Edinburgh), Carlos Hurtado (Universidad de Chile), Gyula O.H.
Katona (Hungarian Academy of Sciences), Hans-Joachim Klein
(Christian-Albrechts University of Kiel), Phokion Kolaitis (IBM Almaden),
Gabriel Kuper (University of Trento), Kim S. Larsen (University of Southern
Denmark), Chen Li (UC Irvine), Maarten Marx (University of Amsterdam), Kobbi
Nissim (Ben-Gurion University), Thomas Schwentick (co-chair) (University of
Dortmund), Dan Suciu (co-chair) (University of Washington), Gottfried Vossen
(University of Münster), Stijn Vansummeren (Hasselt University)
LFCS'07: SYMPOSIUM ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE
Call for papers
New York City, June 4 - 7, 2007
www.cs.gc.cuny.edu/~sartemov/lfcs07
* Purpose. The LFCS series provides an outlet for the fast-growing body
of work in the logical foundations of computer science, e.g., areas of
fundamental theoretical logic related to computer science.
* Theme. Constructive mathematics and type theory; logical foundations
of programming; logical aspects of computational complexity; logic
programming and constraints; automated deduction and interactive theorem
proving; logical methods in protocol and program verification; logical
methods in program specification and extraction; domain theory logics;
logical foundations of database theory; equational logic and term
rewriting; lambda and combinatory calculi; categorical logic and
topological semantics; linear logic; epistemic and temporal logics;
intelligent and multiple agent system logics; logics of proof and
justification; nonmonotonic reasoning; logic in game theory and social
software; logic of hybrid systems; distributed system logics; system
design logics; other logics in computer science.
* All submissions must be done electronically (15 pages, according to
LNCS standards) to lfcs07@gmail.com.
* Submission Deadline. December 18, 2006.
* Steering Committee. Anil Nerode (Cornell, General Chair); Stephen Cook
(Toronto); Dirk van Dalen (Utrecht); Yuri Matiyasevich (St.Petersburg);
John McCarthy (Stanford); J. Alan Robinson (Syracuse); Gerald Sacks
(Harvard); Dana Scott (Carnegie-Mellon).
* Program Committee. Samson Abramsky (Oxford); Sergei Artemov (New York
City, PC Chair); Matthias Baaz (Vienna); Lev Beklemishev (Moscow);
Andreas Blass (Ann Arbor); Lenore Blum (CMU); Samuel Buss (San Diego);
Thierry Coquand (Go"teborg); Ruy de Queiroz (Recife, Brazil); Denis
Hirschfeldt (Chicago); Bakhadyr Khoussainov (Auckland); Yves Lafont
(Marseille); Joachim Lambek (McGill); Daniel Leivant (Indiana); Victor
Marek (Kentucky); Anil Nerode (Cornell, General LFCS Chair); Philip
Scott (Ottawa); Anatol Slissenko (Paris); Alex Simpson (Edinburgh); V.S.
Subrahmanian (Maryland); Michael Rathjen (Columbus); Alasdair Urquhart
(Toronto).
Back to the LICS web page.