[TYPES/announce] Joint Call for Papers: Distributed Computing Techniques 2009, Lisbon (DAIS + FMOODS/FORTE + COORDINATION)

2008-12-20 Thread Martin Steffen
[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]



Joint Call for Papers:

   Federated Conferences on

   Distributed Computing Techniques

   http://discotec09.di.fc.ul.pt/

  Lisbon, Portugal 8 - 12 June 2009

   --
   Coordination'09

   DAIS'09

   FMOODS/FORTE'09
   --



-

   CALL FOR PAPERS

  Coordination 2009

   Languages, Models, and Architectures for
 Concurrent and Distributed Software

11th International Conference

Member of the Federated Conferences on
   Distributed Computing Techniques
  Lisbon, Portugal 8 - 12 June 2009

-
  http://discotec09.di.fc.ul.pt/coordination
-
  Abstract submission:  28 January 2009
  Paper submission: 1 February 2009
  Author notification:  16 March 2009
  Camera-ready copy:1 April 2009
  Conference:   9 - 11 June 2009
-

Scope

Modern software lives in a concurrent world.  The ubiquity of the
Internet allows distributed software components to be composed into
complex networked systems.  At the other end of the spectrum, with
multicore processors now the norm, concurrency is frequently necessary
to maximize application performance.

Coordination 2009 seeks high-quality papers on programming languages,
models, and architectures that address the challenge of building
robust distributed and concurrent applications.  The conference
focuses on the design and implementation of models that allow
compositional construction of large-scale concurrent and distributed
systems, including both practical and foundational models, runtime
systems, and related verification and analysis techniques.

  Topics of Interest

DISTRIBUTED AND CONCURRENT PROGRAMMING MODELS: multicore programming,
 stream programming, data parallel programming, event-driven
 programming, web programming

FOUNDATIONS OF DISTRIBUTED AND CONCURRENT INTERACTION:
 models for processes, service composition and orchestration, workflow
 management, data query, tuple spaces

SPECIFICATION, VERIFICATION, AND TYPES: modeling and analysis of types
 and properties related to security, dependability, resource
 consumption, and component conformance for concurrent and
 distributed systems

HIGH-LEVEL OPTIMIZATIONS: program transformations for performance
 enhancement, runtime load balancing techniques, static and
 dynamic resource management

QUALITY OF SERVICE: fault-tolerant programming models and runtime support,
models with responsiveness guarantees

DISTRIBUTED SOFTWARE MANAGEMENT: component and module systems for
 distributed software, dynamic software evolution and update
 technologies, configuration and deployment architectures

SYSTEM SUPPORT FOR PROGRAMMING MODELS: P2P frameworks, mobile ad-hoc
 networks, sensor networks, publish-subscribe systems, event
 processing

CASE STUDIES: application of novel distributed and concurrent
 techniques in business process modeling, e-commerce, factory
 automation, collaboration, command and control

-

Submission Guidelines

The Coordination 2009 conference 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 postscript or PDF, using the SPRINGER LNCS
style. Papers should not exceed 15 pages in length. Each paper will
undergo a thorough process of review and the conference proceedings
will be published by Springer-Verlag in the LNCS series. Proceedings
will be made available at the conference.

Selected papers will be invited to a special issue of the journal
Science of Computer Programming

-

 Coordination '09 Organization

PC Chairs:
John Field, IBM Research, USA
Vasco T. Vasconcelos, University of Lisbon, Portugal

Program Committee:
TBA

Steering Committee:
Farhad Arbab, CWI, NL
Rocco De Nicola, University of Florence, IT (CHAIR)
Chris Hankin, Imperial College London, UK
Jean-Marie 

[TYPES/announce] CADE-22 second call for papers

2008-12-20 Thread Carsten Schuermann
[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]



 SECOND CALL FOR PAPERS

 CADE-22
 22nd International Conference on Automated Deduction
   McGill University, Montreal, Canada
August 2-7, 2009


