[FOM] [LICS] LICS Newsletter 142
Andrzej Murawski
martin at eipye.com
Tue Jan 1 19:11:18 EST 2013
Newsletter 142
December 31, 2012
*******************************************************************
* Past issues of the newsletter are available at
http://lii.rwth-aachen.de/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
can be found at
http://lii.rwth-aachen.de/lics/newsletters/inst.html
*******************************************************************
TABLE OF CONTENTS
* DEADLINES
Deadlines in the coming weeks
* LICS-RELATED CALLS
LICS 2013 - Call for Papers
* OTHER CALLS
CADE-24 - Call for Papers
TERMGRAPH 2013 - Call for Papers
CAV 2013 - Call for Papers
DICE 2013 - Call for Papers
PETRI NETS 2013 - Call for Papers
iFM 2013 - Call for Papers
TAMC 2013 - Call for Papers
CONCUR 2013 - Call for Affiliated Workshops
STACS 2013 - Call for Participation
TASE 2013 - Call for Papers
CiE 2013 - Call for Papers
COMPUTATION TOOLS 2013 - Call for Papers
TLCA 2013 - Call for Papers
TAP 2013 - Call for Papers
RTA 2013 - Call for Papers
SAT 2013 - Call for Papers
ASP Competition - Call for Participant Systems
FORTE/FMOODS 2013 - Call for Papers
LOGICA 2013 - Call for Papers
ICALP 2013 - Call for Papers
DBSec 2013 - Call for Papers
CALCO 2013 - Call for Papers
TABLEAUX 2013 - Call for Papers, Tutorials and Workshops
MFPS XXIX - Preliminary Announcement
CONCUR 2013 - Call for Papers
CSL 2013 - Call for Papers
TACL 2013 - Call for Papers
ICLP 2013 - Call for Papers
CMSB 2013 - Call for Papers
FroCoS 2013 - Call for Papers
* AWARD ANNOUNCEMENT
2012 Microsoft Research Verified Software Milestone Award
* BOOK ANNOUNCEMENT
Constructive Logics for Program Correctness by Takayasu Ito
* SYSTEM RELEASE
New DLV release
* JOB ANNOUNCEMENTS
Professorship of Computer Science at Sherbrooke
Assistant Professorships at ETH Zurich
Lectureship at the University of Leicester
Postdoc at the University of Warwick
DEADLINES
* LICS 2013
Title & Short Abstracts: January 7, 2013
Extended Abstracts: January 14, 2013
http://informatik.hu-berlin.de/lics/lics13/
* CADE-24
Abstract submission: January 7, 2013
Paper submission: January 14, 2013
http://www.cade-24.info/
* TERMGRAPH 2013
Paper submission: January 7, 2013
http://termgraph2013.imag.fr
* CAV 2013
Abstract submission: January 10, 2013
Paper submission: January 15, 2013
http://cav2013.forsyte.at/
* DICE 2013
Submission: January 10, 2013
http://dice2013.di.unito.it/
* PETRI NETS 2013
Submission of Papers: January 10, 2013
Submission of Tutorial Proposals: January 10, 2013
http://www.mc3.disco.unimib.it/petrinets2013/
* iFM 2013
Abstract Submission: January 10, 2013
Paper submission: January 17, 2013
http://www.it.abo.fi/iFM2013/
* TAMC 2013
Submission deadline: January 11, 2013
http://www.cs.hku.hk/tamc2013
* CONCUR 2013
Workshop Proposals: January 14, 2013
http://www.concur-conferences.org/concur2013
* STACS 2013
Early registration: January 14, 2013
Regular registration: January 15 - February 14, 2013
Late registration: February 15 - March 2, 2013
Symposium: February 27 - March 2, 2013
http://www.stacs2013.uni-kiel.de
* TASE 2013
Title and abstract submission: January 18, 2013
Paper submission: January 25, 2013
http://www1.aston.ac.uk/tase2013/
* CiE 2013
Submission Deadline for LNCS: January 20, 2013
http://cie2013.disco.unimib.it
* COMPUTATION TOOLS 2013
Submission deadline: January 22, 2013
http://www.iaria.org/conferences2013/COMPUTATIONTOOLS13.html
* TLCA 2013
Paper Registration (titles & short abstracts): January 25, 2013
Full Paper Submission: 1 February 2013
http://www.win.tue.nl/rdp2013/
* TAP 2013
Abstract submission: January 25, 2013
Paper submission: February 1, 2013
http://www.spacios.eu/TAP2013
* RTA 2013
Abstract submission: February 1, 2013
Paper submission: February 5, 2013
http://www.win.tue.nl/rdp2013/
* SAT 2013
Abstract submission: February 1, 2013
Paper submission: February 8, 2013
http://sat2013.cs.helsinki.fi/
* ASP Competition 2013
Participant registration: February 2, 2013
Participant system submission: March 1, 2013
http://aspcomp2013.mat.unical.it/
* FORTE/FMOODS 2013
Abstracts: February 4, 2013
Papers: February 11, 2013
http://forte13.sosy-lab.org/
* LOGICA 2013
Abstract (2 pages): February 14, 2013
http://www.flu.cas.cz/logica
* ICALP 2013
Paper submission: February 15, 2013
http://www.icalp2013.lu.lv
* DBSec 2013
Paper submission: February 15, 2013
http://dbsec2013.business.rutgers.edu/
* CALCO 2013
Abstract Submission: February 22, 2013
Paper Submission: March 1, 2013
http://coalg.org/calco13/
* TABLEAUX 2013
Workshop Proposals: February 22, 2013
Tutorial Proposals: March 23, 2013
Title and Abstract: April 8, 2013
Paper submission deadline: April 15, 2013
http://tableaux13.loria.fr
* MFPS XXIX
Abstract submission: March 25, 2013
Full submission: April 2, 2013
* CONCUR 2013
Abstract submission: April 1, 2013
Paper submission: April 8, 2013
http://concur-conferences.org/concur2013/
* CSL 2013
Abstract submission: April 1, 2013
Paper submission: April 8, 2013
http://csl13.di.unito.it/
* TACL 2013
Abstract submission: April 1, 2013
http://www.math.vanderbilt.edu/~tacl2013/
* ICLP 2013
Abstract submission: April 3, 2013
Paper submission: April 10, 2013
http://www.iclp2013.org
* CMSB 2013
Abstract submission: April 8, 2013
Paper submission: April 15, 2013
http://ist.ac.at/cmsb13
* FroCoS 2013
Abstract submission: April 15, 2013
Paper submission: April 23, 2013
http://frocos2013.loria.fr
28TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2013)
Call for Papers
June 25-28, 2013
New Orleans, USA
http://lii.rwth-aachen.de/lics/lics13/
* LOCATION AND COLOCATION
LICS 2013 will be hosted by Tulane University, in New Orleans,
LA USA, from June 25th to 28th, 2013. LICS 2013 will be
co-located with MFPS13 (23-25 June) and CSF13 (26-28 June).
* SCOPE
The LICS Symposium is an annual international forum on
theoretical and practical topics in computer science that relate
to logic, broadly construed. We invite submissions on topics that
fit under that rubric. Suggested, but not exclusive, topics of
interest include: automata theory, automated deduction,
categorical models and logics, concurrency and distributed
computation, constraint programming, constructive mathematics,
database theory, decision procedures, description logics, domain
theory, finite model theory, theory of automatic structures,
formal aspects of program analysis, formal methods, foundations
of computability, higher-order logic, lambda and combinatory
calculi, linear logic, logic in artificial intelligence, logic
programming, logical aspects of bioinformatics, logical aspects
of computational complexity, logical aspects of quantum
computation, logical frameworks, logics of programs, modal and
temporal logics, model checking, probabilistic systems, process
calculi, programming language semantics, proof theory, real-time
systems, reasoning about security, rewriting, type systems and
type theory, and verification.
* IMPORTANT DATES
Titles & Short Abstracts Due : January 7, 2013
Extended Abstracts Due : January 14, 2013
Author Notification (approximate) : March 22, 2013
* KLEENE AWARD
An award in honor of the late Stephen C. Kleene will be given for
the best student paper(s), as judged by the program committee.
* SPECIAL ISSUES
Full versions of up to three accepted papers, to be selected by
the program committee, will be invited for submission to the
Journal of the ACM. Additional selected papers will be invited to
a special issue of Logical Methods in Computer Science.
* PROGRAM CHAIR
Orna Kupferman, Hebrew University
* PROGRAM COMMITTEE
Parosh A. Abdulla, Uppsala University
Amal Ahmed, Northeastern Universtiy
Sergei Artemov, City University of New York
Andrei Bulatov, Simon Fraser University
Yijia Chen, Shanghai Jiao Tong University
Veronique Cortier, CNRS, Loria
Mariangiola Dezani-Ciancaglini, Univ. di Torino
Thomas Ehrhard, CNRS, Universite Paris Diderot
Javier Esparza, Technische Universitaet Muenchen
Kousha Etessami, University of Edinburgh
Maribel Fernandez, King's College London
Santiago Figueira, University of Buenos Aires
Simon Gay, University of Glasgow
Martin Grohe, Humboldt-Universitaet zu Berlin
Martin Hofmann, LMU Munich
Petr Jancar, Technical University Ostrava
Barbara Jobstmann, CNRS, Verimag and Jasper DA
Patricia Johann, University of Strathclyde
Bakhadyr Khoussainov, The University of Auckland
Antonina Kolokolova, University of Newfoundland
Victor Marek, University of Kentucky
Angelo Morzenti, Politecnico di Milano
Lawrence Moss, Indiana University
Madhavan Mukund, Chennai Math. Institute
Anca Muscholl, Universite Bordeaux
Mogens Nielsen, Aarhus University
Catuscia Palamidessi, INRIA, Ecole Polytechnique
Luc Segoufin, INRIA, ENS Cachan
Natarajan Shankar, SRI International
Alexandra Silva, Radboud University Nijmegen
Balder ten Cate, UC Santa Cruz
Kazushige Terui, Kyoto University
Ron van der Meyden, Univ. of New South Wales
Jeannette M. Wing, Carnegie Mellon University
Nobuko Yoshida, Imperial College London
* CONFERENCE CHAIR
Mike Mislove, Tulane University
* WORKSHOP CHAIR
Patricia Bouyer-Decitre, CNRS, ENS Cachan
* PUBLICITY CHAIR
Andrzej Murawski, University of Leicester
* GENERAL CHAIR
Luke Ong, University of Oxford
24TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-24)
Call for Papers
June 9-14, 2013
Lake Placid, New York, USA
http://www.cade-24.info/
* SCOPE
CADE is the major forum for the presentation of research in all
aspects of automated deduction. The conference program features
invited talks, paper presentations, system descriptions, workshops,
tutorials, and system competitions, including the CADE ATP System
Competition (CASC). CADE-24 invites high-quality submissions on
the general topic of automated reasoning, including foundations,
applications, implementations and practical experiences.
- Logics of interest include: propositional, first-order,
equational, classical, higher-order, non-classical, constructive,
modal, temporal, many-valued, description, meta-logics,
logical frameworks, type theory, set theory, as well as any
combination thereof.
- Paradigms of interest include: theorem proving, model building,
constraint solving, computer algebra, model checking, proof
checking, and their integrations.
- Methods of interest include: resolution, superposition or
paramodulation, completion, saturation, term rewriting,
decision procedures and their combinations, model elimination,
connection method, inverse method, tableaux, induction, proof
planning, sequent calculi, natural deduction, as well as their
supporting algorithms and data structures, including unification,
matching, orderings, indexing, proof presentation and explanation,
and search plans or strategies for inference control, including
semantic guidance and AI-related methods.
- Applications of interest include: analysis, verification and
synthesis of software and hardware, formal methods, computer
mathematics, computational logic, declarative programming,
knowledge representation, deductive databases, natural language
processing, computational linguistics, ontology reasoning,
robotics, planning, and other areas of artificial intelligence.
* PUBLICATION AND SUBMISSION
The proceedings of the conference will be published in the
Springer LNAI/LNCS series. Submissions can be made in the
categories 'regular paper' (max 15 pages) and 'system
description' (max 7 pages). Full system descriptions that
provide in-depth presentation of original ideas in an
implemented system can be submitted as regular papers.
The page for electronic submission via EasyChair is
https://www.easychair.org/conferences/?conf=cade24.
* IMPORTANT DATES
Title and abstract must be submitted before the paper.
Abstract submission: 7 January 2013
Paper submission: 14 January 2013
Notification: 11 March 2013
Final version: 1 April 2013
Workshops and Tutorials: 9-10 June 2013
Competitions: 9-14 June 2013
Conference: 11-14 June 2013
* CONFERENCE CO-CHAIRS
Christopher A. Lynch Clarkson University
Neil V. Murray University at Albany - SUNY
* PROGRAM COMMITTEE CHAIR
Maria Paola Bonacina Universita degli Studi di Verona
* WORKSHOP AND COMPETITION CHAIR
Christoph Benzmueller Freie Universitaet Berlin
* TUTORIAL CHAIR
Peter Baumgartner NICTA and Australian National University
* PUBLICITY AND WEB CHAIR
Grant Olney Passmore Cambridge University and Edinburgh University
* PROGRAM COMMITTEE
Alessandro Armando Universita degli Studi di Genova & FBK
Trento, Italy
Peter Baumgartner NICTA & Australian National University,
Australia
Christoph Benzmueller Freie Universitaet Berlin, Germany
Maria Paola Bonacina Universita degli Studi di Verona, Italy
(Chair)
Cristina Borralleras Universitat de Vic, Spain
Thierry Boy De La Tour Universite de Grenoble, France
Evelyne Contejean CNRS & Universite de Paris-Sud, France
Leonardo De Moura Microsoft Research, USA
Stephanie Delaune Ecole Nationale Superieure de Cachan, France
Clare Dixon University of Liverpool, UK
Pascal Fontaine Universite de Lorraine & LORIA, France
Ulrich Furbach Universitaet Koblenz-Landau, Germany
Ruben Gamboa University of Wyoming, USA
Juergen Giesl RWTH Aachen, Germany
Paul B. Jackson University of Edinburgh, UK
Predrag Janicic Univerzitet u Beogradu, Serbia
Helene Kirchner INRIA Rocquencourt, France
Konstantin Korovin University of Manchester, UK
K. Rustan M. Leino Microsoft Research, USA
Christopher A. Lynch Clarkson University, USA
Cesar A. Munoz NASA Langley, USA
Neil V. Murray University at Albany - SUNY , USA
Lawrence C. Paulson University of Cambridge, UK
Frank Pfenning Carnegie Mellon University, USA
Brigitte Pientka McGill University, Canada
David A. Plaisted University of North Carolina at Chapel
Hill, USA
Christophe Ringeissen LORIA & INRIA Nancy-Grand Est, France
Ulrike Sattler University of Manchester, UK
Renate A. Schmidt University of Manchester, UK
Manfred Schmidt-Schauss Johann Wolfgang Goethe Universitaet, Germany
Stephan Schulz Technische Universitaet Muenchen, Germany
Viorica Sofronie-Stokkermans Universitaet Koblenz-Landau, Germany
Ashish Tiwari SRI International, USA
Uwe Waldmann MPI fuer Informatik, Germany
Christoph Weidenbach MPI fuer Informatik, Germany
Jian Zhang Chinese Academy of Sciences, P.R. China
7TH INTERNATIONAL WORKSHOP ON COMPUTING WITH TERMS AND GRAPHS (TERMGRAPH
2013)
Call for Papers
Rome, Italy
March 23rd, 2013 (Part of ETAPS 2013)
http://termgraph2013.imag.fr
* AIMS AND SCOPE
Research in term and graph rewriting ranges from theoretical questions
to practical issues. Computing with graphs handles the sharing of
common subexpressions in a natural and seamless way, and improves the
efficiency of computations in space and time. Sharing is ubiquitous
in several research areas, for instance : the modelling of first- and
higher-order term rewriting by (acyclic or cyclic) graph rewriting,
the modelling of biological or chemical abstract machines, the
implementation techniques of programming languages: many
implementations of functional, logic, object-oriented, concurrent and
mobile calculi are based on term graphs. Term graphs are also used in
automated theorem proving and symbolic computation systems working on
shared structures.
The aim of this workshop is to bring together researchers working in
different domains on term and graph transformation and 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
term graph rewriting.
* ETAPS
TERMGRAPH 2013 is a one-day satellite event of ETAPS 2013, which will
take place in Rome, Italy, from March 16 to March 24, 2013. Previous
editions of the TERMGRAPH workshop series (http://www.termgraph.org.uk/)
took place in Barcelona (2002), in Rome (2004), in Vienna (2006), in
Braga (2007) in York (2009) and in SaarbrŸcken (2011).
* IMPORTANT DATES
December 20, 2012 Abstract submission
January 7, 2013 Paper submission
January 25, 2013 Notification of acceptance
February 10, 2013 Proceedings version due
* TOPICS
Topics of interest are open and include all aspects of term graphs and
sharing of common subexpressions in rewriting, programming, automated
reasoning and symbolic computation. This includes (but is not limited
to): term rewriting, graph transformation, graph-based implementations
of lambda-calculus, programming languages, models of computation,
graph-based languages, semantics and implementation of programming
languages, compiler construction, pattern recognition, databases,
bioinformatics, and system descriptions.
* SUBMISSION AND PUBLICATION
Authors are invited to submit either regular papers (up to 15 pages),
or position papers, system descriptions, work in progress, extended
abstracts (5-7 pages), via the EasyChair system, at URL
https://www.easychair.org/conferences/?conf=termgraph2013
Submissions should be in PDF format, using the EPTCS style files
(http://style.eptcs.org/). The Proceedings will be published in
Electronic Proceedings in Theoretical Computer Science (EPTCS).
* PROGRAM COMMITTEE
Patrick Bahr, University of Copenhagen, Denmark
Paolo Baldan, University of Padova, Italy
Andrea Corradini, University of Pisa, Italy
Frank Drewes, Umea University, Sweden
Rachid Echahed (co-chair), CNRS and University of Grenoble, France
Maribel Fernandez, King's College London, UK
Clemens Grabmayer, Utrecht University, the Netherlands
Wolfram Kahl, McMaster University, Canada
Ian Mackie, Ecole Polytechnique, France
Detlef Plump (co-chair), University of York, UK
* ORGANIZERS
Rachid Echahed, CNRS and University of Grenoble, France
Detlef Plump, University of York, UK
25TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION (CAV 2013)
Call for Papers
St. Petersburg, Russia
July 13-19, 2013
http://cav2013.forsyte.at/
* SCOPE
The conference on Computer Aided Verification (CAV), 2013, is the 25th
in a series dedicated to the advancement of the theory and practice of
computer-aided formal analysis methods for hardware and software
systems. CAV considers it vital to continue spurring advances in
hardware and software verification while expanding to new domains such
as biological systems and computer security. The conference covers the
spectrum from theoretical results to concrete applications, with an
emphasis on practical verification tools and the algorithms and
techniques that are needed for their implementation. The proceedings
of the conference will be published in the Springer-Verlag Lecture
Notes in Computer Science series. A selection of papers will be
invited to a special issue of Formal Methods in System Design and the
Journal of the ACM.
* TOPICS
- Algorithms and tools for verifying models and implementations
- Hardware verification techniques
- Deductive, compositional, and abstraction techniques for verification
- Program analysis and software verification
- Verification methods for parallel and concurrent hardware/software
systems
- Testing and runtime analysis based on verification technology
- Applications and case studies in verification
- Decision procedures and solvers for verification
- Mathematical and logical foundations of practical verification tools
- Verification in industrial practice
- Algorithms and tools for system synthesis
- Hybrid systems and embedded systems verification
- Verification techniques for security
- Formal models and methods for biological systems
* IMPORTANT DATES
Abstract submission due: January 10, 2013;
Paper submission (firm): January 15, 2013 anywhere on earth;
Author feedback/rebuttal period: February 20-22, 2013;
Notification of acceptance/rejection: March 6, 2013;
Final version due: April 6, 2013
4TH WORKSHOP ON DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY (DICE 2013)
Call for Papers
Rome, Italy
March 16-17, 2013 (satellite event of ETAPS 2013)
http://dice2013.di.unito.it/
* IMPORTANT DATES:
submission: January 10, 2013
notification: January 25, 2013
final version due: February 14, 2013
* INVITED
- Jean-Yves Marion (Loria - INPL Nancy)
- Marko van Eekelen (Open University - Radboud University Nijmegen)
- Paul-Andre Mellies (PPS, Paris)
* SCOPE
The area of Implicit Computational Complexity (ICC) has grown out
from several proposals to use logic and formal methods to provide
languages for complexity-bounded computation (e.g. Ptime, Logspace
computation). It aims at studying computational complexity without
referring to external measuring conditions or a particular machine
model, but only by considering language restrictions or logical/
computational principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather
than descriptive methods). In this approach one relates complexity
classes to restrictions on programming paradigms (functional
programs, lambda calculi, rewriting systems), such as ramified
recurrence, weak polymorphic types, linear logic and linear types,
and interpretative measures. The two main objectives of this area
are:
- to find natural implicit characterizations of various complexity
classes of functions, thereby illuminating their nature and
importance;
- to design methods suitable for static verification of program
complexity. Therefore ICC is related on the one hand to the
study of complexity classes, and on the other hand to static
program analysis.
The workshop will be open to contributions on various aspects of
ICC including (but not exclusively):
- types for controlling complexity,
- logical systems for implicit computational complexity,
- linear logic,
- semantics of complexity-bounded computation,
- rewriting and termination orderings,
- interpretation-based methods for implicit complexity,
- programming languages for complexity-bounded computation,
- application of implicit complexity to other programming paradigms
(e.g. imperative or object-oriented languages).
* SUBMISSIONS
Authors are invited to submit an extended abstract, up to 5 pages.
Abstracts should be written in English, in the form of a PDF file
uploaded to DICE 13 page at Easychair
https://www.easychair.org/account/signin.cgi?conf=dice2013.
Submissions of abstracts by PC members are allowed and encouraged.
We plan on not having pre-proceedings; an open call for
post-proceedings, hopefully as special issue of a journal, will follow.
* PROGRAM COMMITTEE:
- Roberto Amadio (Paris-Diderot)
- Harry Mairson (Brandeis)
- Virgile Mogbil (Paris 13)
- Simona Ronchi Della Rocca (Torino) (Chair)
- Luca Roversi (Torino)
- Olha Shkaravska (Nijmegen)
- Ulrich Schoepp (LMU)
- Aleksy Shubert (Warsaw)
- Jakob G. Simonsen (DIKU)
34TH INTERNATIONAL CONFERENCE ON APPLICATION AND THEORY OF PETRI NETS AND
CONCURRENCY (PETRI NETS 2013)
Call for Papers
Milano, Italy
June 24-28, 2013
http://www.mc3.disco.unimib.it/petrinets2013/
* SCOPE
The 34th annual international Petri Net conference will be organised
by the Department of Computer Science, Systems and Communication
(DISCo), University of Milano - Bicocca. The conference takes place
under the auspices of the EATCS, and GI SIG "Petri Nets and Related
System Models". The language of the conference is English, and its
proceedings will be published by Springer-Verlag in Lecture Notes in
Computer Science. All accepted papers will be considered for the
"Outstanding Paper" award(s). Papers presenting original research on
application or theory of Petri nets, as well as contributions
addressing topics relevant to the general field of distributed and
concurrent systems are sought.
* IMPORTANT DATES
Submission of Papers: January 10, 2013
Submission of Tutorial Proposals: January 10, 2013
Notification: March 1, 2013
Final Version Due: April 1, 2013
Participation in Tool Exhibition: June 1, 2013
Workshops & Tutorials: June 24-25, 2013
Conference: June 26-28, 2013
The deadline for submission of papers is STRICT.
However, if you submit the title page by January 10
it is sufficient to submit the full paper by January 15.
* TOPICS
+ Topics specific to Petri Nets
- System design using nets
- Analysis and synthesis, structure and behaviour of nets
- Relationships between Petri Nets and other approaches
- Net-based semantical, logical and algebraic calculi
- Symbolic net representation (graphical or textual)
- Computer tools for nets
- Experience with using nets, case studies
- Higher-level net models
- Timed and stochastic nets
- Standardisation of nets
- Experience reports describing applications of nets to different
kinds of systems and application fields, e.g.:
- flexible manufacturing systems
- office automation
- real-time systems
- workflows
- embedded systems
- supervisory control
- defence systems
- protocols and networks
- biological systems
- Internet
- health and medical systems
- e-commerce and trading
- environmental systems
- programming languages
- hardware
- performance evaluation
- telecommunications
- operations research
- railway networks
+ General topics related to concurrency
- Model checking and verification of distributed systems
- Verification of infinite-state or parametric systems
- Causality/partial order theory of concurrency
- Educational issues related to concurrency
- New issues and developments in the theory of concurrency
- Modelling of hardware and biological systems
* PAPER SUBMISSIONS
Two kinds of papers can be submitted:
- regular papers (max 20 pages) describing original results
pertaining to the development of the theory of Petri Nets and
distributed and concurrent systems in general, new results
extending the applicability of Petri Nets, or case studies, application
and experience reports pertinent to the practical use of Petri Nets and
concurrency. For papers describing the experiences from applications
of Petri Nets, authors are encouraged to consult the document:
ApplicationFormat.pdf (available at
www.informatik.uni-hamburg.de/TGI/sc-info/docs/ApplicationFormat.pdf)
- tool papers (max 10 pages) describing a computer tool based on
Petri Nets (not an application of the tool or the theory behind the
tool).
For more information, please see the document: ToolFormat.pdf
(available at
www.informatik.uni-hamburg.de/TGI/sc-info/docs/ToolFormat.pdf).
The tool should be available for use by other groups (but not
necessarily for free). The submission should indicate how the
reviewers can get access to the tool (this must be for free).
The tool will be demonstrated in the Tool Exhibition, in addition to
being presented in a conference talk.
Submitted papers must:
- be contributions that have neither already been published nor are
simultaneously being considered for publication in a peer-reviewed
forum;
- clearly state the problem being addressed, the goal of the work, the
results achieved, and the relation to other work;
- be in English and in the Springer LNCS-format:
http://www.springer.de/comp/lncs/authors.html;
- adhere to the page limit for the relevant category (see above);
- be sent electronically (as a PDF file) no later than the above
mentioned deadlines using the website
http://www.easychair.org/conferences/?conf=petrinets2013.
* PROGRAM COMMITTEE CO-CHAIRS
José Manuel Colom, Spain
Joerg Desel, Germany
* WORKSHOP AND TUTORIAL CO-CHAIRS
Serge Haddad, France
Alex Yakovlev, UK
* ORGANISING COMMITTEE CHAIR
Lucia Pomello, Italy
* PUBLICITY CHAIRS
Luca Bernardinello, Italy
Lucia Pomello, Italy
* PROGRAM COMMITTEE
H. Alla, France
M. Beccuti, Italy
J. Billington, Australia
J. Carmona, Spain
G. Ciardo, USA
J.M. Colom, Spain (co-chair)
P. Darondeau, France
J. Desel, Germany (co-chair)
R. Devillers, Belgium
Z. Duan, China
J. Esparza, Germany
M.P. Fanti, Italy
L. Gomes, Portugal
S. Haddad, France
H. Hansen, Singapore
K. Hiraishi, Japan
V. Khomenko, UK
E. Kindler, Denmark
H. Klaudel, France
J. Kleijn, The Netherlands
R. Lazic, UK
C. Lin, China
N. Lohmann, Germany
I. Lomazova, Russia
A. Miner, USA
L. Pomello, Italy
W. Reisig, Germany
C. Seatzu, Italy
C. Stahl, The Netherlands
S. Taoka, Japan
A. Valmari, Finland
M. Westergaard, The Netherlands
10TH INTERNATIONAL CONFERENCE ON INTEGRATED FORMAL METHODS (iFM 2013)
Call for Papers
Turku, Finland
June 10-14, 2013
http://www.it.abo.fi/iFM2013/
* OBJECTIVES AND SCOPE
Applying formal methods may involve modeling different aspects
of a system which are best expressed using different formalisms.
Correspondingly, different analysis techniques may be used to examine
different system views, different kinds of properties, or
simply in order to cope with the sheer complexity of the system.
The iFM conference series seeks to further research into hybrid
approaches to formal modeling and analysis; i.e., the combination of
(formal and semi-formal) methods for system development, regarding
modeling and analysis, and covering all aspects from language design
through verification and analysis techniques to tools and their
integration into software engineering practice.
* TOPICS
Areas of interest include but are not limited to:
- Formal and semiformal modelling notations;
- Integration of formal methods into software engineering practice;
- Refinement;
- Theorem proving;
- Tools;
- Logics;
- Model checking;
- Model transformations;
- Semantics;
- Static Analysis;
- Type Systems;
- Verification;
- Case Studies;
- Experience reports
* SUBMISSION GUIDELINES
iFM 2013 solicits high quality papers reporting research results and/or
experience reports related to the overall theme of method integration.
The conference proceedings will be published by Springer Lecture Notes
in Computer Science series. All papers must be original, unpublished,
and not submitted for publication elsewhere.
* INVITED SPEAKERS
- Jean-Raymond Abrial, Marseille, France
- Cosimo Laneve, University of Bologna, Italy
- Susanne Graf, VERIMAG, France
- Kim Larsen, Aalborg University, Denmark
* SPECIAL ISSUES
To celebrate the 10th edition of iFM, special issues of two prominent
Springer journals are agreed upon:
- Formal Aspects of Computing
- Software and Systems Modeling
* IMPORTANT DATES
- Abstract Submission: January 10, 2013
- Paper submission: January 17, 2013
- Paper notification: March 11, 2013
- Final version paper: March 31, 2013
* iFM PROGRAMME COMMITTEE CHAIRS:
- Einar Broch Johnsen, University of Oslo, Norway
- Luigia Petre, Abo Akademi University, Finland
* iFM 2013 ORGANIZING COMMITTEE CHAIR
Luigia Petre, Abo Akademi University, Finland
10TH ANNUAL CONFERENCE ON THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
(TAMC 2013)
Call for Papers
University of Hong Kong, Pokfulam, Hong Kong
May 20-22, 2013
http://www.cs.hku.hk/tamc2013/
* AIMS AND SCOPE
TAMC aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of
the conference are computability, complexity, and algorithms.
* TOPICS
Typical but not exclusive topics of interest include:
- algebraic computation
- algorithmic coding theory
- algorithmic number theory
- approximation algorithms
- automata theory
- circuit complexity
- computability
- computational biology, and biological computing
- computational complexity
- computational game theory
- computational logic
- computational geometry
- continuous and real computation
- cryptography
- data structures
- design and analysis of algorithms
- distributed algorithms
- fixed parameter tractability
- graph algorithms
- information and communication complexity
- learning theory
- natural computation
- network algorithms, networks in nature and society
- online algorithms
- optimization
- parallel algorithms
- privacy and security
- property testing
- proof complexity
- quantum computing
- randomness, pseudo-randomness
- randomized algorithms
- streaming algorithms
* IMPORTANT DATES
Submission deadline : 11:59 pm EST January 11, 2013
Notification of authors : late February or early March, 2013
Final versions deadline : to be announced soon
* PROCEEDINGS
The TAMC proceedings will be published in the Lecture Notes in
Computer Science Series by Springer (http://www.springer.com/lncs).
Authors of accepted papers are expected to present their work
at the conference.
* POST CONFERENCE PUBLICATIONS
Special issues of the journals Theoretical Computer Science and
Mathematical Structures in Computer Science devoted to a
selected set of accepted papers of the conference are planned.
24TH CONFERENCE ON CONCURRENCY THEORY (CONCUR 2013)
Call for Affiliated Workshops
Buenos Aires, Argentina
August 26-31, 2013
http://concur-conferences.org/concur2013/
* GENERAL
CONCUR 2013 will be co-located with the 10th International
Conference on Quantitative Evaluation of SysTems (QEST),
the 11th International Conference on Formal Modeling and
Analysis of Timed Systems (FORMATS) and the 8th International
Symposium on Trustworthy Global Computing (TGC).
* TOPICS
Researchers and practitioners are invited to submit proposals
for workshops to be affiliated to CONCUR 2013, on topics related
to concurrency theory and its applications. Example topics include:
semantics, logics, verification techniques for concurrent systems,
cross-fertilization between industry and academia, and
opportunities for young and prospective researchers.
Past CONCUR conferences have been accompanied by successful
workshops on a variety of topics, such as formal and foundational
methods, models of systems (biological, timed), security issues,
semantical issues, and verification methods. See the
following links for examples of past workshops:
http://conferences.ncl.ac.uk/concur-2012/workshops.html
http://concur2011.rwth-aachen.de/workshops
http://concur2010.inria.fr/workshops
http://concur09.cs.unibo.it/satevents.html
The purpose of the workshops is to provide participants with
a friendly, interactive atmosphere for presenting novel ideas
and discussing their application.
The workshops take place on Monday, August 26th and Saturday,
August 31st, 2013.
* PROPOSALS
Proposals should include:
- The name and the preferred date of the proposed workshop.
- Proposed workshop duration.
- A short scientific summary of the topic, its scope and
significance, including a discussion on the relation with
CONCUR topics.
- If applicable, a description of past versions of the workshop,
including dates, organizers, submission and acceptance counts,
and attendance.
- Procedures for selecting papers and/or talks, plans for
dissemination (for example, proceedings and special issues of
journals), and the expected number of participants.
* IMPORTANT DATES
Workshop proposals due: January 14, 2013
Notification of acceptance: January 21, 2013
Workshops: August 26 and August 3, 2013
Submissions to: Eduardo Bonelli (ebonelli at unq.edu.ar) and
Diego Garbervetsky (diegog at dc.uba.ar).
* The CONCUR organization offers:
- Link from the CONCUR web site.
- Setup of meeting space, and related equipment.
- Coffee-breaks.
- Lunches.
- On-line and on-site registration to the workshop.
- One free workshop registration (for an invited speaker)
The main responsibility of organizing a workshop goes to the workshop
chairperson(s), including:
- Workshop publicity (possibly including call for papers,
submission and review process).
- Scheduling workshop activities in collaboration with the
CONCUR workshop chairs.
30TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
(STACS 2013)
Call for Participation
February 27- March 2, 2013
Kiel, Germany
http://www.stacs2013.uni-kiel.de
* SCIENTIFIC PROGRAM
The program, which is available at
http://www.stacs2013/uni-kiel.de/ ,
is composed of 54 contributed and three invited talks as well
as a tutorial.
* INVITED TALKS AND TUTORIAL
- Kousha Etessami, University of Edinburgh
The complexity of analyzing infinite-state Markov chains,
Markov decision processes, and stochastic games
- Kurt Mehlhorn, MPI Saarbrücken and Saarland University
Physarum can compute shortest paths
- Stéphan Thomassé, Ecole Normale Supérieure de Lyon
Graph Coloring, Communication Complexity and the Stubborn Problem
- Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial)
Algorithmic Graph Structure Theory
* REGISTRATION
Registration is through the conference website,
http://www.stacs2013.uni-kiel.de/ .
* IMPORTANT DATES
Early registration deadline: Jan 14, 2013
Regular registration: Jan 15 - Feb 14, 2013
Late registration: Feb 15 - Mar 2, 2013
Symposium: Feb 27 - Mar 2, 2013
* CONTACT INFORMATION
info at stacs2013.uni-kiel.de
7TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING
(TASE 2013)
Call for Papers
Aston University Conference Centre, Birmingham, UK
July 1-3, 2013
http://www.aston.ac.uk/tase2013
* OVERVIEW
Software engineering is at the heart of many state of the art
tools designed to simplify and improve our lives, including
cloud computing applications, the semantic web and self-configuring
systems. As these instruments are involved in fields of vital
importance, by providing customised solutions for education,
businesses, government and health care, the role played by the
theory behind their working principles bears an undeniable weight.
In this context, the TASE International Symposium strives to provide
top scientists with a framework for communicating their latest and
most valuable theoretical results in the field of software engineering.
* SUBJECT AREAS
We invite contributions concerning the theoretical aspects of the
following areas (please note that this is not an exhaustive list):
- model driven software engineering
- component based software engineering
- service oriented and cloud computing
- semantic web and web services
- software security, reliability, simulation and verification
- probabilistic fundamentals of software engineering
- embedded and real time software systems
- program logics and underlying mathematical issues
- aspect, rule and object oriented software design
- self-configuring software systems
- reverse engineering
* SUBMISSIONS
We invite all prospective authors to submit their manuscripts
via the TASE13 portal, hosted on Easychair at:
https://www.easychair.org/conferences/?conf=tase2013
* IMPORTANT DATES
Title and abstract submission: 18 January 2013
Paper submission: 25 January 2013
Acceptance/rejection notification: 22 March 2013
Camera-ready version submission: 26 April 2013
COMPUTABILITY IN EUROPE (CiE 2013)
The Nature of Computation
Logic, Algorithms, Applications
Call for Papers
Milan, Italy
July 1-5, 2013
http://cie2013.disco.unimib.it
* HISTORY
CiE 2013 is the ninth conference organised by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world. Previous meetings have taken place in Amsterdam (2005),
Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
Dalgada (2010), Sofia (2011) and Cambridge (2012).
* IMPORTANT DATES:
Submission Deadline for LNCS: 20 January 2013
Notification of authors: 4 March 2013
Deadline for final revisions: 1 April 2013
* The Nature of Computation is meant to emphasize the special focus of
CIE13 on the unexpected and strong changes that studies on Nature have
brought in several areas of mathematics, physics, and computer science.
Starting from Alan Turing, research on Nature with a computational
perspective has produced novel contributions, giving rise even to new
disciplines.
Two complementary research perspectives pervade the Nature of
Computation theme. One is focused on the understanding of new
computational paradigms inspired by the processes occurring in the
biological world, while focusing on a deeper and modern understanding of
the theory of computation. The other perspective is on our understanding
of how computations really occur in Nature, on how we can interact with
those computations, and on their applications.
* TOPICS
CiE 2013 conference topics include, but not exclusively:
- Admissible sets
- Algorithms
- Analog computation
- Artificial intelligence
- Automata theory
- Bioinformatics
- Classical computability and degree structures
- Cognitive science and modelling
- Complexity classes
- Computability theoretic aspects of programs
- Computable analysis and real computation
- Computable structures and models
- Computational and proof complexity
- Computational biology
- Computational creativity
- Computational learning and complexity
- Computational linguistics
- Concurrency and distributed computation
- Constructive mathematics
- Cryptographic complexity
- Decidability of theories
- Derandomization
- DNA computing
- Domain theory and computability
- Dynamical systems and computational models
- Effective descriptive set theory
- Emerging and Non-standard Models of Computation
- Finite model theory
- Formal aspects of program analysis
- Formal methods
- Foundations of computer science
- Games
- Generalized recursion theory
- History of computation
- Hybrid systems
- Higher type computability
- Hypercomputational models
- Infinite time Turing machines
- Kolmogorov complexity
- Lambda and combinatory calculi
- L-systems and membrane computation
- Machine learning
- Mathematical models of emergence
- Molecular computation
- Morphogenesis and developmental biology
- Multi-agent systems
- Natural Computation
- Neural nets and connectionist models
- Philosophy of science and computation
- Physics and computability
- Probabilistic systems
- Process algebras and concurrent systems
- Programming language semantics
- Proof mining and applications
- Proof theory and computability
- Proof complexity
- Quantum computing and complexity
- Randomness
- Reducibilities and relative computation
- Relativistic computation
- Reverse mathematics
- Semantics and logic of computation
- Swarm intelligence and self-organisation
- Type systems and type theory
- Uncertain Reasoning
- Weak systems of arithmetic and applications
We particularly welcome submissions in emergent areas, such as
bioinformatics and natural computation, where they have a basic
connection with computability.
4TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL LOGICS, ALGEBRAS,
PROGRAMMING, TOOLS AND BENCHMARKING (COMPUTATION TOOLS 2013)
Call for Papers
May 27 - June 1, 2013
Valencia, Spain
http://www.iaria.org/conferences2013/COMPUTATIONTOOLS13.html
* SUBMISSIONS
- regular papers
- short papers (work in progress)
- posters
Submission page:
http://www.iaria.org/conferences2013/SubmitCOMPUTATIONTOOLS13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Please note the Poster and Work in Progress options.
* TOPICS
The topics suggested by the conference can be discussed in
term of concepts, state of the art, research, standards,
implementations, running experiments, applications, and
industrial case studies. Authors are invited to submit complete
unpublished papers, which are not under review in any other
conference or journal in the following, but not limited to,
topic areas.
All tracks are open to both research and industry contributions,
in terms of Regular papers, Posters, Work in progress,
Technical/marketing/business presentations, Demos, Tutorials,
and Panels.
Before submission, please check and conform with the Editorial rules:
http://www.iaria.org/editorialrules.html
* DETAILS
http://www.iaria.org/conferences2013/COMPUTATIONTOOLS13.html
11TH INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS
(TLCA 2013)
Call for Papers
Eindhoven, 23-28 June 2013
co-located with RTA 2013 as part of RDP 2013
http://www.win.tue.nl/rdp2013/
* SCOPE
The 11th International Conference on Typed Lambda Calculi
and Applications (TLCA 2013) 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: natural deduction, sequent calculi, cut elimination
and normalization, propositions as types, linear logic and proof
nets, type-theoretic aspects of computational complexity
- Semantics: denotational semantics, game semantics, realisability,
domain theory, categorical models
- Types: subtypes, dependent types, polymorphism, intersection types
and related approaches, type inference and type checking, types in
program analysis and verification, types in proof assistants
- Programming: foundational aspects of functional programming,
object-oriented programming and other programming paradigms,
flow analysis of higher-type computation, program equivalence,
program transformation and optimization
* IMPORTANT DATES
- Paper Registration (titles & short abstracts): 25 January 2013
- Full Paper Submission: 1 February 2013
- Author Notification: 22 March 2013
- Camera-Ready Paper for the Proceedings: 12 April 2013
* SUBMISSION GUIDELINES
We solicit submissions of research papers, which must:
- be in English and not exceed 15 pages (including figures and
bibliography). Additional material intended for the reviewers
but not for publication in the final version - for example
details of proofs - may be placed in a clearly marked appendix
that is not included in the page limit. Reviewers will be told
that they may choose to ignore the appendix.
- present original research which is unpublished and not submitted
elsewhere (conferences, journals, books, etc.)
- use the Springer-Verlag LNCS style.
- be submitted electronically in PDF via the EasyChair TLCA 2013
Submission Webpage (will open nearer the deadline)
https://www.easychair.org/conferences/?conf=tlca2013.
Submissions deviating from these instructions may be rejected
without review. A condition of submission is that, if accepted,
one of the authors must attend the conference to give the
presentation. The proceedings will be published as a volume
in the ARCoSS subline series of Springer-Verlag Lecture Notes in
Computer Science. Final papers will be in the format specified by
Springer-Verlag. Any questions regarding the submission guidelines
should be directed to the Programme Committee Chair
(Masahito Hasegawa <hassei at kurims.kyoto-u.ac.jp>) prior to
submitting.
* COLOCATED EVENTS
TLCA 2013 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2013), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2013) and several related events. Details on
workshops affiliated with RDP 2013 will be available at the web
site in due course.
* CONFERENCE CHAIR
Herman Geuvers (Radboud University Nijmegen, Netherlands)
* PROGRAMME COMMITTEE CHAIR
Masahito Hasegawa (Kyoto University, Japan)
* PROGRAMME COMMITTEE
Andreas Abel (LMU Munchen, Germany)
Patrick Baillot (CNRS and ENS Lyon, France)
Nick Benton (Microsoft Cambridge, UK)
Lars Birkedal (IT University of Copenhagen, Denmark)
Herman Geuvers (Radboud University Nijmegen, Netherlands)
Masahito Hasegawa (Kyoto University, Japan) (PC chair)
Naoki Kobayashi (University of Tokyo, Japan)
Paul-Andre Mellies (CNRS and Universite Paris Diderot, France)
Thomas Streicher (TU Darmstadt, Germany)
Lorenzo Tortora de Falco (Universita Roma Tre, Italy)
Stephanie Weirich (University of Pennsylvania, US)
* TLCA PUBLICITY CHAIR
Luca Paolini (Universita di Torino, Italy)
7TH INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013)
Call for Papers
Budapest, Hungary
June 17-21, 2013
http://www.spacios.eu/TAP2013
* SCOPE
The TAP conference is devoted to the synergy of proofs and tests,
to the application of techniques from both sides and their
combination for the advancement of software quality. Testing and
proving seem to be contradictory techniques: once you have proved
your program to be correct then additional testing seems pointless;
on the other hand, when such a proof in not feasible, then testing
the program seems to be the only option. This view has dominated
the research community since the dawn of computer science, and has
resulted in distinct communities pursuing the seemingly orthogonal
research areas. However, the development of both approaches has
lead to the discovery of common issues and to the realization of
potential synergy. Perhaps, use of model checking in testing was
one of the first signs that a counterexample to a proof may be
interpreted as a test case. Recent breakthroughs in deductive
techniques such as satisfiability modulo theories, abstract
interpretation, and interactive theorem proving, have paved the way
for new and practically effective methods of powering testing
techniques. Moreover, since formal, proof-based verification is
costly, testing invariants and background theories can be helpful
to detect errors early and to improve cost effectiveness. Summing up,
in the past few years an increasing number of research efforts have
encountered the need for combining proofs and tests, dropping
earlier dogmatic views of incompatibility and taking instead the
best of what each of these software engineering domains has to offer.
The TAP conference aims to bring together researchers and practitioners
working in the converging fields of testing and proving, and will offer
a generous allocation of papers, panels and informal discussions.
* TOPICS
Topics of interest cover theory definitions, tool constructions and
experimentations, and include (other topics related to TAP are welcome):
- Bridging the gap between concrete and symbolic techniques, e.g.
using proof search in satisfiability modulo theories solvers to
enhance various testing techniques
- Transfer of concepts from testing to proving (e.g., coverage criteria)
and from proving to testing
- Program proving with the aid of testing techniques
- New problematics in automated reasoning emerging from specificities of
test generation
- Verification and testing techniques combining proofs and tests
- Generation of test data, oracles, or preambles by deductive techniques
such as: theorem proving, model checking, symbolic execution,
constraint logic programming
- Model-based testing and verification
- Generation of specifications by deduction
- Automatic bug finding
- Debugging of programs combining static and dynamic analysis
- Formal frameworks
- Tool descriptions and experience reports
- Case studies combining tests and proofs
- Domain specific applications of testing and proving to new application
domains such as validating security protocols, vulnerability detection
of programs, security
* IMPORTANT DATES
Abstract submission: January 25, 2013
Paper submission: February 1, 2013
Notification: March 3, 2013
Camera ready version: April 5, 2013
TAP conference: June 17-21, 2013
* PROGRAM CHAIRS
Margus Veanes (Microsoft Research, USA)
Luca Vigano` (University of Verona, Italy)
* SUBMISSION
Please submit your papers via easychair
https://www.easychair.org/conferences/?conf=tap2013
(submission page to be opened in due time)
TAP 2013 will accept two types of papers:
- Research papers: full papers with at most 16 pages in LNCS format
(pdf), which have to be original, unpublished and not submitted
elsewhere.
- Short contributions: work in progress, (industrial) experience
reports or tool demonstrations, position statements; an extended
abstract with at most 6 pages in LNCS format (pdf) is expected.
Subject to final approval by Springer, accepted papers will be published
in the Springer LNCS series and will be available at the conference.
The contents of previous TAP proceedings is available at:
http://www.informatik.uni-trier.de/~ley/db/conf/tap/
24TH INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS
(RTA 2013)
Call for Papers
June 24 - 26, 2013
Eindhoven, The Netherlands
collocated with TLCA 2013 as part of RDP 2013
http://www.win.tue.nl/rdp2013/
* GENERAL
The 24th International Conference on Rewriting Techniques and Applications
(RTA 2013) is organized as part of the Federated Conference on Rewriting,
Deduction, and Programming (RDP 2013), together with the 11th International
Conference on Typed Lambda Calculi and Applications (TLCA 2013), and
several
workshops. RDP 2013 will be held at the Eindhoven University of Technology
in the Netherlands.
* TOPICS OF INTEREST
RTA is the major forum for the presentation of research on all aspects of
rewriting. Typical areas of interest include (but are not limited to):
- Applications: case studies; analysis of cryptographic protocols;
rule-based
(functional and logic) programming; symbolic and algebraic computation;
SMT solving; theorem proving; system synthesis and verification; proof
checking; reasoning about programming languages and logics; program
transformation; XML queries and transformations; systems biology;
homotopy theory; implicit computational complexity;
- Foundations: equational logic; universal algebra; rewriting logic;
rewriting models of programs; matching and unification; narrowing;
completion techniques; strategies; rewriting calculi; constraint solving;
tree automata; termination; complexity; modularity;
- Frameworks: string, term, and graph rewriting; lambda-calculus and
higher-order rewriting; constrained rewriting/deduction; categorical and
infinitary rewriting; stochastic rewriting; net rewriting; binding
techniques; Petri nets; higher-dimensional rewriting;
- Implementation: implementation techniques; parallel execution; rewrite
and
completion tools; certification of rewriting properties; abstract
machines; explicit substitutions; automated (non)termination and
confluence provers; automated complexity analysis.
* PUBLICATION
The proceedings of RTA 2013 will be published by LIPIcs (Leibniz
International Proceedings in Informatics). LIPIcs is open access, meaning
that publications will be available online and free of charge, and authors
keep the copyright for their papers. LIPIcs publications are indexed in
DBLP.
For more information about LIPIcs please consult:
<http://www.dagstuhl.de/en/publications/lipics>
* SUBMISSION GUIDELINES
Submissions must be
- original and not submitted for publication elsewhere,
- written in English,
- a research paper, or a problem set, or a system description,
- in pdf prepared with pdflatex using the LIPIcs stylefile:
<http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>,
- at most 10 pages for system description,
at most 15 pages for the other two types of submissions
- submitted electronically through the EasyChair system at:
https://www.easychair.org/conferences/?conf=rta2013.
The page limit and the deadline for submission are strict.
Additional material for instance proof details, may be given in an appendix
which is not subject to the page limit. However, submissions must be
self-contained within the respective page limit; reading the appendix
should
not be necessary to assess the merits of a submission.
* IMPORTANT DATES
abstract submission February 1 2013
paper submission February 5 2013
rebuttal period March 18-21 2013
notification April 4 2013
final version April 26 2013
* PROGRAMME COMMITTEE CHAIR
Femke van Raamsdonk (VU University Amsterdam, The Netherlands)
* PROGRAMME COMMITTEE ***
Eduardo Bonelli, National University of Quilmes
Byron Cook, Microsoft Research Cambridge
Stephanie Delaune, ENS Cachan
Gilles Dowek, Inria Paris-Rocquencourt
Maribel Fernandez, King's College London
Nao Hirokawa, JAIST Ishikawa
Delia Kesner, University Paris-Diderot
Helene Kirchner, Inria Paris-Rocquencourt
Barbara Koenig, University Duisburg Essen
Temur Kutsia, Johannes Kepler University Linz
Aart Middeldorp, University of Innsbruck
Vincent van Oostrom, Utrecht University
Femke van Raamsdonk, VU University Amsterdam
Kristoffer Rose, IBM Research New York
Manfred Schmidt-Schauss, Goethe University Frankfurt
Peter Selinger, Dalhousie University
Paula Severi, University of Leicester
Aaron Stump, The University of Iowa
Tarmo Uustalu, Institute of Cybernetics Tallinn
Roel de Vrijer, VU University Amsterdam
Johannes Waldmann, HTWK Leipzig
Hans Zantema, Eindhoven University of Technology
* CONFERENCE CHAIR
Hans Zantema (Eindhoven University of Technology, The Netherlands)
16TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY
TESTING (SAT 2013)
Call for Papers
Helsinki, Finland
July 8-12, 2013
http://sat2013.cs.helsinki.fi/
* AIMS
The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the primary annual meeting for
researchers studying the theory and applications of the propositional
satisfiability problem, broadly construed. Besides plain propositional
satisfiability, it includes Boolean optimization (including MaxSAT and
Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF),
Satisfiability Modulo Theories (SMT), and Constraint Programming (CP)
for problems with clear connections to Boolean-level reasoning.
The SAT conference aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to satisfiability.
* DEADLINES
Abstract submission: February 1, 2013
Paper submission: February 8, 2013
* TOPICS
Topics include (but are not restricted to)
- Theoretical advances (including exact algorithms, proof complexity, and
other complexity issues);
- Practical search algorithms;
- Knowledge compilation;
- Implementation-level details of SAT solving tools and SAT-based systems;
- Problem encodings and reformulations;
- Applications (including both novel applications domains and
improvements to existing approaches);
- Case studies and reports on insightful findings based on rigorous
experimentation.
* SUBMISSIONS
Submissions are solicited in three paper categories:
- REGULAR PAPERS (9 to 15 pages, excluding references)
- SHORT PAPERS (up to 8 pages, excluding references)
- TOOL PAPERS (up to 6 pages, excluding references)
All accepted papers will be published in the proceedings of the conference,
which will be published within the Springer LNCS series.
* PROGRAM CHAIRS
Matti Jarvisalo University of Helsinki, Finland
Allen Van Gelder University of California at Santa Cruz, USA
* PROGRAM COMMITTEE
Visit http://sat2013.cs.helsinki.fi/ for details.
4TH OPEN ANSWER SET PROGRAMMING COMPETITION (ASP Competition 2013)
Call for Participant Systems
University of Calabria - Vienna University of Technology
Fall/Winter 2012/2013
http://aspcomp2013.mat.unical.it/
* SCOPE
The event is open to ASP systems and ANY OTHER system based on a
declarative specification paradigm.
* CONTEST
Participants of the Answer Set Programming Competition will compete on a
selected collection of benchmark problems, taken from a variety of
benchmark problem domains as well as real world applications. These
include, but are not limited to:
- Classic and applicative graph problems
- Scheduling, Timetabling, and other resource allocation problems
- Sequential and Temporal Planning
- Combinatorial Optimization Problems
- Deductive database tasks on large data-sets
- Puzzles and Combinatorics
- Ontology reasoning
- Automated Theorem Proving and Model Checking
- Reasoning tasks over large propositional instances
- Constraint Programming problems
- Other AI problems
* TRACKS
The competition consists of two independent main tracks:
- the Model & Solve Track invites any researcher and developer of
declarative knowledge representation systems to participate in an
open challenge for solving sophisticated AI problems with their tools
of choice. Participants submit a solver based on an arbitrary input
format and declarative specifications of the Competition's benchmark
domains;
- the System Track compares dedicated answer set solvers on ASP
benchmarks. Participants compete with a solver for a standard ASP
language.
We encourage to submit parallel and portfolio systems exploiting
multiple cores or multiple algorithms for solving the given instances.
* HISTORY
Answer Set Programming is a well-established paradigm of declarative
programming with close relationship to other declarative modelling
paradigms and languages, such as SAT Modulo Theories, Constraint
Handling Rules, FO(.), PDDL, CASC, and many others.
The ASP Competition is a biannual event for evaluating declarative
knowledge representation systems on hard and demanding AI problems. The
4th ASP Competition will be run in the first half of 2013 jointly at the
University of Calabria (Italy) and the Vienna University of Technology
(Austria). The event is the sequel to the ASP Competition series, held
at the University of Potsdam (Germany) in 2006-2007, at the University
of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in
2011. The current competition takes place in cooperation with the 12th
International Conference on Logic Programming and Nonmonotonic Reasoning
(LPNMR 2013), where the results will be announced.
* GOALS
The ASP competition is held as an open tournament. The "Model & Solve"
competition track fosters the spirit of integration among communities,
and is thus open to all types of solvers: ASP systems, SAT solvers, SMT
solvers, CP systems, FOL theorem provers, Description Logics reasoners,
planning reasoners, or any other. The "System" competition track is
instead set up on a fixed language based on the answer set semantics.
* IMPORTANT DATES
- February 2nd, 2013: Participant registration deadline
- March 1st, 2013: Participant system submission deadline
- March 2nd, 2013: System freeze, the competition runs
- September 15-19, 2013: Announcement of results and award presentation
at LPNMR 2013 in Corunna, Spain
For further information and submission instructions please visit the
competition web site
http://aspcomp2013.mat.unical.it/
or contact us by email: aspcomp2013 at kr.tuwien.ac.at
IFIP INTERNATIONAL CONFERENCE ON FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS
(FORTE/FMOODS 2013)
Call for Papers
Florence, Italy
June 3-6, 2013
http://forte13.sosy-lab.org/
* OBJECTIVES AND SCOPES
The 2013 IFIP Joint International Conference on Formal Techniques
for Distributed Systems (33rd FORTE / 15th FMOODS) is a forum for
fundamental research on theory, models, tools, and applications
for distributed systems. The joint conference is the result of
merging the conference FMOODS (Formal Methods for Open Object-Based
Distributed Systems) and FORTE (Formal Techniques for Networked
and Distributed Systems). FORTE/FMOODS 2013 is part of the
DiScoTec 2013 event (see http://www.discotec.org/).
* SUBMISSIONS
The conference solicits original contributions that advance the
science and technologies for distributed systems, with special
interest in the areas of:
- component- and model-based design
- object technology, modularity, software adaptation
- service-oriented, ubiquitous, pervasive, grid, cloud, and mobile
computing systems
- product-line-based systems
- software quality, reliability, availability, and safety
- security, privacy, and trust in distributed systems
- adaptive distributed systems, self-stabilization, self-healing/organizing
- verification, validation, formal analysis, and testing of the above.
The conference encourages contributions that combine theory and
practice and that exploit formal methods and theoretical foundations
to present novel solutions to problems arising from the development
of distributed systems. FORTE / FMOODS covers distributed computing
models and formal specification, testing and verification methods.
The application domains include all kinds of application-level
distributed systems, telecommunication services, Internet, embedded
and real time systems, as well as networking and communication
security and reliability.
* TOPICS
Topics of interest include but are not limited to:
- Languages and Semantic Foundations: new modeling and language concepts
for distribution and concurrency, semantics for different types of
languages, including programming languages, modeling languages,
and domain specific languages; real-time and probability aspects;
type systems and behavioral typing;
- Formal Methods and Techniques: design, specification, analysis,
verification, validation, testing and runtime verification of various
types of distributed systems including communications and network
protocols, service-oriented systems, and adaptive distributed systems;
- Foundations of Security: new principles for qualitative and quantitative
security analysis of distributed systems, including formal models
based on probabilistic concepts;
- Applications of Formal Methods: applying formal methods and techniques
for studying quality, reliability, availability, and safety of
distributed systems;
- Practical Experience with Formal Methods: industrial applications,
case studies and software tools for applying formal methods and
description techniques to the development and analysis of real
distributed systems.
* PUBLICATION AND SUBMISSIONS
The FORTE/FMOODS 2013 conference calls for high-quality papers presenting
research results and/or application reports related to the research areas
in conference scope.
All papers must be original, unpublished, and not submitted for
publication elsewhere. Contributions should be submitted electronically
in PDF via the EasyChair system at the following address:
http://forte13.sosy-lab.org/submit.php
Each paper will undergo a peer review of at least 3 anonymous reviewers.
The papers must be prepared using Springer's LNCS style
(see http://www.springer.de/comp/lncs/authors.html).
Papers must not exceed 15 pages in length, including figures and
references.
* IMPORTANT DATES
Title and abstract must be submitted before the paper. Time of all
deadlines
is 24:00 Samoa Standard Time (UTC-11).
Abstracts February 4, 2013
Papers February 11, 2013
Notification March 18, 2013
Camera-Ready March 25, 2013
Conference June 3-6, 2013
* PROGRAM COMMITTEE CO-CHAIRS
- Dirk Beyer, Faculty of Computer Science and Mathematics
University of Passau, Germany
- Michele Boreale, Dipartimento di Statistica, Informatica, Applicazioni
University of Florence, Italy
* DETAILS
http://forte13.sosy-lab.org/
27TH ANNUAL INTERNATIONAL SYMPOSIUM ON LOGIC (LOGICA 2013)
Call for papers
Hejnice, Czech Republic
June 17-21, 2013
http://www.flu.cas.cz/logica
* CONTRIBUTIONS
Contributions devoted to any of the wide range of logical problems are
welcome except those focused on specialized technical applications.
Particularly welcome are contributions that cover issues interesting both
for 'philosophically' and for 'mathematically' oriented logicians.
* IMPORTANT DATES
- 14 February 2013: Deadline for submissions (2 page abstract)
- 31 March 2013: Notification of acceptance
* INVITED SPEAKERS
Johan van Benthem, Michael Dunn, Volker Halbach and Michiel van Lambalgen
* PROGRAM COMMITTEE
Theodora Achourioti, Petr Cintula, Kosta Dosen, Marie Duzi, Christian
Fermueller, Gary Kemp, Vojtech Kolman, Peter Milne, Jaroslav Peregrin,
Hans Rott, Gabriel Sandu, Sebastian Sequoiah-Grayson, Sonja Smets
* DETAILS
Detailed information can be found on the webpage.
40TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING
(ICALP 2013)
Call for Papers
Riga, Latvia
July 8-12, 2013
http://www.icalp2013.lu.lv
* GENERAL
The 40th International Colloquium on Automata, Languages and
Programming (ICALP), the main conference and annual meeting of
the European Association for Theoretical Computer Science (EATCS),
will take place from the 8th to the 12th of July 2013 in Riga,
Latvia.
* WORKSHOPS
The main conference will be preceded by a series of workshops,
taking place on Sunday, July 7th, 2013 (one day before ICALP).
* IMPORTANT DATES
Submission Deadline: Feb 15, 2013
Author Notification: Apr 12, 2013
Final Manuscript Due: April 28, 2013
* TOPICS
Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:
- Track A: Algorithms, Complexity and Games
Algorithmic Game Theory
Approximation Algorithms
Combinatorial Optimization
Combinatorics in Computer Science
Computational Biology
Computational Complexity
Computational Geometry
Cryptography
Data Structures
Design and Analysis of Algorithms
Machine Learning
Parallel, Distributed and External Memory Computing
Parameterized Algorithms and Complexity
Quantum Computing
Randomness in Computation
- Track B: Logic, Semantics, Automata and Theory of Programming
Algebraic and Categorical Models
Automata Theory, Formal Languages
Emerging and Non-standard Models of Computation
Databases, Semi-Structured Data and Finite Model Theory
Principles of Programming Languages
Logics, Formal Methods and Model Checking
Models of Concurrent, Distributed, and Mobile Systems
Models of Reactive, Hybrid and Stochastic Systems
Program Analysis and Transformation
Specification, Refinement and Verification
Type Systems and Theory, Typed Calculi
- Track C: Foundations of Networked Computation: Models,
Algorithms and Information Management
Cloud Computing, Overlay Networks, P2P Systems
Cryptography, Privacy, Security, Spam
Distributed and Parallel Computing
E-commerce, Auctions, Trust and Reputation
Game Theory, Incentives, Selfishness
Internet Algorithms
Mobile and Complex Networks
Natural and Physical Algorithms
Network Information Management
Sensor, Mesh, and Ad Hoc Networks
Social Networks, Viral Marketing
Specification, Semantics, Synchronization
Web Mining, Searching, Ranking and Analysis
Wireless and Optical Communication
* INVITED SPEAKERS
Susanne Albers, Humboldt University
Orna Kupferman, Hebrew University
Paul Spirakis, University of Patras
Daniel Marx, Hungarian Academy of Sciences
Peter Widmayer, ETH Zürich
* SUBMISSIONS
Authors are invited to submit an extended abstract of no more
than 12 pages in LNCS style presenting original research on
the theory of Computer Science. Submissions should indicate
to which track (A, B, or C) the paper is submitted. No prior
publication or simultaneous submission to other publication
outlets (either a conference or a journal) is allowed. The
proceedings will be published in the Lecture Notes in Computer
Science Series by Springer-Verlag.
* BEST PAPER AWARDS
As in previous editions of ICALP, there will be best paper
and best student paper awards for each track of the conference.
In order to be eligible for a best student paper award, a paper
should be authored only by students and should be marked as
such upon submission.
27TH ANNUAL IFIP WG 11.3 WORKING CONFERENCE ON DATA AND APPLICATIONS
SECURITY AND PRIVACY (DBSec 2013)
Call for Papers
Newark, NJ, USA
July 15-17, 2013
http://dbsec2013.business.rutgers.edu/
* GOALS
The 27th Annual IFIP WG 11.3 Working Conference on Data and Applications
Security and Privacy provides a forum for presenting original unpublished
research results, practical experiences, and innovative ideas in data and
applications security. Both papers and panel proposals are also solicited.
Proceedings will be published by Springer as the next volume in the
Research
Advances in Database and Information Systems Security series
(http://www.springeronline.com/lncs).
* SUBMISSIONS
Papers may present theory, techniques, applications, or practical
experience on topics of relevance to IFIP WG 11.3: Access Control;
Applied cryptography in data security; Identity theft and
countermeasures; Integrity maintenance; Intrusion detection;
Knowledge discovery and privacy; Logics for security and privacy;
Organizational security; Privacy-preserving data management;
Secure transaction processing; Secure information integration;
Secure Semantic Web; Secure sensor monitoring; Secure Web Services;
Threats, vulnerabilities, and risk management; Trust management.
Additional topics of interest include (but are not limited to):
Critical Infrastructure Protection, Cyber Terrorism, Information
Warfare, Database Forensics, Electronic Commerce Security, and Security
in Digital Health Care.
* IMPROTANT DATES
Paper submission: 15 Feb 2013;
Notification: 19 Apr 2013;
Final papers due: 3 May 2013.
5TH INTERNATIONAL CONFERENCE ON ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE
(CALCO 2013)
Call for Papers
Warsaw, Poland
September 3 - 6, 2013
http://coalg.org/calco13/
* IMPORTANT DATES
Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
* SCOPE
CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science.
It is a high-level, bi-annual conference formed by joining the
forces and reputations of CMCS (the International Workshop on
Coalgebraic Methods in Computer Science), and WADT (the Workshop on
Algebraic Development Techniques). Previous CALCO editions took place
in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009)
and Winchester (UK, 2011). The fifth edition will be held in Warsaw,
the capital of Poland.
* TOPICS OF INTEREST
We invite submissions of technical papers that report results of
theoretical work on the mathematics of algebras and coalgebras, the
way these results can support methods and techniques for software
development, as well as experience with the transfer of the resulting
technologies into industrial practice. We encourage submissions in
topics included or related to those listed below.
+ Abstract models and logics
- Automata and languages
- Categorical semantics
- Modal logics
- Relational systems
- Graph transformation
- Term rewriting
- Adhesive categories
+ Specialised models and calculi
- Hybrid, probabilistic, and timed systems
- Calculi and models of concurrent, distributed, mobile, and
context-aware computing
- General systems theory and computational models (chemical,
biological, etc.)
+ Algebraic and coalgebraic semantics
- Abstract data types
- Inductive and coinductive methods
- Re-engineering techniques (program transformation)
- Semantics of conceptual modelling methods and techniques
- Semantics of programming languages
+ System specification and verification
- Algebraic and coalgebraic specification
- Formal testing and quality assurance
- Validation and verification
- Generative programming and model-driven development
- Models, correctness and (re)configuration of
hardware/middleware/architectures,
- Process algebra
* NEW TOPICS
This edition of CALCO will feature two new topics, and submission of
papers on these topics is especially encouraged.
+ Corecursion in Programming Languages
- Corecursion in logic / constraint / functional / answer set
programming
- Corecursive type inference
- Coinductive methods for proving program properties
- Implementing corecursion
- Applications
+ Algebra and Coalgebra in quantum computing
- Categorical semantics for quantum computing
- Quantum calculi and programming languages
- Foundational structures for quantum computing
- Applications of quantum algebra
* SUBMISSION GUIDELINES
Prospective authors are invited to submit full papers in English
presenting original research. Submitted papers must be unpublished and
not submitted for publication elsewhere. Experience papers are
welcome, but they must clearly present general lessons learned that
would be of interest and benefit to a broad audience of both
researchers and practitioners. As with previous editions, the
proceedings will be published in the Springer LNCS series. Final
papers should be no more than 15 pages long in the format specified by
Springer (see http://www.springer.de/comp/lncs/authors.html). It is
recommended that submissions adhere to that format and
length. Submissions that are clearly too long may be rejected
immediately. Proofs omitted due to space limitations may be included
in a clearly marked appendix. Both an abstract and the full paper must
be submitted by their respective submission deadlines.
* BEST PAPER AND BEST PRESENTATION AWARDS
For the first time, this edition of CALCO will feature two kinds of
awards: a best paper award whose recipients will be selected by the PC
before the conference and a best presentation award, elected by the
participants.
* IMPORTANT DATES
Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
* PROGRAMME COMMITTEE
Luca Aceto - Reykjavik University, Iceland
Jiri Adamek - TU Braunschweig, D
Lars Birkedal - IT University of Copenhagen, DK
Filippo Bonchi - CNRS, ENS-Lyon, F
Corina Cirstea - University of Southhampton, UK
Bob Coecke - University of Oxford, UK
Andrea Corradini - University of Pisa, I
Mai Gehrke - Université Paris Diderot - Paris 7, F
H. Peter Gumm - Philipps University Marburg, D
Gopal Gupta - University of Texas at Dallas, USA
Ichiro Hasuo - Tokyo University, Japan
Reiko Heckel - University of Leicester, UK (cochair)
Bart Jacobs - Radboud University Nijmegen, NL
Ekaterina Komendantskaya - University of Dundee, Scotland, UK
Barbara Koenig - University of Duisburg-Essen, D
Jose Meseguer - University of Illinois, Urbana-Champaign, USA
Marino Miculan - University of Udine, I
Stefan Milius - TU Braunschweig, D (cochair)
Larry Moss - Indiana University, Bloomington, USA
Till Mossakowski - DFKI Lab Bremen and University of Bremen, D
Prakash Panangaden - McGill University, Montreal, Canada
Dirk Pattinson - Imperial College London, UK
Dusko Pavlovic - Royal Holloway, University of London, UK
Daniela Petrisan - University of Leicester, UK
John Power - University of Bath, UK
Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL
Lutz Schroeder - Friedrich-Alexander Universität Erlangen-Nürnberg, D
Monika Seisenberger - Swansea University, UK
Sam Staton - University of Cambridge, UK
Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL
Pawel Sobocinski - University of Southampton, UK
Yde Venema - University of Amsterdam, NL
Uwe Wolter - University of Bergen, NO
* ORGANISING COMMITTEE
Bartek Klin (University of Warsaw, Poland)
Andrzej Tarlecki (University of Warsaw, Poland)
* LOCATION
Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.
* SATELLITE WORKSHOPS
CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired
by Monika Seisenberger (Swansea University). The workshop is dedicated
to presentation of work in progress and original research
proposals. PhD students and young researchers are particularly
encouraged to contribute.
A workshop dedicated to tools based on algebraic and/or coalgebraic
principles, CALCO Tools, will be held alongside the main conference,
chaired by Lutz Schröder (Friedrich Alexander Universitaet
Erlangen-Nuernberg). Papers of this workshop will be included in the
CALCO proceedings.
22ND CONFERENCE ON AUTOMATED REASONING WITH TABLEAUX AND RELATED METHODS
(TABLEAUX 2013)
Call for Papers, Tutorials and Workshops
Nancy, France
September 16-19, 2013
http://tableaux13.loria.fr
co-located with FroCoS 2013
* SCOPE
Tableaux methods offer a convenient set of formalisms for automating
deduction in various non-standard logics as well as in classical
logic. Areas of application include verification of software and
computer systems, data integration and data access, deductive
databases, knowledge representation and its required inference
engines, and system diagnosis.
The conference intends to bring together researchers interested in all
aspects - theoretical foundations, implementation techniques, system
developments and applications - of the mechanization of reasoning with
tableaux and related methods.
Topics of interest include (but are not restricted to):
- proof-theory in classical and non-classical logics (modal,
temporal, description, intuitionistic, substructural, ...)
- analytic tableaux for various logics (theory and applications)
- related techniques and concepts, e.g., model checking and BDDs
- related methods (model elimination, sequent calculi, connection
method, resolution, ...)
- new calculi and methods for theorem proving and verification
in classical and non-classical logics
- systems, tools, implementations and applications (provers,
logical frameworks, model checkers, ...)
- automated deduction and formal methods applied to logic,
mathematics, software development, protocol verification,
security, ...
* IMPORTANT DATES:
- WORKSHOPS:
Workshop submission deadline: February 22, 2013
Notification of acceptance: March 8, 2013
- TUTORIALS:
Proposal submission deadline: March 23, 2013
Notification of acceptance: April 5, 2013
- CONFERENCE PAPERS:
Title and Abstract submission deadline: April 8, 2013
Paper submission deadline: April 15, 2013
* Detailed information can be found on the webpage.
29TH CONFERENCE ON THE MATHEMATICAL FOUNDATIONS OF PROGRAMMING SEMANTICS
(MFPS XXIX)
Preliminary Announcement
June 23-25, 2013
Tulane University, New Orleans, LA USA
(co-located with LICS 2013 and CFS 2013)
* GENERAL
The 29th Conference on the Mathematical Foundations of Programming
Semantics will take place on the campus of Tulane University, New
Orleans, LA USA from June 23 to June 25, 2013. The conference will
be co-located with the 2013 Logic in Computer Science Symposium
and the 2013 Computer Security Foundations Symposium. MFPS will
have a number of invited speakers and special sessions, one of
which will be a shared session with LICS celebrating Dana Scott's
80th birthday year. This is a preliminary announcement - details
about the conference, including the program committee membership,
the invited speakers and the special sessions will be available
within the next few weeks. The purpose of this announcement is to
alert members of the community about the relevant personnel
overseeing the conference and to provide the important dates for
the meeting.
* COMMITTEES
The Program Committee Chair for MFPS XXIX is Dexter Kozen
(Cornell). The local arrangements chair is Michael Mislove
(Tulane). The Organizing Committee for MFPS includes Andrej Bauer
(Slovenia), Stephen Brookes (CMU), Achim Jung (Birmingham),
Catherine Meadows (NRL), Michael Mislove (Tulane), Joel Ouaknine
(Oxford) and Prakash Panangaden (McGill).
* IMPORTANT DATES
Deadline for titles and short abstracts: Monday, March 25, 2013
Deadline for full submissions: Tuesday, April 2, 2013
Notification of accepted papers: Monday, April 28, 2013
24TH CONFERENCE ON CONCURRENCY THEORY (CONCUR 2013)
Call for Papers
Buenos Aires, Argentina
August 26-31, 2013
http://concur-conferences.org/concur2013/
* GOAL
The purpose of the CONCUR conferences is to bring together
researchers, developers, and students in order to advance
the theory of concurrency, and promote its applications.
* INVITED SPEAKERS
- Lorenzo Alvisi (University of Texas Austin, USA)
- Joost-Pieter Katoen (RWTH Aachen University, Germany)
- Philippe Schnoebelen (LSV, CNRS & ENS de Cachan, France)
- Reinhard Wilhelm (Saarland University, Germany)
* TOPICS
Submissions are solicited in semantics, logics, verification
and analysis of concurrent systems. The principal topics include
(but are not limited to):
- Basic models of concurrency such as abstract machines, domain
theoretic models, game theoretic models, process algebras,
graph transformation systems and Petri nets;
- Logics for concurrency such as modal logics, probabilistic and
stochastic logics, temporal logics, and resource logics;
- Models of specialized systems such as biology-inspired systems,
circuits, hybrid systems, mobile and collaborative systems,
multi-core processors, probabilistic systems, real-time systems,
service-oriented computing, and synchronous systems;
- Verification and analysis techniques for concurrent systems
such as abstract interpretation, atomicity checking, model
checking, race detection, pre-order and equivalence checking,
run-time verification, state-space exploration, static analysis,
synthesis, testing, theorem proving, and type systems;
- Related programming models such as distributed, component-based,
object-oriented, and web services.
* CO-LOCATED EVENTS
10th Intl. Conf. on Quantitative Evaluation of SysTems (QEST 2013)
11th Intl. Conf. on Formal Modeling and Analysis of Timed Systems
(FORMATS 2013)
8th Intl. Symposium on Trustworthy Global Computing (TGC 2013)
There will be co-located workshops, which take place on August 26
and August 31, and tutorials (associated with QEST) which take
place on August 26.
* SUBMISSIONS
CONCUR 2013 solicits high quality papers reporting research
results and/or experience reports related to the topics mentioned
above. All papers must be original, unpublished, and not submitted
for publication elsewhere. Contributions should be submitted
electronically as PDF, using the Springer LNCS style. Papers
should not exceed 15 pages in length.
Each paper will undergo a thorough review process. If necessary,
the paper may be supplemented with a clearly marked appendix,
which will be reviewed at the discretion of the program committee.
Papers should be submitted electronically using EasyChair online
submission system:
https://www.easychair.org/conferences/?conf=concur2013
The CONCUR 2013 proceedings will be published by Springer in the
ArCoSS subseries of LNCS. The proceedings will be available at
the conference.
* IMPORTANT DATES
Abstract Submission: 1st April 2013
Paper Submission: 8th April 2013
Paper Notification: 27th May, 2013
Camera Ready Copy Due: 10t June, 2013
CONCUR 2012: 27th-30th August, 2013
* AFFILIATED WORKSHOPS
Proposal for workshops are expected to be sent to the Workshops
Chairs, Eduardo Bonelli (ebonelli at unq.edu.ar) and Diego
Garbervetsky (diegog at dc.uba.ar), by January 14, 2013.
* PROGRAM CHAIRS
- Pedro R. D'Argenio (Universidad Nacional de Córdoba, Argentina)
- Hernán Melgratti (Universidad de Buenos Aires, Argentina)
* PROGRAM COMMITTEE
Christel Baier (Technical University of Dresden, DE)
Paolo Baldan (Universitá di Padova, IT)
Eike Best (Universität Oldenburg, DE)
Patricia Bouyer (LSV, CNRS & ENS Cachan, FR)
Tomas Brazdil (Masaryk University, CZ)
Franck van Breugel (York University, CA)
Krishnendu Chatterjee (IST, AT)
Rance Cleaveland (University of Maryland, US)
Wan Fokkink (Vrije Universiteit Amsterdam, NL)
Daniele Gorla (University of Rome "La Sapienza", IT)
Holger Hermanns (Saarland University, DE)
Radha Jagadeesan (DePaul University, US)
Bengt Jonsson (Uppsala University, SE)
Kim G. Larsen (Aalborg University, DK)
Ugo Montanari (Universitá di Pisa, IT)
Prakash Panangaden (McGill University, CA)
David Parker (University of Birmingham, UK)
Frank Pfenning (Carnegie Mellon University, US)
Nir Piterman (University of Leicester, UK)
Shaz Qadeer (Microsoft Research, US)
Jean-Francois Raskin (Universit Libre de Bruxelles, BE)
Jan Rutten (CWI, NL)
Davide Sangiorgi (University of Bologna, IT)
Geoffrey Smith (Florida International University, US)
P.S. Thiagarajan (National University of Singapore, SG)
Frits Vaandrager (Radboud University Nijmegen, NL)
Frank Valencia (CNRS, Ecole Polytechnique de Paris, FR)
Rob Van Glabbeek (NICTA, AU)
Nobuko Yoshida (Imperial College London, UK)
Lijun Zhang (Technical University of Denmark, DK)
22ND EACSL ANNUAL CONFERENCES ON COMPUTER SCIENCE LOGIC (CSL 2013)
Call for Papers
Torino, Italy
September 2-5, 2013
http://csl13.di.unito.it/
* AIM AND SCOPE
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.
* LOCATION
The 22nd EACSL Annual Conferences on Computer Science Logic
will be held at Museo di Scienze Naturali in Torino from
Monday 2nd through Thursday 5th of September 2013.
* LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE)
automated deduction and interactive theorem proving, constructive
mathematics and type theory, equational logic and term rewriting,
automata and games, game semantics, modal and temporal logic,
model checking, decision procedures, logical aspects of
computational complexity, computational proof theory, bounded
arithmetic and propositional proof complexity, logic programming
and constraints, lambda calculus and combinatory logic, domain
theory, categorical logic and topological semantics, database
theory, specification, extraction and transformation of programs,
logical aspects of quantum computing, logical foundations of
programming paradigms, verification and program analysis, linear
logic, higher-order logic, non-monotonic reasoning.
* IMPORTANT DATES
Abstract submission: April, 1st 2013
Paper Submission: April, 8th 2013
Paper Notification: June, 10th 2013
Paper final version: July, 1st 2013
Conference: September, 2nd --- 5th 2013
* SUBMISSION
Authors are invited to submit papers of not more than 15 pages in
LIPIcs style presenting work not previously published. Papers are
to be submitted through Easychair.
* SATELLITE EVENTS
The 14th International Workshop on Logic and Computational
Complexity (LCC'13) will be held on 6th of September 2013 as
a satellite event of CSL'13. An international summer school
on “Linear logic and related topics†will be held
from 28th
through 31st of August 2013 as a satellite event of CSL'13.
Further details will appear on this page as soon as possible.
* PROGRAM COMMITTEE
Zena Ariola (University of Oregon)
Arnon Avron (Tel-Aviv University)
Roberto Bagnara (University of Parma, and BUGSENG srl)
Christel Baier (Technical University of Dresden)
Marc Bezem (University of Bergen)
Paola Bruscoli (University of Bath, Computer Science Department)
Agata Ciabattoni (TU Wien)
Thierry Coquand (Chalmers University)
Ugo Dal Lago (Università di Bologna)
Valeria De Paiva (Nuance Communications)
Reinhard Kahle (CENTRIA and DM, UNL, Portugal)
Stephan Kreutzer (Technical University Berlin)
Olivier Laurent (CNRS - ENS Lyon)
Carsten Lutz (Universität Bremen)
Jean-Yves Marion (Université de Lorraine, LORIA)
Damian Niwinski (Warsaw University)
Frank Pfenning (Carnegie Mellon University)
Elaine Pimentel (UFMG)
Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS))
Simona Ronchi Della Rocca CHAIR (Università di Torino)
Jan Rutten (CWI)
Helmut Schwichtenberg (LMU Munich)
Phil Scott (Dept. of Math & Stats, U. Ottawa)
Peter Selinger (Dalhousie University)
Makoto Tatsuta (National Institute of Informatics)
Tachio Terauchi (Nagoya University)
* ORGANIZING COMMITTEE
Erika De Benedetti (Dipartimento di Informatica, Torino)
Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica
(DISIT), Alessandria)
Mauro Piccolo (Dipartimento di Informatica, Torino)
Luca Padovani (Dipartimento di Informatica, Torino)
Luca Paolini (Dipartimento di Informatica, Torino)
Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino)
Luca Roversi (Dipartimento di Informatica, Torino)
Angelo Troina (Dipartimento di Informatica, Torino)
SIXTH CONFERENCE ON TOPOLOGY, ALGEBRA AND CATEGOREIS IN LOGIC (TACL 2013)
Call for Presentations
July 28 - August 1, 2013
Nashville, Tennessee USA
http://www.math.vanderbilt.edu/~tacl2013/
* SCOPE
Studying logics via semantics is a well-established and very
active branch of mathematical logic, with many applications,
in computer science and elsewhere. The area is characterized
by results, tools and techniques stemming from various fields,
including universal algebra, topology, category theory, order,
and model theory. The program of the conference TACL 2013 will
focus on three interconnecting mathematical themes central to
the semantical study of logics and their applications: algebraic,
categorical, and topological methods. This is the sixth
conference in the series Topology, Algebra and Categories in
Logic (TACL, formerly TANCL). Earlier installments of this
conference have been organized in Tbilisi (2003), Barcelona
(2005), Oxford (2007), Amsterdam (2009), Marseilles (2011).
* CONFIRMED INVITED SPEAKERS
Vladimir Voevodsky, Institute for Advanced Studies, USA
Nick Bezhanishvili, Utrecht University, The Netherlands
Leo Cabrer, University of Oxford, UK
Silvio Ghilardi, University of Milan, Italy
George Metcalfe, University of Bern, Switzerland
Alex Simpson, University of Edinburgh, UK
* FEATURED TOPICS
Contributed talks can deal with any topic dealing with the use
of algebraic, categorical or topological methods in either
logic or computer science. This includes, but is not limited to,
the following areas:
- Algebraic structures in CS
- Algebraic logic
- Coalgebra
- Categorical methods in logic
- Domain theory
- Lattice theory
- Lattices with operators
- Many-valued and fuzzy logics
- Modal logics
- Non-classical logics
- Ordered topological spaces
- Ordered algebraic structures
- Pointfree topology
- Proofs and Types
- Residuated structures
- Semantics
- Stone-type dualities
- Substructural logics
- Topological semantics of modal logic
* SUBMISSIONS
Contributed presentations will be of two types:
- 20 minutes long presentations in parallel sessions and
- featured, 30 minutes long, plenary presentations.
The submission of an abstract will be required to be selected
for a contributed presentation of either kind. While preference
will be given to new work, results that have already been
published or presented elsewhere will also be considered.
More information on the submission procedure, as well as a link
to the EasyChair system, can be found at the conference web site.
* IMPROTANT DATES
April 1, 2013: Abstract submission deadline
May 1, 2013: Notification to authors
July 28-August 1, 2013: Conference
* PROGRAM COMMITTEE
Steve Awodey, Carnegie Mellon University
Guram Bezhanishvili, New Mexico State University
David Gabelaia, Razmadze Mathematical Institute, Tbilisi
Nick Galatos (co-chair), University of Denver
Mai Gehrke, LIAFA, University of Paris Diderot
Rob Goldblatt, Victoria University, Wellington
John Harding, New Mexico State University
Ramon Jansana, University of Barcelona
Peter Jipsen, Chapman University
Achim Jung, University of Birmingham
Alexander Kurz (co-chair), University of Leicester
Vincenzo Marra, University of Milan
Hiroakira Ono, Japan Advanced Institute of Science and Technology
Alessandra Palmigiano, University of Amsterdam
Hilary Priestley, St Anne's College, Oxford
James Raftery, University of KwaZulu-Natal, Durban
Thomas Streicher, Technical University of Darmstadt
Kazushige Terui, Kyoto University
Constantine Tsinakis, Vanderbilt University
Yde Venema, University of Amsterdam
Michael Zakharyaschev, Birkbeck College, University of London
* ORGANIZING COMMITTEE
Chris Conidis, Vanderbilt University
Lianzhen Liu, Jiangnan University, China
Warren McGovern, Florida Atlantic University
Francesco Paoli, University of Cagliari
Rebecca Steiner, Vanderbilt University
Constantine Tsinakis (chair), Vanderbilt University
William Young, Vanderbilt University
29TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP 2013)
Call for Papers
Istanbul, Turkey
August 24-28, 2013
http://www.iclp2013.org
* CONFERENCE SCOPE
Since the first conference held in Marseilles 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, Virtual Machines, Parallelism.
- Environments: Program Analysis, Transformation, Validation,
Verification, Debugging, Pro- filing, Testing.
- Language Issues: Concurrency, Objects, Coordination, Mobility,
Higher Order, Types, Modes, Assertions, Programming Techniques.
- Related Paradigms: Inductive Logic Programming, Constraint Logic
Programming, Answer-Set Programming, SAT-Checking
- Applications: Databases, Data Integration and Federation,
Software Engineering, Natural Language Processing, Web and
Semantic Web, Agents, Artificial Intelligence, Bioinformatics.
In addition to the presentations of accepted papers, the technical
program will include invited talks, advanced tutorials, the
doctoral consortium, and several workshops.
* SUBMISSION DETAILS
The four broad categories for submissions are as follows. Regular
papers, including: (1) tech- nical papers for describing
technically sound, innovative ideas that can advance the state 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 availability of the systems and tools described.
Technical communications (4) aimed at describing recent
developments, new projects, and other materials that are not ready
for publication as standard papers. All papers and technical
communications will be presented during the conference.
All submissions must describe original, previously unpublished
research, and must not simultaneously be submitted for publication
elsewhere. They must be written in English. Technical papers,
application papers, and system and tool papers must not exceed 12
pages plus bibliography: however a new condensed TPLP format may
be used and the papers may include appendices beyond 12 pages.
The limit for technical communications is 10 pages. Submissions
must be made in the condensed TPLP format (http://www.iclp2013.org)
via the Easychair submission system, available at
http://www.easychair.org/conferences/?conf=iclp2013
* IMPORTANT DATES
Paper registration (abstract): April 3, 2013
Submission deadline: April 10, 2013
Notification to authors: May 21, 2013
Revision deadline (when needed): June 21, 2013
Camera-ready copy due: July 18, 2013
Conference: August 24-28, 2013
* PAPER PUBLICATION
All accepted papers will be published in the journal Theory and
Practice of Logic Programming (TPLP), Cambridge University Press
(CUP), in one or more special issues. In order to ensure the
quality of the final version, papers may be subject to more than
one round of refereeing (within the decision period). Accepted
technical communications will be published in the online abstract
of the special issue(s). The program committee may also recommend
standard papers to be published as technical communications.
* ICLP 2013 ORGANIZATION
- General Co-Chairs:
Esra Erdem Sabanci University
Joohyung Lee Arizona State University
- Program Co-chairs:
Terrance Swift New University of Lisboa
Evelina Lamma University of Ferrara
- Workshops Chair:
Hans Tompits Vienna University of Technology
- Publicity Chair:
Peter Schueller Sabanci University
- Doctoral Consortium:
Marco Gavanelli University of Ferrara
Martin Gebser University of Potsdam
- Prolog Programming Contest:
Bart Demoen K.U. Leuven
11TH ANNUAL CONFERENCE ON COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY (CMSB
2013)
Call for Papers
IST Austria, Klosterneuburg, Austria
23-25 September, 2013
http://ist.ac.at/cmsb13
* IMPORTANT DATES
Abstract deadline 8 April, 2013
Paper submission deadline 15 April, 2013
Author notification 27 May, 2013
Poster submission deadline 27 May, 2013
Poster notification 10 June, 2013
Camera-ready deadline 24 June, 2013
* SCOPE
CMSB 2013 solicits original research articles on the computational
modeling and analysis of biological systems, pathways, networks,
data, and corresponding application domains. The conference brings
together computer scientists, biologists, mathematicians,
engineers, and physicists interested in a system-level
understanding of biological processes. It covers theory,
computation, as well as applications.
* TOPICS
- original paradigms, formalisms, and languages for modeling
biological processes
- original models together with their application domains
- frameworks, techniques, and tools for verifying, validating,
analyzing, and simulating biological systems
- high-performance computational systems biology and parallel
implementations
- inference from high-throughput experimental data
- model integration from biological databases
- multi-scale modeling and analysis methods
- synthetic biology.
* POSTER TRACK
CMSB 2013 also solicits poster submissions. The abstract of each
poster will get 2 pages in the proceedings. Some selected posters
will also be given slots of short talks at the conference. We
especially encourage poster submission from experimental
biologists! In order to facilitate biologists to attend the
conference and present their work, a limited number of travel
stipends for students and postdocs presenting biology posters
will be available.
9TH SYMPOSIUM ON FRONTIERS OF COMBINING SYSTEMS (FroCoS 2013)
Call for Papers
Nancy, France
September 18-20, 2013,
http://frocos2013.loria.fr
co-located with TABLEAUX 2013
* AIMS
The aim of the conference is to publish and promote
progress in research areas requiring the development of general
techniques and methods for the combination and integration of
special, formally defined systems, as well as for the analysis
and modularization of complex systems.
* TOPICS
Typical topics of interest include (but are not limited to):
combinations of logics such as combined higher-order, first-order,
temporal, modal, or other non-classical logics; combinations and
modularity in ontologies; combination of decision procedures, of
satisfiability procedures, of constraint solving techniques or of
logical frameworks; combination and integration methods in SAT and
SMT solving; combinations and modularity in term rewriting;
integration of equational and other theories into deductive
systems; combination of deduction systems and computer algebra;
integration of data structures into constraint logic programming
and deduction; hybrid methods for deduction, resolution and
constraint propagation; hybrid systems in knowledge representation
and natural language semantics; combined logics for distributed and
multi-agent systems; logical aspects of combining and modularizing
programs and specifications.
* IMPORTANT DATES
Abstract submission: 15 Apr 2013
Paper submission: 22 Apr 2013
2012 MICROSOFT RESEARCH VERIFIED SOFTWARE MILESTONE AWARD
* RECIPIENT
Xavier Leroy of the Paris-Rocquencourt (http://www-rocq.inria.fr)
research center of INRIA, France, is the recipient of the 2012
Microsoft Research Verified Software Milestone Award, for the
CompCert Project (http://compcert.inria.fr). Specifically, the
award is given in recognition for Xavier's role as architect of
the CompCert C Verified Compiler as well as his leadership of
the development team. The formal presentation of the Award will
be made to Xavier at POPL 2013 (http://popl.mpi-sws.org/2013/),
which takes place in Rome - January 23-25, 2013.
* DETAILS
The full award citation is provided along with further details
of the award process at the VSI website, i.e.
http://dream.inf.ed.ac.uk/vsi
CONSTRUCTIVE LOGICS FOR PROGRAM CORRECTNESS
by Takayasu Ito
Maruzen Planet
318 pages
ISBN978-4-86345-146-9
* In this book,sp(S,Q) and vp(S,Q) express strong correctness
(often, called total correctness) and weak correctness (often,
called partial correctness) a procedural statement S with respect
to the problem specification (often,called post-condition) Q,
respectively,and zp(FD,Q) expresses strong correctness of strong
correctness of a functional program FD with respect to Q.
Hoare’s
correctness formula {P}S{Q} is expressed as (P⊃vp(S,Q)).After
giving semantics of correctness formulae it is pointed out that
weak correctness is not only logically weaker than strong
correctness but also an inconsistent notion when non-terminating
programs are involved, while strong correctness is a consistent
notion and it should be formalized in constructive logic (logically
stronger than Intuitionistic Logic).Constructive logics for sp(S,Q)
and zp(FD,Q) are given,and also correctness of stream programs and
relations between program correctness and equality of programs are
discussed from a constructive standpoint.
* The book consists of four PARTs. In PART I,after giving definitions
of correctness formulae, basic logical properties of sp(S,Q) and
vp(S,Q) are given with their constructive analyses. Constructive
logic for sp(S,Q) consists of not only constructive rules for
sp(S,Q) but also logic for problem specification (called PS logic)
and the underlying verification logic.PART II gives logic for
sp(S,Q),using Classical Logic as PS logic and the underlying
verification logic.In PART III,after discussing logical framework
of PS logic, Micro Logic (a subsystem of Intuitionistic Logic) is
proposed as a basic constructive logic.It is pointed out that
there is a neat correspondence between PS logic formula and
Program Correctness formula,called P&PC correspondence. Then a
fully constructive logic FCspm on sp(S,Q) is given; FCspm is fully
constructive in the sense that not only rules on sp(S,Q) are
constructive but also PS logic and the underlying verification
logic are constructive. Also,a fully constructive logic FCzpm on
zp(FD,Q) is given, and it is shown that Curry-Howard correspondence
is derivable from P&PC correspondence for functional programs
through type-theoretical interpretations of PS formulae. In PART IV
three topics are discussed.The first topic is correctness of stream
programs with (repeat S forever) to express infinitary repetitive
executions of S,and correctness rules for a stream program are
given. Then,relations between program correctness and equality of
programs are also discussed,and it is explained that equality
relations of programs are definable using sp(S,Q).Finally, a notion
of constructive semantics of programs and a notion of observable
computability by stream programs and primitive recursive predicates
are proposed.
NEW DLV RELEASE
http://www.dlvsystem.com
* The DLV Team and DLVSystem ltd are happy to announce the new DLV
release! Among others, this releases includes the following new
features and improvements, as well as the usual amount of polish
and bugfixes:
- Remove restriction on the maximum number of variables per rule
or constraint (used to be 60). Rules and constraint may now
contain arbitrarily many variables.
- Add support for lists: as in Prolog we support [term_1,...,
term_n] and [Head|Tail] notations. Add new built-ins for
handling lists (#append/3, #flatten/2, #length/2, #member/2,
#reverse/2, #delnth/3, #getnth/3, #insLast/3, #insnth/4,
#head/2, #tail/2, #last/2, #subList/2).
- Add option -maxlist that specifies the maximal length of lists.
- Add new built-ins #rand/1 and #rand/3 for the generation of a
pseudo-random integer, and new built-in #int/3.
- Magic sets are also applied on ground and propositional queries.
- Add option -print-magic for printing the magic-set-rewritten
program.
- Rename option -maxfuncnesting to -maxnesting.
- Correctly handle situations when having both aggregates and
function symbols.
- Bug fixes with magic sets (concerning built-ins, function
symbols and corner-cases such as empty IDB).
- A few minor bug fixes.
PROFESSORSHIP OF COMPUTER SCIENCE AT SHERBROOKE
http://www.usherbrooke.ca/chercher/#01571
* The Universite de Sherbrooke invites applications for a full time
tenure-track position in the Department of Computer Science of its
Faculty of Sciences. A detailed description of this position can
also be consulted on the University’s website by going to
http://www.usherbrooke.ca/emplois and then following the links
“Travailler à l’Université Emplois offerts” and
“Professeure ou professeur” (Faculté des sciences, no 01571).
ASSISTANT PROFESSORSHIPS (TENURE TRACK) IN COMPUTER SCIENCE
http://www.facultyaffairs.ethz.ch/facultypositions/ap_computerscience
* The Department of Computer Science (http://www.inf.ethz.ch)
at ETH Zurich invites applications for assistant professorships
(Tenure Track) in the areas of:
- Computer Systems
- Software Engineering (including programming languages)
- Information Systems (with emphasis on Big Data)
For candidates with exceptional research accomplishments also
applications for a full professorship will be considered.
* The department offers a stimulating and well-supported research
and teaching environment. Collaboration in research and teaching
is expected both within the department and with other groups of
ETH Zurich and related institutions.
* Applicants should have internationally recognized expertise in
their field and pursue research at the forefront of Computer
Science. Successful candidates should establish and lead a strong
research program. They will be expected to supervise Ph.D. students
and teach both undergraduate level courses (in German or English)
and graduate level courses (in English).
* Assistant professorships have been established to promote the
careers of younger scientists. The initial appointment is for
four years with the possibility of renewal for an additional
two-year period and promotion to a permanent position.
* Your application should include your curriculum vitae, a list
of publications, a statement of research and teaching interests
and the names of at least three referees. The letter of application
should be addressed to the President of ETH Zurich, Prof. Dr. Ralph
Eichler. The closing date for applications is 15 January 2013.
ETH Zurich is an equal opportunity and affirmative action employer.
In order to increase the number of women in leading academic positions,
we specifically encourage women to apply. ETH Zurich is further
responsive to the needs of dual career couples and qualifies as
a family friendly employer. Please apply online:
http://www.facultyaffairs.ethz.ch/facultypositions/ap_computerscience
LECTURESHIP IN COMPUTER SCIENCE AT LEICESTER
http://www.le.ac.uk/jobs/external/SEN00310_Further_Particulars.pdf
* JOB DESCRIPTION
The University of Leicester seeks to appoint a lecturer in
science. Candidates should have a strong research record and be
able to contribute to undergraduate and postgraduate teaching and
supervision of mainstream projects in a broad range of topics.
The appointment will be made in a research area that strengthens
or complements existing areas of research excellence in the
department. Areas of interest include algorithms and complexity,
computational modelling, data mining, human-computer interaction,
logical methods in computer science, parallel and distributed
computing, semantics, software engineering, theory of computing,
verification and correctness. Candidates will be able to attract
funding or to engage with industry, and have the potential to
generate non-academic impact of research.
* IMPORTANT DATES
Closing date for applications: 15 January 2013.
We anticipate that interviews will take place on 1 February 2013.
* FURTHER DETAILS
http://www.le.ac.uk/jobs/external/SEN00310_Further_Particulars.pdf
RESEARCH FELLOWSHIP AT WARWICK
http://www.jobs.ac.uk/job/AFS125/research-fellow/
* JOB SUMMARY
The Department of Computer Science invites applications for
a postdoctoral position on a two-year EPSRC-funded project
in the area of semantics-based software verification.
Candidates should have a strong background in automata theory
and/or program verification. This should be demonstrated in part
by a completed or nearly completed PhD on a related topic.
Strong programming skills as well as experience with automata and
logics over infinite alphabets will be an advantage.
* IMPORTANT DATE
The closing date/time for applications is midnight (British time)
at the end of Thursday 24 January 2013.
* FURTHER DETAILS
http://www.jobs.ac.uk/job/AFS125/research-fellow/
You are subscribed to the lics mailing list
because you have signed up for it in the past.
Submissions to the newsletter:
Send an email to las-lics at lists.tu-berlin.de.
Unsubscribe:
To unsubscribe, please send an email to
las-lics-request at lists.tu-berlin.de with
the keyword 'unsubscribe' in the message body (without ').
Subscribe:
To subscribe, please send an email to las-lics-request at lists.tu-berlin.de with
the keyword 'subscribe' in the message body (without ').
More information about the FOM
mailing list