Calls for participation: 2008-06

2008-06-23

[Caml-list] RTA 2008 - Call for participation

[Apologies if you receive multiple copies]

********************************************************
* CALL FOR PARTICIPATION *
* *
* RTA 2008 *
* Rewriting Techniques and Applications *
* 19th International Conference *
* *
* Castle of Hagenberg, Austria *
* *
* July 15-17, 2008. Workshops July 14, July 18 *
* http://www.risc.uni-linz.ac.at/conferences/rta2008/

*
* *
********************************************************

REGISTRATION
http://www.risc.uni-linz.ac.at/conferences/rta2008/registration.html
--------------------------------------------------------------------

LOCATION, TRAVEL, ACCOMMODATION (Updated):
http://www.risc.uni-linz.ac.at/conferences/rta2008/location.html
--------------------------------------------------------------------

IMPORTANT DATES:
Early registration deadline: June 30, 2008
Pre-conference workshops: July 14, 2008
Conference: July 15-17, 2008
Post-conference workshops: July 18, 2008
IFIP WG 1.6 meeting: July 18, 2008
--------------------------------------------------------------------

The 19th International Conference on Rewriting Techniques and
Applications (RTA 2008) is organised as part of the RISC Summer
2008, which comprises five conferences, five workshops and the
Training School in Symbolic Computation, and is followed by the
3rd International School on Rewriting in Obergurgl.

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; theorem proving; system synthesis and
verification; proof checking; reasoning about programming
languages and logics; program transformation;

* Foundations: matching and unification; narrowing; completion
techniques; strategies; rewriting calculi, constraint solving;
tree automata; termination; combination;

* Frameworks: string, term, and graph rewriting; lambda-calculus
and higher-order rewriting; constrained rewriting/deduction;
categorical and infinitary rewriting; integration of decision
procedures;

* Implementation: implementation techniques; parallel execution;
rewrite tools; termination checking;

* Semantics: equational logic; rewriting logic; rewriting models
of programs.

INVITED TALKS:
* Véronique Cortier (LORIA, CNRS, Nancy).
Verification Techniques for Cryptographic Protocols.
* Thomas Hillenbrand (MPI, Saarbrücken).
Fast Equational Reasoning with Waldmeister.
* Albert Rubio (UPC, Barcelona).
Present and Future of Proving Termination of Rewriting.

INVITED TUTORIAL:
* Erich Kaltofen (North Carolina State University).
The algebraic Synthesis of Algorithms.

The complete program is available at
http://www.risc.uni-linz.ac.at/conferences/rta2008/program.html

PROGRAMME COMMITTEE CHAIR:
* Andrei Voronkov University of Manchester

http://www.voronkov.com/

PROGRAMME COMMITTEE:
* Maribel Fernández King's College London
* Neil Ghani University of Strathclyde
* Jürgen Giesl RWTH Aachen
* Guillem Godoy Universidad Politécnica de Cataluña
* Jean Goubault-Larrecq ENS Cachan
* Tetsuo Ida University of Tsukuba
* Claude Kirchner INRIA
* Konstantin Korovin University of Manchester
* Temur Kutsia Johannes Kepler University Linz
* Aart Middeldorp University of Innsbruck
* Paliath Narendran SUNY at Albany
* Robert Nieuwenhuis Universidad Politécnica de Cataluña
* Michaël Rusinowitch INRIA
* Aaron Stump Washington University in St. Louis
* Jean-Marc Talbot Université de Provence
* Yoshihito Toyama Tohoku University
* Ralf Treinen Université Paris Diderot
* Andrei Voronkov University of Manchester
* Hans Zantema Technische Universiteit Eindhoven

GENERAL CHAIR:
* Bruno Buchberger Johannes Kepler University Linz

ORGANISING COMMITTEE CHAIR:
* Temur Kutsia Johannes Kepler University Linz

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2008-06-17

[Caml-list] TLDI 2009 Call for Papers

*********************************************************************
CALL FOR PAPERS

TLDI 2009

ACM SIGPLAN Workshop on
Types in Language Design and Implementation

24 January 2009
Savannah, Georgia, USA