Submission Deadline: 23 Feb 2009
  http://complogic.cs.mcgill.ca/cade22/


GENERAL INFORMATION
 CADE is the major forum for the presentation of research in all
 aspects of automated deduction. The conference programme will
 include invited talks, paper presentations, system
 descriptions, workshops, tutorials, and system competitions.

SCOPE
 We invite high-quality submissions on the general topic of
 automated deduction, including foundations, applications,
 implementations and practical experiences.

 Logics of interest include, but are not limited to

   o propositional, first-order, equational, higher-order,
 classical, description, modal, temporal, many-valued,
 intuitionistic, other non-classical, meta-logics,
 logical frameworks, type theory and set theory.

 Methods of interest include, but are not limited to

   o saturation, resolution, instance-based, tableaux, sequent
 calculi, natural deduction, term rewriting, decision
 procedures, model generation, model checking, constraint
 solving, induction, unification, proof planning, proof
 checking, proof presentation and explanation.

 Applications of interest include, but are not limited to

   o program analysis and verification, hardware verification,
 mathematics, natural language processing, computational
 linguistics, knowledge representation, ontology reasoning,
 deductive databases, functional and logic programming,
 robotics, planning, and other areas of AI.

INVITED SPEAKERS:
 Konstantin Korovin   The University of Manchester
 Martin RinardMassachusetts Institute of Technology
 Mark Stickel SRI International

WORKSHOPS, TUTORIALS, SYSTEM COMPETITION:
 A two-day workshop and tutorial programme will be co-organized
 with the conference. In addition, the annual CADE ATP System
 Competition (CASC) will be held during the conference. Details
 will be published in separate calls and on the conference
 website.

PUBLICATION DETAILS:
 The proceedings of the conference will be published in the
 Springer LNAI/LNCS series.

SUBMISSION INSTRUCTIONS:
 Submissions can be made in the categories 'regular papers' and
 'system descriptions'. The page limit in Springer LNCS style is
 15 pages for regular papers and 5 pages for system
 descriptions. Full system descriptions that provide in-depth
 presentation of original ideas in an implemented system can be
 submitted as regular papers. For the benefit of reviewers,
 additional material may be provided by a clearly marked
 appendix or a reference to a manuscript on a website. It is at
 the discretion of the reviewers whether such supplements will
 be considered. All regular papers will be evaluated according
 to the highest standards in terms of originality, significance,
 technical quality, and readability.

 Submissions must be in English and standard conforming pdf
 format. Submissions must be unpublished and not submitted for
 publication elsewhere. Authors are strongly encouraged to
 produce their papers in LaTeX.

 Formatting instructions and the LNCS style files can be
 obtained via http://www.springer.de/comp/lncs/authors.html.

 To submit your paper please use the EasyChair submission system
 at this address:
 http://www.easychair.org/conferences/?conf=cade22.

IMPORTANT DATES:
 A paper title and a short abstract of about 100 words must be
 submitted before the paper.

 16  Feb 2009 Abstract submission deadline
 23  Feb 2009 Paper submission deadline
 10  Apr 2009 Notification of paper decisions
 14  May 2009 Camera-ready papers due

 2-3 Aug 2009 Workshops  Tutorials
 4-7 Aug 2009 Conference, including CASC

PROGRAM COMMITTEE:
 Alessandro Armando Università di Genova
 Franz Baader   Technische Universität Dresden
 Peter Baumgartner  NICTA, Canberra
 Maria Paola Bonacina   Università degli Studi di Verona
 Bernhard Beckert   Universität Koblenz-Landau
 Nikolaj BjørnerMicrosoft Research
 Alessandro Cimatti Istituto per la Ricerca Scientifica e
