Newsletter 128
October 1, 2010
*******************************************************************
* 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
body to lics@informatik.hu-berlin.de
*******************************************************************
TABLE OF CONTENTS
* LICS NEWS
Message from the LICS General Chair
LICS 2011 Test-of-Time Award: Call for Nominations
New Publicity Chair
LICS 2011 Announcement
* UPCOMING DEADLINES
Deadlines within the next six weeks
* CONFERENCES AND WORKSHOPS
LICS 2011 - Call for Workshop Proposals
GIPSY 2010 - Call for Participation and Papers
CADE 2011 - Call for Papers and Workshop Proposals
SAT 2011 - Call for Papers and Workshop Proposals (17.12.2010)
ICLP 2011 - Call for Papers
TCLA 2010 - Call for Papers
AMW 2011 - Call for Papers (22.2.2011)
* JOURNALS
* AWARDS
Ackermann Award 2010
Ackermann Award 2011 - Call for Nominations
CAV Award 2010
* BOOK ANNOUNCEMENTS
Logic Analysis of Hybrid Systems by Andre Platzer
Electronic Proceedings in Theoretical Computer Science
LICS NEWS
* Welcome back after the summer break.
* Message from the LICS General Chair
LICS 2010 Report:
LICS 2010 was held in Edinburgh from July 11 to 14 as
part of the Federated Logic Conference (FLoC).
The meeting reflected the vibrancy of the research community:
LICS had 192 registered participants of which 67 were students.
Overall, FLoC consisted of 8 conferences and about 50 workshops,
and attracted a total of 1250 participants.
LICS 2010 was also the 25th LICS: To mark this occasion, there
was the 25th Year Anniversary Celebration: the LICS webpage at
http://www2.informatik.hu-berlin.de/lics/index.html
has slides from the presentation that traces the history of LICS.
* LICS 2011 Test-of-Time Award Nominations:
The LICS Test-of-Time Award recognizes a small number of papers
from the LICS proceedings from 20 years prior that have
best met the "test of time". LICS 2011 ToT Award committee consists of
Tom Henzinger, Radha Jagadeesan, Catuscia Palamidessi, and
Andy Pitts (Chair). All papers published in LICS 1991 Proceedings
are eligible, see
http://www2.informatik.hu-berlin.de/lics/archive/1991/index.html
Any member of the LICS community is welcome to send recommendations
to Andy at Andrew.Pitts@cl.cam.ac.uk
* Andrzej Murawski has replaced Nicole Schweikardt as LICS Publicity
co-chair.
* LICS 2011 will be held at the Fields Institute on the campus of the
University of Toronto in Toronto, Ontario, Canada, from June 21st to
the 24th, 2011.
DEADLINES
* STOC 2011
4.11.2010
http://www2.research.att.com/~dsj/stoc11/stoc11.html
* LICS 2011
16.11.2010 - Workshop Proposals
http://www.fields.utoronto.ca/programs/scientific/10-11/lics11/proposals.html
* GIPSY 2010
22.10.2010
http://www.irisa.fr/prive/Sophie.Pinchinat/GIPSy/gipsy10.html
26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011)
Fields Institute and the University of Toronto
June 21-24, 2011
Call for Workshop Proposals
* The twenty-sith IEEE Symposium on Logic In Computer Science (LICS
2011) will be held in Toronto, Canada, 21-24 June 2011. Possible dates
for workshops are Monday 20th June and Saturday 25th June, 2011 (i.e.,
one day before and one day after LICS).
* Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic - broadly construed - to computer
science or related elds. Typically, LICS workshops feature a number of
invited speakers and a number of contributed presentations. LICS
workshops do not usually produce formal proceedings. However, in the
past there have been special issues of journals based in part on
certain LICS workshops.
* Proposals should include:
- A short scientific summary and justification of the proposed
topic. This should include a discussion of the particular
benefitts of the topic to the LICS community.
- A discussion of the proposed format and agenda.
- The proposed duration, which is typically one day (two-day
workshops can be accommodated too).
- Your preferred dates. This is important!
- Procedures for selecting participants and papers.
- Expected number of participants. This is important!
- Potential invited speakers.
- Plans for dissemination (for example, special issues of journals).
- Proposals are due on the 16th November 2010, and should be
submitted electronically to the Workshops Chairs:
o Adriana Compagnoni: abc@cs.stevens.edu
o Maribel Fernandez: Maribel.Fernandez@kcl.ac.uk
* Notifications will be sent by the 15th December 2010.
The Workshops Selection Committee consists of
- the LICS General Chair,
- LICS Workshops Chairs,
- LICS 2011 PC Chair and
- LICS 2011 Conference Co-Chairs.
WORKSHOP ON GAMES, LOGIC AND SECURITY (GIPSY 2010)
CALL FOR PARTICIPATION
Rennes, France
15-16 November 2010
http://www.irisa.fr/prive/Sophie.Pinchinat/GIPSy/gipsy10.html
* Many tasks in computer science, such as design, synthesis,
verification, etc. can be formulated in game-theoretic terms. Game
playing is thus a powerful paradigm that fits many situations in which
interaction between autonomous agents plays a central
role. Abstracting security problems as games reveals the underlying
theoretical and algorithmic questions, and helps to clarify the
relationships between different domains. As an organizational
principle, the concept of game offers a fresh and intuitive way of
thinking through complex issues. There is now ample evidence that the
diverse applications mentioned above can benefit from common
analytical techniques and insights offered by algorithmic game theory,
automata theory and logic.
* The main goal of this workshop is to gather researchers interested
in games, logic and security (in a broad sense), and to offer a
privileged forum to present their work and exchange ideas on these
topics.
* Three invited tutorials are scheduled:
- Hans van Ditmarsch, University of Sevilla, Spain
Dynamic epistemic logic, protocols, and security
- Jean-François Raskin, Université Libre de Bruxelles, Belgium
Games with imperfect information: Theory and Algorithms
- Tristan Tomala, HEC Paris, France
Secure communication in networks: Mechanism Design, Games and Cryptography
* Apart from the invited talks, participants are welcome to give short
talks (approximately 20 minutes). Selection will be made on the basis
of an extended abstract of at most 2 pages. Submissions can contain
work published elsewhere.
* Important dates:
- Submission deadline: 22nd October 2010
- Notification to authors: 1st November 2010
- Deadline for registration: 4th November 2010
- Workshop: 15th-16th November 2010
* Scientific committee:
- Nathalie Bertrand (INRIA Rennes)
- Sébastien Gambs (Université de Rennes 1 - INRIA)
- Sophie Pinchinat (Université de Rennes 1)
* Local organization:
- Laurence Dinh
- Lydie Mabil
- Bastien Maubert
23ND INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-23)
CALL FOR PAPERS
Wroclaw, Poland
July 31- August 5, 2011
http://cade23.ii.uni.wroc.pl/
* GENERAL INFORMATION
CADE is the major forum for the presentation of research in all
aspects of automated deduction. The conference programme will
include invited talks, paper presentations, system
descriptions, workshops, tutorials, and system competitions.
* SCOPE
We invite high-quality submissions on the general topic of
automated deduction, including foundations, applications,
implementations and practical experiences.
Logics of interest include, but are not limited to
o propositional, first-order, equational, higher-order,
classical, description, modal, temporal, many-valued,
intuitionistic, other non-classical, meta-logics,
logical frameworks, type theory and set theory.
Methods of interest include, but are not limited to
o saturation, resolution, instance-based, tableaux, sequent
calculi, natural deduction, term rewriting, decision
procedures, model generation, model checking, constraint
solving, induction, unification, proof planning, proof
checking, proof presentation and explanation.
Applications of interest include, but are not limited to
o program analysis and verification, hardware verification,
synthesis, systematic software and hardware testing,
(computer-aided) mathematics, natural language processing,
computational linguistics, knowledge representation,
ontology reasoning, deductive databases, functional and
logic programming, robotics, planning and other areas of AI.
* SUBMISSION INSTRUCTIONS:
Submissions can be made in the categories
o 'regular papers' and
o 'system descriptions'.
The page limit in Springer LNCS style is
o 15 pages for regular papers and
o 5 pages for system descriptions.
* IMPORTANT DATES (tentative):
A paper title and a short abstract of about 100 words must be
submitted before the paper.
7 December 2010 Deadline for Workshop/Tutorial proposals
7 January 2011 Notification (Workshops/Tutorials)
1 February 2011 Abstract submission deadline
7 February 2011 Paper submission deadline
20 March 2011 Notification of paper decisions
20 April 2011 Camera-ready papers due
31 July-1 August 2011 Workshops & Tutorials
2-5 Aug 2011 Conference, including CASC
* PROGRAM COMMITTEE
Alessandro Armando Università di Genova
Franz Baader Technische Universität Dresden
Peter Baumgartner NICTA Canberra
Nikolaj Bjorner Microsoft Research (PC co-chair)
Maria Paola Bonacina Universita` degli Studi di Verona
Bernhard Beckert Karlsruhe Institute of Technology
Alessandro Cimatti FBK-irst
Leonardo de Moura Microsoft Research
Stephanie Delaune CNRS, LSV
Bruno Dutertre SRI International
Ulrich Furbach University of Koblenz
Silvio Ghilardi Università degli Studi di Milan
Jürgen Giesl RWTH Aachen
Rajeev Gore The Australian National University
John Harrison Intel Corporation
Ullrich Hustadt University of Liverpool
Reiner Hähnle Chalmers University of Technology
Deepak Kapur University of New Mexico
Viktor Kuncak EPFL
Alexander Leitsch Technische Universität Wien
Christopher Lynch Clarkson University
Claude Marché INRIA Saclay, Parc Orsay Université
Aart Middeldorp Universität Innsbruck
Tobias Nipkow TU Munchen
Hans de Nivelle University of Wroclaw
Albert Oliveras Universitat Politècnica de Catalunya
Lawrence Paulson University of Cambridge
Frank Pfenning CMU
Brigitte Pientka McGill University
David Plaisted University of North Carolina-Chapel Hill
Michael Rusinowitch LORIA-INRIA-Lorraine
Renate A. Schmidt University of Manchester
Carsten Schuermann IT University of Copenhagen
Roberto Sebastiani DISI, University of Trento
Gert Smolka Universität des Saarlandes
Viorica Sofronie-Stokkermans Max Planck Institute for Informatics (PC co-chair)
Aaron Stump University of Iowa
Geoff Sutcliffe University of Miami
Cesare Tinelli University of Iowa
Andrei Voronkov University of Manchester
Christoph Weidenbach Max Planck Institute for Informatics
Frank Wolter University of Liverpool
14TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF
SATISFIABILITY TESTING (SAT 2011)
PRELIMINARY CALL FOR PAPERS
June 19-22, Ann Arbor, Michigan, U.S.A.
http://www.lri.fr/SAT2011
Associated Workshops: June 18 and June 23
* The International Conference on Theory and Applications of
Satisfiability Testing is the primary annual meeting for researchers
studying the propositional satisfiability problem. SAT 2011
(http://www.lri.fr/SAT2011) is the fourteenth SAT conference and
features the SAT competition, the Pseudo-Boolean evaluation, and the
MAX-SAT evaluation.
* Submissions should contain original material up to 14 page, and use
the Springer LNCS style. All appendices, tables, figures and the
bibliography must fit into the page limit. Submissions deviating from
these requirements may be rejected without review. All accepted papers
will be published in the proceedings of the conference. The conference
proceedings will be published within the Springer LNCS series.
* IMPORTANT DATES
December 17, 2010: Workshop Proposals
February 11, 2011: Abstract Submission
February 18, 2011: Paper Submission
March 18, 2011: Author Notification
April 1, 2011: Final Version
* CALL FOR WORKSHOPS PROPOSALS
Researchers and practitioners are invited to submit proposals for
associated workshops on related topics. Workshops will have to be
financially self-supporting. Proposals should consist of two
parts. First, a short scientific justification of the proposed topic,
its significance, and the particular benefits of the workshop to the
community, as well as a list of previous or related workshops (if
relevant). A second, organizational part should include contact
information of the workshop organizers, procedures for selecting
papers and participants, estimate of the audience size and a tentative
list of the program committee. Proposals are due by December 17, 2010
and must be submitted electronically as a PDF files, by email, to both
SAT Conference Chairs: karem@umich.edu and simon@lri.fr.
* CONFERENCE CHAIRS
Karem A. Sakallah, University of Michigan, USA
Laurent Simon, University of Paris-Sud 11, France
* ASSOCIATED COMPETITIVE EVENTS
SAT Competition 2011
web site:
http://www.satcompetition.org/2011
Organizers:
- Daniel Le Berre
- Matti Jarvisalo
- Olivier Roussel
MAX-SAT Evaluation 2011
web site:
http://maxsat.ia.udl.cat
Organizers:
- Josep Argelich
- Chu-Min Li
- Felip Manya
- Jordi Planes
PB Evaluation 2011
web site:
http://www.cril.univ-artois.fr/PB11
Organizers:
- Vasco Manquinho
- Olivier Roussel
10TH CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS (TLCA 2011)
CALL FOR PAPER
TLCA 2011, 1-3 June 2011, Novi Sad
http://www.rdp2011.uns.ac.rs/tlca/index.html
* The 10th Conference on Typed Lambda Calculi and Applications (TLCA
2011) is a forum for original research in the theory and applications
of typed lambda calculus, broadly construed. Suggested, but not
exclusive, list of topics for submission are:
- Proof-theory: formal reasoning based on type theory, linear
logic and proof nets, type-theoretic aspects of computational complexity
- Semantics: game semantics, realisability, categorical and other models
- Types: dependent types, polymorphism, intersection types and
related approaches (union types, refinement / liquid types,
behavioural types), type inference, types in program analysis and
verification
- Programming: foundational aspects of functional and
object-oriented programming, flow analysis of higher-type computation,
program equivalence (step-indexed, bisimulation and related methods)
* IMPORTANT DATES
26 January 2011: Submission of titles and short abstracts
2 February 2011, 23:00 Greenwich Mean Time:
Strict deadline for submission of 15-page full papers
23 March 2011: Notification of acceptance
3 April 2011: Camera-ready paper versions due
(The above dates are tentative, to be confirmed as soon as possible.)
* Programme Committee Chair
- Luke Ong (Oxford, GB)
* Programme Committee
- Thorsten Altenkirch (University of Nottingham)
- Stefano Berardi (University of Torino)
- Adriana Compagnoni (Stevens Institute of Technology, New Jersey)
- Giles Dowek (Ecole Polytechnique, Paris)
- Silvia Ghilezan (University of Novi Sad)
- Hugo Herbelin (INRIA, Paris)
- Atsushi Igarashi (Kyoto University)
- Ranjit Jhala (UC San Diego)
- Ralph Matthes (CNRS, IRIT)
- Ugo dal Lago (University of Bologna)
- Luke Ong (University of Oxford) (PC Chair)
- Rick Statman (Carnegie Mellon University)
- Tachio Terauchi (Tohoku University)
- Nobuko Yoshida (Imperial College, London)
* TLCA Publicity Chair
- Luca Paolini (Turin)
27TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP 2011)
Theory and Practice of Logic Programming
Lexington, Kentucky, USA, July 6-10, 2011
Submission deadline: Jan 10/17, 2011
http://www.cs.uky.edu/iclp2011/
Call for Papers
* CONFERENCE SCOPE
Since the first conference held in Marseille in 1982, ICLP has been
the premier international conference for presenting research in logic
programming. Contributions are sought in all areas of logic
programming including but not restricted to:
Theory:
Semantic Foundations, Formalisms, Non- monotonic Reasoning,
Knowledge Representation.
Implementation:
Compilation, Memory Management, Virtual Machines, Parallelism.
Environments:
Program Analysis, Transformation, Validation, Verification,
Debugging, Profiling, Testing.
Language Issues:
Concurrency, Objects, Coordination, Mobility, Higher Order,
Types, Modes, Assertions, Programming Techniques.
Related Paradigms:
Abductive Logic Programming, Inductive Logic Programming,
Constraint Logic Programming, Answer-Set Programming.
Applications:
Databases, Data Integration and Federation, Software Engineering,
Natural Language Processing, Web and Semantic Web, Agents, Artificial
Intelligence, Bioinformatics.
* SUBMISSION DETAILS
The four broad categories for submissions are:
(1) technical papers for describing technically sound, innovative
ideas that can advance the state of the art of logic programming;
(2) application papers, where the emphasis will be on their impact on
the application domain;
(3) system and tool papers, where the emphasis will be on the novelty,
practicality, usability and general availability of the systems and
tools described; and
(4) technical communications, aimed at describing recent developments,
new projects, and other materials that are not ready for main
publication as standard papers.
* IMPORTANT DATES
Paper registration (abstract): Jan 10, 2011
Submission deadline: Jan 17, 2011
Notification to authors: Mar 11, 2011
Camera-ready copy due: Apr 15, 2011
Conference: Jul 6-10, 2011
* ICLP’2011 ORGANIZATION
General Chair:
Mirek Truszczynski (University of Kentucky)
Victor Marek (University of Kentucky)
Program Co-chairs:
John Gallagher (Roskilde University, Denmark and IMDEA, Spain)
Michael Gelfond (Texas Tech University, USA)
Workshops Chair:
Joohyung Lee (Arizona State University)
Publicity Chair:
Yuliya Lierler (University of Kentucky)
Doctoral Consortium:
Alessandro Dal Palù (Universit degli Studi di Parma)
Stefan Woltran (Vienna University of Technology)
Prolog Programming Contest:
Tom Schrijvers (K.U. Leuven, Belgium)
THE 5th ALBERTO MENDELZON WORKSHOP ON FOUNDATIONS OF
DATA MANAGEMENT - CALL FOR PAPERS
May 9-12, 2011, Santiago, Chile
http://db.ing.puc.cl/amw2011/
* The Alberto Mendelzon International Workshop on Foundations of Data
Management (AMW) is an initiative of the Latin American community of
researchers in data management, to which our friend, colleague and
mentor Alberto so greatly contributed.
In this way we expect to create a periodical
Latin America-based venue for high level research in the fundamental
aspects of the area. This is a way to honor the memory of Alberto,
and to boost and solidify the research in the region. This event,
as the previous ones, encourages the participation of Latin American
graduate students and develops some activities specially designed for
them.
* We solicit original submissions on foundational aspects of the
following areas (among possibly others) of data management:
computational model theory; constraint databases; data exchange;
data integration; data mining; data modeling;
data management on the Web; data streams; data warehouses;
database algorithms; distributed and parallel databases;
incompleteness; inconsistency; information retrieval;
integrity constraints; knowledge bases; logic;
multimedia; physical design; privacy; provenance;
quantitative approaches; query languages; query optimization;
ontologies; real-time data; recovery; scientific data;
search; security; semi-structured data; sensor data;
services; spatial data; temporal data; transactions;
uncertainty; updates; views; workflows; XML.
* Important Dates:
Paper submission deadline: February 21st, 2011
Notification: March 21st, 2011
* Invited Speakers:
Marcelo Arenas (PUC, Chile)
Hector Garcia-Molina (Stanford U.)
Georg Gottlob (Oxford U.)
* Program Chairs:
Pablo Barcelo (Univ. of Chile)
Val Tannen (Univ. of Pennsylvania)
ACKERMANN AWARD 2010
* The sixth Ackermann Award was to be presented at this CSL'10,
held in Brno, Czech Republic.
* The Jury consisted of
A. Atserias (Barcelona, Spain),
R. Alur (Philadelphia, USA),
J. van Benthem (Amsterdam, The Netherlands),
T. Coquand (Gothenburg, Sweden),
P.-L. Curien (Paris, France),
A. Dawar (Cambridge, U.K., Vice-president of EACSL),
A. Durand (Paris, France),
J.A. Makowsky (Haifa, Israel, Chair of the Jury and Member of the EACSL Board),
D. Niwinski (Warsaw, Poland, President of EACSL) and
G. Plotkin (Edinburgh, U.K., LICS Organizing Committee).
* In spite of the extremely high quality of the nominated theses,
the Jury finally, and almost unamimously, decided
NOT to give an Ackermann Award in 2010.
* The Jury would like to emphasize that this decision does not
imply that the nominations this year were weaker than in the
past. Most of the nominations this year were at the same level as many
of the shortlisted nominations in the previous years. Yet none of them
had the additional extra quality required for the Ackermann Award.
* The full text of the Jury's report may be found
in the Proceedings of CSL'2010 (LNCS vol. 6247) or
at http://www.springerlink.com/index/N660523295512W22.pdf
* The call for nominations for the Ackermann Award 2011
can be found at http://www.eacsl.org/submissionsAck.html
ACKERMANN AWARD 2011 - THE EACSL OUTSTANDING DISSERTATION AWARD
FOR LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS
* Eligible for the 2011 Ackermann Award are PhD dissertations in topics
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution
between 1.1.2009 and 31.12. 2010.
* Submission details are available at
http://www.eacsl.org/submissionsAck.html
* The deadline for submission is March 15, 2011
Nominations can be submitted from January 1, 2011 on,
and should be sent to the secretary of the Jury by e-mail:
janos@cs.technion.ac.il
* The award consists of
- a diploma,
- an invitation to present the thesis at the CSL conference,
- the publication of the abstract of the thesis and the laudation
in the CSL proceedings,
- travel support to attend the conference.
* The 2011 Ackermann Award will be presented to the recipients at the
annual conference of the EACSL (CSL'11) in Bergen (Norway)
to be held 12-15 September 2011,
www.eacsl.org/csl11/
* The jury consists of at least 7 members (additions still likely):
- The president of EACSL, D. Niwinski (Warsaw)
- The vice-president of EACSL, A. Dawar (Cambridge)
- One member of the LICS Steering Committee, NN
- A. Atserias (Barcelona)
- T. Coquand (Goeteborg)
- P.-L. Curien (Paris)
- A. Durand (Paris)
J. Makowsky (Haifa), member of the board of EACSL, will act as the
secretary of the Jury.
* The jury is entitled to give more (and less) than one award per year.
* The previous Ackermann Award recipients were:
2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
2006: Stefan Milius and Balder ten Cate;
2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang;
2008: Krishnendu Chatterjee;
2009: Jakob Nordstrom;
2010: ---- (The Jury decided that no Award is given).
* For the four years 2010-2013,
the Ackermann Award is sponsored by the Kurt Goedel Society
2010 COMPUTER-AIDED VERIFICATION (CAV) AWARD
* The 2010 CAV Award has been awarded to Kenneth L. McMillan of Cadence
Research Laboratories.
* The annual award, which recognizes a specific fundamental
contribution or a series of outstanding contributions to the CAV
field includes a $10,000 award.
* The prize was presented with the citation: "for a series of fundamental
contributions resulting in significant advances in scalability of
model checking tools".
BOOK ANOUNCEMENT:
Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics.
by Andre Platzer.
Springer Verlag, 2010. 426 p.
ISBN 978-3-642-14508-7,
* Hybrid systems are models for complex physical systems and have become a
widely used concept for understanding their behaviour. Many applications are
safety-critical, including car, railway, and air traffic control,
robotics, physical-chemical process control, and biomedical
devices. Hybrid systems analysis studies how we can build
computerised controllers for physical systems which are guaranteed to
meet their design goals.
* This is the first book that leverages the power of logic for hybrid
systems. The author develops a coherent logical approach for
systematic hybrid systems analysis, covering its theory, practice,
and applications. It is further shown how the developed verification
techniques can be used to study air traffic and railway control systems.
* Further information can be found at
http://symbolaris.com/lahs/
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
* Electronic Proceedings in Theoretical Computer Science (EPTCS) was
launched by Rob van Glabbeek in 2009, as an initiative to have
proceedings of all worthy workshops in Theoretical Computer Science
freely available on-line. The papers in the proceedings are simply
entries in the CoRR repository, http://arxiv.org/corr. DOI numbers are
assigned to EPTCS publications, and they are indexed in CrossRef and
in the Directory of Open Access Journals. There is no charge for
authors or workshops/conferences.
* The idea caught on like wildfire, and since EPTCS was launched 30
proceedings were published, and 22 more have been accepted for
publication, see http://forthcoming.eptcs.org.
* Perhaps one of the reasons is that the procedure for submitting a
proposal is very simple, see http://apply.eptcs.org/ and our response
time to a proposal is very fast, usually less than 10 days.
Additionally, thanks to efficient workflow, proceedings usually appear
within 10 days after all the constituents have been delivered.
* We find that it is very important to properly record workshop
proceedings in one, easily searchable place. Also, we want to
contribute in this way to the growing acceptance of the view that all
scientific publications should be freely available on-line.
* We hope that researchers working in Theoretical Computer Science will
follow the example of the many others in accord with the originators
of this idea. Please see http://published.eptcs.org/ for the list of
published workshops.
* The editors,
Rob van Glabbeek (NICTA, Sydney, Australia)
Editor in Chief
Luca Aceto (Reykjavik University)
Rajeev Alur (University of Pennsylvania)
Krzysztof R. Apt (CWI and University of Amsterdam)
Lars Arge (Aarhus University)
Ran Canetti (Tel Aviv University)
Luca Cardelli (Microsoft Research)
Rocco De Nicola (Universita di Firenze)
Jose Luiz Fiadeiro (University of Leicester)
Wan Fokkink (Vrije Universiteit Amsterdam)
Lane A. Hemaspaandra (University of Rochester)
Matthew Hennessy (Trinity College Dublin)
Bartek Klin (Warsaw University, University of Cambridge)
Evangelos Kranakis (Carleton University)
Shay Kutten (Technion)
Nancy Lynch (Massachusetts Institute of Technology)
Aart Middeldorp (University of Innsbruck)
Benjamin Pierce (University of Pennsylvania)
Gordon Plotkin (University of Edinburgh)
Vladimiro Sassone (University of Southampton)
Robert H. Sloan (University of Illinois at Chicago)
Wolfgang Thomas (RWTH Aachen University)
Irek Ulidowski (University of Leicester)
Dorothea Wagner (Universitaet Karlsruhe (TH))
Martin Wirsing (LMU Munich)
Moti Yung (Google Inc. and Columbia University)
Back to the LICS web page.