To be held in conjunction with POPL 2009

http://ttic.uchicago.edu/~amal/tldi2009
*********************************************************************

IMPORTANT DATES

Submission: 8 Oct 2008, 5PM EDT (Wed)
Notification: 8 Nov 2008 (Sat)
Camera ready: 19 Nov 2008 (Wed)
TLDI'09: 24 January 2009 (Sat)

SCOPE

The role of types and proofs in all aspects of language design,
compiler construction, and software development has expanded greatly
in recent years. Type systems, type analyses, and formal deduction
have led to new concepts in compilation techniques for modern
programming languages, verification of safety and security properties
of programs, program transformation and optimization, and many other
areas. In light of this expanding role of types, the ACM SIGPLAN
Workshop on Types in Language Design and Implementation (TLDI'09)
follows six previous International Workshops on types in compilation
and language design (TIC'97, TIC'98, TIC'00, TLDI'03, TLDI'05, and
TLDI'07), with the hope of bringing together researchers to share new
ideas and results in this area.

Submissions for this event are invited on all interactions of types
with language design, implementation, and programming methodology.
This includes both practical applications and theoretical aspects.
TLDI'09 specifically encourages papers from a broad field of
programming language and compiler researchers, including those working
in object-oriented, dynamically-typed, late-binding, systems
programming, and mobile-code paradigms, as well as traditional
fully-static type systems. Topics of interest include:

- Typed intermediate languages and type-directed compilation
- Type-based language support for safety and security
- Types for interoperability
- Type systems for system programming languages
- Type-based program analysis, transformation, and optimization
- Dependent types and type-based proof assistants
- Types for security protocols, concurrency, and distributed computing
- Type inference and type reconstruction
- Type-based specifications of data structures and program invariants
- Type-based memory management
- Proof-carrying code and certifying compilation

This is not meant to be an exhaustive list; papers on novel
utilizations of type information are welcome. Authors concerned about
the suitability of a topic are encouraged to inquire via electronic
mail to the program chair prior to submission.

SUBMISSION GUIDELINES

Authors should submit a full paper of no more than 12 pages (including
bibliography and appendices) by Wednesday, October 8, 2008 5PM Eastern
Daylight Savings Time. The submission deadline and length limitations
are firm. Submissions that do not meet these guidelines will not be
considered.

All submissions should be in standard ACM SIGPLAN conference format:
two columns, nine-point font on a ten-point baseline. Detailed
formatting guidelines are available on the SIGPLAN Author Information
page, along with a LaTeX class file and template:

http://www.sigplan.org/authorInformation.htm

Papers must be submitted in Adobe Portable Document Format (PDF) and
must be formatted for US Letter size (8.5"x11") paper. Authors for
whom this is a hardship should contact the program chair before the
deadline.

Submitted papers must adhere to the SIGPLAN Republication Policy:

http://www.sigplan.org/republicationpolicy.htm

Submissions should contain original research not published or
submitted for publication elsewhere.

The URL for submission will be announced closer to the deadline.

GENERAL CHAIR

Andrew Kennedy Microsoft Research, Cambridge

PROGRAM CHAIR

Amal Ahmed Toyota Technological Institute, Chicago

PROGRAM COMMITTEE

Amal Ahmed Toyota Technological Institute, Chicago (Chair)
Juan Chen Microsoft Research
Peter Dybjer Chalmers University of Technology
Jeff Foster University of Maryland, College Park
Neal Glew Intel
Robert Harper Carnegie Mellon University
Andrew Myers Cornell University
Atsushi Ohori Tohoku University
Matthew Parkinson University of Cambridge
Didier Remy INRIA Paris-Rocquencourt
Andreas Rossberg Max Planck Institute for Software Systems

STEERING COMMITTEE

Craig Chambers University of Washington
Robert Harper Carnegie Mellon University (Chair)
Xavier Leroy INRIA Paris-Rocquencourt
Greg Morrisett Harvard University
George Necula Rinera Networks, Inc., and UC Berkeley
Atsushi Ohori Tohoku University
Francois Pottier INRIA Paris-Rocquencourt
Zhong Shao Yale University

[Caml-list] IJCAR 2008 in Australia

-------------------------------------------------------------------------------
IJCAR 2008 - The 4th International Joint Conference on Automated Reasoning
Sydney, Australia, 10th - 15th August, 2008

http://2008.IJCAR.org
-------------------------------------------------------------------------------
Call for Participation
----------------------
IJCAR is the premier international joint conference on all aspects of automated
reasoning, including foundations, implementations, and applications. IJCAR 2008
is the 4th International Joint Conference on Automated Reasoning, and is a
merger of the following leading conferences and workshops:
+ CADE (Conference on Automated Deduction),
+ FroCoS (Symposium on Frontiers of Combining Systems),
+ FTP (Workshop on First-order Theorem Proving)
+ TABLEAUX (Conference on Analytic Tableaux and Related Methods)

Registration, accomodation, and travel/visa information is on the IJCAR 2008
web pages. Book your flight to Sydney today!
-------------------------------------------------------------------------------
Scientific Program
------------------
+ Presentation of 4 invited talks
+ Presentation of 26 regular research papers
+ Presentation of 13 system descriptions
+ Presentation of the Herbrand Award to Prof. Edmund Clarke, CMU.
+ Four workshops, four tutorials, the CADE ATP System Competition (CASC-J4)
-------------------------------------------------------------------------------
Invited Speakers
----------------
+ Hubert Comon-Lundh
Challenges in the Automated Verification of Security Protocols
+ Nachum Dershowitz
Canonicity
+ Aarti Gupta
Software Verification: Roles and Challenges for Automatic Decision Procedures
+ Carsten Lutz
Query Answering in Description Logics
-------------------------------------------------------------------------------
Workshops, Tutorials
--------------------
There will be four workshops and four tutorials before IJCAR, 10th and 11th
August. See their individual WWW pages, linked from the IJCAR WWW pages for
more information.
+ Workshops
- The 5th International Verification Workshop (VERIFY'08)
- Practical Aspects of Automated Reasoning/
Evaluation of Systems for Higher Order Logic (PAAR/ESHOL)
- Complexity, Expressibility, & Decidability in Automated Reasoning (CEDAR'08)
- Constraints in Formal Verification
+ Tutorials
- Introduction to Nominal Isabelle - Christian Urban
- Formal Methods in Use at Galois, Inc. - Joe Hurd
- SMT Solvers in Program Analysis and Verification - Nikolaj Bjorner and
Leonardo de Moura
- Coalgebraic Logics and Applications (COALA) - Dirk Pattinson
-------------------------------------------------------------------------------
Social Events
-------------
+ Welcome reception at the conference hotel.
+ Excursion to the amazing Blue Mountains
+ Conference banquet
+ CASQ-J4 - the CADE Squash Competition
All are included in the conference package, as well as refreshment breaks and
lunches for all main conference days.
-------------------------------------------------------------------------------
Student Travel Awards
---------------------
Two award schemes that provide sponsorhips to support student attendance at
IJCAR are available. See the IJCAR 2008 WWW pages for details. We are also
organizing room sharing at the conference hotel.
-------------------------------------------------------------------------------
Contact: Peter Baumgartner (conference chair) Peter.Baumgartner@nicta.com.au
-------------------------------------------------------------------------------

2008-06-13

[Caml-list] Call for Participation: Conferences on Intelligent Computer Mathematics

[Apologies if you receive multiple copies]

********************************************************
* CALL FOR PARTICIPATION *
* *
* CICM 2008 *
* Conferences in Intelligent Computer Mathematics *
* --- *
* [AISC - Calculemus - MKM] *
* *
* 27 July - 1 August 2008 *
* *
*

http://events.cs.bham.ac.uk/cicm08/

*
* *
* Workshops: 27,29-31 July, 2008 *
* Doctoral Programme: 29-31 July, 2008 *
* *
********************************************************

The Conferences on Intelligent Computer Mathematics (CICM) brings
together researchers working in the intersection of Mathematics,
Computer Science, and Artificial Intelligence. CICM 2008 combine three
of the leading events in the area:

MKM 2008: 6th International Conference on Mathematical Knowledge Management
(28 July - 30 July)

Calculemus 2008: 15th Symposium on the Integration of Symbolic and
Mechanized Reasoning
(30 July - 1 August)

AISC 2008: 9th International Conference on Artificial Intelligence and
Symbolic Computation
(31 July - 1 August)

INVITED SPEAKERS:

Alan Bundy (University of Edinburgh, UK)
Thierry Bouche (Universite de Grenoble I, France)
Annie Cuyt (Universiteit Antwerpen, Belgium)
Thierry Coquand (Goteborg University, Sweeden)
Steve Linton (University of St. Andrews, UK)
Jochen Pfalzgraf (Universitaet Salzburg, Austria)

WORKSHOPS:

DML: Towards Digital Mathematics Library
(27 July,2008)
ESARM: Empirically Successful Automated Reasoning for Mathematics
(27 July, 2008)
MathUI: Mathematical User-Interfaces Workshop
(27 July, 2008)
PLMMS: Programming Languages for Mechanized Mathematics Systems
(29 July, 2008)
ARW: 15th Workshop on Automated Reasoning: Bridging the Gap between
Theory and Practice
(30-31 July, 2008)

DOCTORAL PROGRAMME: http://events.cs.bham.ac.uk/cicm08/doctoral/

(29-31 July, 2008)

REGISTRATION: http://events.cs.bham.ac.uk/cicm08/registration.php

TRAVEL Information: http://events.cs.bham.ac.uk/cicm08/travel.php

ACCOMMODATION: http://events.cs.bham.ac.uk/cicm08/accommodation.php

2008-06-05

[Caml-list] [SAS-LOPSTR-PPDP-PLID 2008] Call for participation

******************************************************************

Call for Participation

SAS - LOPSTR - PPDP - PLID 2008

http://www.dsic.upv.es/~slp2008/

Valencia, Spain

******************************************************************
* EARLY REGISTRATION DEADLINE IS APPROACHING: JUNE 10, 2008 *
******************************************************************

SAS 2008, July 16-18
Static Analysis Symposium
http://www.dsic.upv.es/~sas2008/
-> Accepted papers: http://www.dsic.upv.es/~sas2008/accepted_papers.html

LOPSTR 2008, July 17-18
Symposium on Logic-Based Program Synthesis and Transformation

http://www.informatik.uni-kiel.de/%7Emh/lopstr08/

PPDP 2008, July 15-17
ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
http://www.clip.dia.fi.upm.es/Conferences/PPDP08/
-> Accepted papers: http://www.clip.dia.fi.upm.es/Conferences/PPDP08/accepted.html

PLID 2008, July 15
Workshop on Programming Language Interference and Dependence
http://www.clip.dia.fi.upm.es/Conferences/PLID08/home.php

*** REGISTRATION

Please register online at http://www.dsic.upv.es/~slp2008/
The early registration deadline is June 10, 2008.

******************************************************************

2008-06-03

[Caml-list] LaSh08 Call for Papers

LaSh08 - WORKSHOP ON LOGIC AND SEARCH
Computation of structures from declarative descriptions

Second Call For Papers

Leuven, Belgium, November 6-7, 2008

http://www.cs.kuleuven.be/~dtai/LaSh08

................................................................

IMPORTANT DATES:

Submission: August 15, 2008
Notification: September 15, 2008
Workshop: November 6-7, 2008

SCOPE:

In many real-life problems, we search for objects of complex nature --
plans, schedules, assignments. Such objects are often represented as
(finite) structures, which are implicitly specified by means of
theories in some logic. Thus, languages are needed to describe
structures, and algorithms to extract them from these implicit
descriptions. Propositional Satisfiability (SAT), Constraint
Programming (CP), and Answer Set Programming (ASP) are arguably the
three most prominent areas that develop such languages and techniques.

Each of these areas has been proposed as a declarative programming
approach to solving NP-complete combinatorial problems. Such problems
abound in computer science, engineering, operations research
computational biology and other fields. In many cases, progress is
limited by the difficulty of designing implicit representations of
structures (modeling), which hinders common acceptance of the aproach,
and the inability to solve sufficiently large instances of the
problems in practical time bounds (search algorithms). Therefore,
these three areas have as a major goal the development of practical
modeling languages and methodologies that support the modeling, and
algorithms and tools for efficient problem solving.

Despite the similar goals of these areas, in many respects SAT, ASP and
CP develop as three independent disciplines, focusing on rather different
particular problems or questions. There are few, if any, researchers
who are experts in all three areas. To date, we are not aware of any
meeting which specifically aims at bringing these three areas together.

Objectives
==========

LaSh08 aims to offer a discussion forum for research in SAT, ASP and
CP that focuses on the computation of structures from declarative
descriptions. We invite contributions on modeling languages,
methodologies, theoretical analysis, techniques, algorithms and
systems. The forum is an occasion to exchange ideas on the
state-of-the-art; to discuss specific technical problems; to formulate
challenges and opportunities ahead; to analyse differences and
simularities between the different areas; to study opportunities for
synergy and integration.

In particular, we would like to foster exchange at least on the
following topics:

-- integrations of SAT, ASP and/or CP technologies
-- comparisons of modeling languages
-- criteria for choice of modeling languages
(for modeling convenience or efficiency)
-- new algorithm directions
-- efficient modeling strategies
-- new applications
-- complexity results, tractable subsets
-- completeness results (e.g. capturing complexity classes)
-- methods for taking advantage of tractability results
-- SAT modulo theories
-- solver implementation techniques,
-- algorithms for grounding
-- modeling languages and constructs
(aggregates, global constraints,..)
-- search control and heuristics in the context of model generation
-- symmetry breaking in model construction
-- optimisation problems in model construction:
-- languages for optimality criteria;
-- algorithms for computing optimal models

Systems and Tools:
===================

LaSh08 will also provide an opportunity for presentation of implemented
systems and tools at a demo session. Thus, we invite submissions of
systems and tools that reflect the above ideas, and aim at facilitating
declarative problem solving, and making it practical and used.

Workshop format:
================

The workshops objective is to create an informal, stimulating
atmosphere for exchange of ideas. We invite also reports of work in
progress. There will be informal proceedings.

Invited speakers
=================
* Pascal Van Hentenryck, Brown University, title to be announced
* Robert Nieuwenhuis, Technical University of Catalonia,
title to be announced.

Organizing Committee
====================
* Enrico Giunchiglia, University of Genova
* Victor Marek, University of Kentucky
* David Mitchell, Simon Fraser University
* Eugenia Ternovska Simon Fraser University
* Mirek Truzczynski, University of Kentucky
* Marc Denecker, K.U.Leuven

Program Committee
=================
* Peter Baumgartner, The Australian National University
* Francesco Calimeri, University of Calabria
* Koen Claessen, Chalmers University of Technology
* Thomas Eiter, Vienna University of Technology
* Wolfgang Faber, University of Calabria
* Pierre Flener, Uppsala University
* Alan Frisch, University of York
* Enrico Giunchiglia, University of Genova
* Daniel LeBerre, Universite d'Artois
* Fangzen Lin, Hong kong University of Science and Technology
* Ines Lynce, Universidade Tecnica de Lisboa
* Tony Mancini, Sapienza Universita di Roma
* Victor Marek, University of Kentucky
* David Mitchell, Simon Fraser University
* Pierre Marquis, Universite d'Artois
* Ilkka Niemela, Helsinki University of Technology
* Karem Sakallah, University of Michigan
* Torsten Schaub, University of Potsdam
* Barry O'Sullivan, University College Cork
* Eugenia Ternovska Simon Fraser University
* Mirek Truszcznski, University of Kentucky
* Pascal Van Hentenryck, Brown University
* Toby Walsh, University of New South Wales

Local organisation
====================
* Marc Denecker, K.U.Leuven
* Joost Vennekens, K.U.Leuven

Location
=========

The workshop will take place in the Beguinage of Leuven,
Belgium. Leuven is an old flemish town, hosting the oldest university
of the lower countries. The Beguinage is a medieval city in the city,
where the beguines lived together to form a religious community. The
Beguinage is recognized as a Unesco World Heritage site.

Calls for participation