Tecnologica, Trento
 Silvio GhilardiUniversità degli Studi di Milano
 Jürgen Giesl   RWTH Aachen
 Rajeev GoréThe Australian National University
 Reiner Hähnle  Chalmers University of Technology
 John Harrison  Intel Corporation
 Miki Hermann   École Polytechnique
 Ullrich HustadtUniversity of Liverpool
 Katsumi Inoue  National Institute of Informatics, Japan
 Tommi Junttila Helsinki University of Technology
 Deepak Kapur   University of New Mexico
 Alexander Leitsch  

[TYPES/announce] CiE 2009, Heidelberg, Germany, 19-24 July 2009 - Second Call for Papers

2008-12-20 Thread S B Cooper
[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]



 Second Call for Papers
  CiE 2009: COMPUTABILITY IN EUROPE 2009 -
 Mathematical Theory and Computational Practice
  Heidelberg, Germany
   19 - 24 July 2009

   Deadline for submissions: 20 JANUARY, 2009

http://www.math.uni-heidelberg.de/logic/cie2009/



CiE 2009 is the fifth in a series of conferences 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 took place in
Amsterdam (2005), Swansea (2006), Siena (2007) and Athens (2008).

TUTORIALS: Pavel Pudlak, Luca Trevisan.

INVITED SPEAKERS: Manindra Agrawal, Jeremy Avigad, Phokion Kolaitis,
Peter Koepke, Andrea Sorbi, Rafael D. Sorkin, Vijay Vazirani.

SPECIAL SESSIONS on Algorithmic Randomness (E. Mayordomo, W. Merkle),
Computational Model Theory (J. Knight, A. Morozov), Computation in
Biological Systems - Theory and Practice (A. Carbone, E. Csuhaj-Varju),
Optimization and Approximation (M. Halldorsson, G. Reinelt), Philosophical
and Mathematical Aspects of Hypercomputation (J. Ladyman, P. Welch),
Relative Computability (R. Downey, A. Soskova)

SPECIAL SESSION INVITED SPEAKERS CONFIRMED SO FAR: Laurent Bienvenu,
Friedrich Eisenbrand, Ekaterina Fokina, Hristo Ganchev, Sergey Goncharov,
Bjorn Kjos-Hanssen, Russell Miller, Antonio Montalban, Keng Meng Ng,
Ion Petre, Alberto Policriti, Francisco J. Romero-Campero, Richard Shore,
Nikolai Vereshchagin, David Westhead.

CiE 2009 has a broad scope and bridges the gap from the theoretical
methods of mathematical and meta-mathematical flavour to the applied and
industrial questions of computational practice. The conference aims to
bring together researchers who want to explore the historical and
philosophical aspects of the field.

We particularly invite papers that build bridges between different parts
of the research community. Since women are underrepresented in mathematics
and computer science, we emphatically encourage submissions by female
authors. The Elsevier Foundation is supporting the CiE conference series
in the programme Increasing representation of female researchers in the
computability community. This programme will allow us to fund child-care
support, a mentoring system for young female researchers, and also a small
number of grants for female researchers, covering their registration fees.

The dates around the submission process are as follows:

Submission Deadline: 20 January 2009
Notification of Authors: 16 March 2009
Deadline for Final Version:  17 April 2009

CiE 2009 conference topics include, but not exclusively:

* Admissible sets
* Analog computation
* Artificial intelligence
* Automata theory
* Classical computability and degree structures
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational complexity
* Computational learning and complexity
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* 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
* Mathematical models of emergence
* Molecular computation
* Natural computing
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebra
* Programming language semantics
* Proof mining
* Proof theory and computability
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Swarm intelligence
* Type systems and type theory
* Uncertain reasoning
* Weak arithmetics and applications

Contributed papers will be selected from submissions received by the
PROGRAMME COMMITTEE consisting of:

Klaus Ambos-Spies (Heidelberg, co-chair), Giorgio Ausiello (Rome), Andrej
Bauer (Ljubljana), Arnold Beckmann (Swansea), Olivier Bournez (Nancy),
Vasco Brattka (Cape Town), Barry Cooper (Leeds), Anuj Dawar (Cambridge),
Jacques Duparc (Lausanne),