Calls for participation: 2011-08

2011-08-31

[Caml-list] Formal Methods in Computer Aided Design 2011 -- Call for Participation

****************************************************************************
FMCAD 2011
FORMAL METHODS IN COMPUTER-AIDED DESIGN
CALL FOR PARTICIPATION
****************************************************************************

The 11th International Conference on FORMAL METHODS IN COMPUTER-AIDED DESIGN

October 30 - November 2, 2011, Austin, TX, USA

http://www.fmcad.org/FMCAD11/

IMPORTANT DATES

Early Registration: September 27

Discounted Conference Hotel Registration: October 7

Conference: October 30 - November 2

FMCAD 2011 is the eleventh in a series of conferences on the theory and
application of formal methods in hardware and system design and
verification. FMCAD provides a leading international forum to researchers
and practitioners in academia and industry for presenting and discussing
novel methods, technologies, theoretical results, and tools for formal
reasoning about computing systems, as well as open challenges therein.

KEYNOTE SPEAKER

J Moore, Professor at UT Austin, winner of the ACM System Award (2005),
member of National Academy of Engineering, and ACM Fellow on "The Role
of Human Creativity in Mechanized Verification"

TUTORIAL SPEAKERS

Aarti Gupta, Senior Researcher at NEC on "Verifying Concurrent Programs"

John Hughes, Professor at Chalmers University of Technology and CEO of
QuviQ on "Specification Based Testing with QuickCheck" by

Vigyan Singhal, President and CEO of Oski Technology Inc
on "Planning for End-to-End Formal using Simulation-based Coverage"

Fabio Somenzi, Professor at CU Boulder on "IC3: Where Monolithic and
Incremental Meet"

Ivan Sutherland, Visiting Scientist at Portland State University, ACM
Turing Award winner (1988), member of National Academy of Engineering
and National Academy of Sciences on "Self-Timing: a Step Beyond
Synchrony"

PANEL SESSIONS

"Pervasive Formal Verification in Control System Design", moderated by
Lee Pike, Galois, Inc.

"Hardware Model Checking: Status, Challenges, and Opportunities",
moderated by Murali Talupur, Intel

For further details see http://www.fmcad.org/FMCAD11/advance-program.html.

ASSOCIATED WORKSHOPS AND COMPETITION

The following workshops are co-located with this year's conference:

The 10th International Workshop on the ACL2 Theorem Prover and Its
Applications (http://www.cs.ru.nl/~julien/acl2-11/)

The Design and Implementation of Formal Tools and Systems workshop
(http://www.nec-labs.com/research/system/systems_SAV-website/DIFTS11)

We are also proud to host this year's Hardware Model Checking Competition
(http://fmv.jku.at/hwmcc11).

REGISTRATION

Registration information is available at
http://www.fmcad.org/FMCAD11/registration.html. Note that the early
registration discount is only available until **September 27th, 2011**.
A list of recommended hotels with preferential rates is available at
http://www.fmcad.org/FMCAD11/venue.html.

ORGANIZATION

GENERAL CHAIRS
Per Bjesse, Synopsys Inc., Hillsboro, USA
Anna Slobodova, Centaur Technology, Austin, USA

TUTORIALS CHAIR
Barbara Jobstmann, VERIMAG, France

PUBLICATIONS CHAIR
Viktor Kuncak, EPFL, Switzerland

LOCAL ARRANGEMENTS CHAIR
David Rager, The University of Texas at Austin, USA

STEERING COMMITTEE
Jason Baumgartner, IBM, USA
Aarti Gupta, NEC Labs America, USA
Warren Hunt, University of Texas at Austin, USA
Panagiotis Manolios, Northeastern University, USA
Mary Sheeran, Chalmers University of Technology, Sweden

We hope to see you in Austin!

-The FMCAD 2011 Organization Committee-

[If you would like to be removed from the FMCAD mailing list, please respond
with "fmcad unsubscribe" as the subject line]

--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-08-19

[Caml-list] SSS 2011 - Call for Participation

Apologies if you receive multiple copies of this announcement.

******************************************************************************
- SSS 2011 -

* CALL FOR PARTICIPATION *

13th International Symposium on
Stabilization, Safety, and Security of Distributed Systems

October 10-12, 2011
Grenoble, France
(Previously in Shinagawa (Tokyo), Japan)

http://www.jaist.ac.jp/sss2011/
******************************************************************************

The Symposium is a prestigious international forum for researchers and
practitioners in the design and development of fault-tolerant distributed
systems with self-* properties, such as self-stabilizing, self-configuring,
self-organizing, self-managing, self-repairing, self-healing, self-optimizing,
self-adaptive, and self-protecting. Research in distributed systems is now
at a crucial point in its evolution, marked by the importance of dynamic
systems such as peer-to-peer networks, large-scale wireless sensor networks,
mobile ad hoc networks, robotic networks, etc. Moreover, new applications such
as grid and web services, banking and e-commerce, e-health and robotics,
aerospace and avionics, automotive, industrial process control, etc. have
joined the traditional applications of distributed systems.

The conference provides a wide spectrum of topics, covered in the following
tracks:
* Ad-Hoc, Sensor, and Dynamic Networks
* Fault-Tolerance and Dependable Systems
* Overlay and Peer-to-Peer Networks
* Safety and Verification
* Security
* Self-Organizing and Autonomic Networks
* Self-Stabilization

Registration information is available at http://www.jaist.ac.jp/sss2011/

-=-=-=-=-=-=-=-=-
TENTATIVE PROGRAM
-=-=-=-=-=-=-=-=-

-----------------------
Sunday, October 9, 2011
-----------------------

17:30 - 20:00 Welcome, pre-registration at Aconit
(http://www.aconit.org/index_en.php)

------------------------
Monday, October 10, 2011
------------------------

8:00 - 8:45 Registration

8:45 - 9:00 Opening

9:00 - 10:00 Invited Speaker

Toshimitsu Masuzawa
Silence is Golden: Self-stabilizing Protocols Communication-efficient
after Convergence

10:00 - 10:30 Pause

10:30 - 12:00 Session 1: Self-Stabilization #1

Noga Alon, Shlomi Dolev, Swan Dubois, Hagit Attiya, Maria Gradinariu
Potop-Butucaru, and Sebastien Tixeuil
Pragmatic Self-Stabilization of Atomic Memory in Message-Passing Systems

Borzoo Bonakdarpour and Sandeep Kulkarni
Active Stabilization

Stephane Devismes, Ajoy K. Datta, Lawrence Larmore, and Yvan Rivierre
Self-Stabilizing Labeling and Ranking in Ordered Trees

12:00 - 14:00 Lunch

14:00 - 15:30 Session 2: Fault-Tolerance and Dependable Systems #1

Marc Shapiro, Nuno Preguiça, Carlos Baquero, and Marek Zawirski
Conflict-free Replicated Data Types

Roberto Baldoni, Silvia Bonomi, and Amir Soltani Nezhad
An Algorithm for implementing BFT Registers in Distributed Systems
with Bounded Churn

H B Acharya, Taehwan Choi, Rida Bazzi, and Mohamed Gouda
The K-Observer Problem in Computer Networks

15:30 - 16:00 Pause

16:00 - 17:00 Session 3: Self-Organizing and Autonomic Networks

M. C. Dourado, L.D. Penso, D. Rautenbach, and J.L. Szwarcfiter
The South Zone: Distributed Algorithms for Alliances

Jun Kiniwa and Kensaku Kikuta
Price Stabilization in Networks - What Is an Appropriate Model?

17:00 - 17:10 Break

17:10 - 18:00 Brief Announcements #1: Autonomic and Peer-to-peer Networks

Richard Anthony, Mariusz Pelc, and Haffiz Shuaib
Towards Interoperability Standards and Services for Autonomic Systems

Roberto Beraldi, Adriano Cerocchi, Fabio Papale, and Leonardo Querzoni
Distributed Self-Organizing Event Space Partitioning for
Content-Based Publish/Subscribe Systems

H B Acharya, Anil Kumar Katti, and Mohamed Gouda
A Conjecture on Traceability, and a New Class of Traceable Networks

Jacek Cichon, Rafal Kapelko, and Karol Marchwicki
A Note On Replication of Documents

Ajoy K. Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, and Erwan Le Merrer
A Stable and Robust Membership Protocol

18:00 - 18:30 Business Meeting

-------------------------
Tuesday, October 11, 2011
-------------------------

8:00 - 8:30 Registration

8:30 - 9:30 Invited Speaker

Nicola Santoro
Computing in Time-Varying Networks

9:30 - 10:00 Pause

10:00 - 12:30 Session 4: Ad-Hoc, Sensor, and Dynamic Networks #1

Ingy Ramzy and Anish Arora
Using Zero Knowledge to Share a Little Knowledge: Bootstrapping Trust
in Device Networks

Tatsuro Iida, Atsuko Miyaji, and Kazumasa Omote
POLISH: Proactive co-Operative LInk Self-Healing for Wireless Sensor Networks

Neeraj Singh and Dominique Mery
Analysis of DSR protocol in Event-B

Andreas Klappenecker, Hyunyoung Lee, and Jennifer Welch
Dynamic Regular Registers in Systems with Churn

12:30 - 14:00 Lunch

14:00 - 15:30 Session 5: Security, Safety and Verification

Christian Gorecki, Felix Freiling, Marc Kuehrer, and Thorsten Holz
TRUMANBOX: Improving Dynamic Malware Analysis by Emulating the Internet

Ofer Hermoni, Niv Gilboa, Eyal Felstaine, Yuval Elovici, and Shlomi Dolev
Rendezvous Tunnel for Anonymous Publishing: Clean Slate and Tor Based Designs

Bernadette Charron-Bost, Henri Debrat, and Stephan Merz
Formal Verification of Consensus Algorithms Tolerating Malicious Faults

15:30 - 16:00 Pause

16:00 - 17:00 Session 6: Self-Stabilization #2

Sven Köhler and Volker Turau
Space-Efficient Fault-Containment in Dynamic Networks

William Leal, Micah Mccreery, and Daniel Codo De Faria
The OCRC Fuel Cell Lab Safety System: A Self-Stabilizing Safety-Critical System

17:00 - 17:10 Break

17:10 - 18:00 Brief Announcements #2: Self-Stabilization,
Fault-tolerance, and Dynamic Networks

Fawaz Al-Azemi and Mehmet Karaata
A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs

Stephane Devismes, Ajoy K. Datta, and Lawrence Larmore
Sorting on Skip Chains

Yonghwan Kim, Tadashi Araragi, Junya Nakamura, and Toshimitsu Masuzawa
A Concurrent Partial Snapshot Algorithm for Large-scale, and Dynamic
Distributed Systems

Bjorn Saballus, Stephan-Alexander Posselt, and Thomas Fuhrmann
Fault-Tolerant Object Location in Large Compute Clusters

Shailesh Vaya
Faster Gossiping in Bidirectional Radio Networks with Large Labels

19:00 - Banquet

---------------------------
Wednesday, October 12, 2011
---------------------------

8:30 - 10:00 Session 7: Best Papers

- Best Paper
Andrew Berns, Sukumar Ghosh, and Sriram Pemmaraju
Building Self-Stabilizing Overlay Networks with the Transitive
Closure Framework

- Best Student Paper (ex aequo)
Damien Imbs and Michel Raynal
The Weakest Failure Detector to Implement a Register in Asynchronous
Systems with Hybrid Communication

- Best Student Paper (ex aequo)
Rizal Nor, Mikhail Nesterenko, and Christian Scheideler
Corona: A Stabilizing Deterministic Message-Passing Skip List

10:00 - 10:30 Pause

10:30 - 11:30 Session 8: Overlay and Peer-to-Peer Networks

Davide Frey, Arnaud Jegou, and Anne-Marie Kermarrec
Social Market: Combining Explicit and Implicit Social Networks

Phillip Stevens, Andrea Richa, and Christian Scheideler
Self-Stabilizing De Bruijn Networks

11:30 - 12:30 Session 9: Fault-Tolerance and Dependable Systems #2

Danny Dolev, Matthias Fuegger, Christoph Lenzen, and Ulrich Schmid
Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic:
Robust Pulse Generation

Armando Castaneda and Hagit Attiya
A Non-topological Impossibility Proof of k-set Agreement

12:30 - 14:00 Lunch

14:00 - 15:00 Session 10: Fault-Tolerance and Dependable Systems #3

Achour Mostefaoui, Michel Raynal, and Julien Stainer
Relations Linking Failure Detectors Associated with k-set Agreement
in Message-Passing Systems

Mohamed Ibrahim and Binoy Ravindran
Snake: Control Flow Distributed Software Transactional Memory

15:00 - 15:30 Pause

15:30 - 17:00 Session 11: Ad-Hoc, Sensor, and Dynamic Networks #2

Zohir Bouzid and Anissa Lamani
Robot Networks with Homonyms: The Case of Patterns Formation

Joffroy Beauquier, Peva Blanchard, Janna Burman, and Sylvie Delaet
Computing Time Complexity of Population Protocols with Cover Times -
The ZebraNet Example

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, and Paul Spirakis
The Computational Power of Simple Protocols for Self-Awareness on Graphs

17:00 - Closing

2011-08-15

[Caml-list] FroCoS 2011: Call for Participation

==================================================================
CALL FOR PARTICIPATION

FroCoS'11
8th International Symposium on
FRONTIERS OF COMBINING SYSTEMS

Saarbruecken, Germany, October 5-7, 2011
http://www.mpi-inf.mpg.de/conferences/frocos2011/
====================================================================

GENERAL INFORMATION
-------------------
FroCoS offers a common forum for the presentation and discussion
of research in the general area of combination, modularization
and integration of systems, with emphasis on logic-based systems
and their applications. This research touches many areas of computer
science such as computational logic, program development and
verification, artificial intelligence, automated reasoning,
constraint solving, declarative programming, and symbolic computation.

REGISTRATION & ACCOMODATION
---------------------------
Registration, accomodation, and travel information for FroCoS'11 can
be found on the FroCoS'11 web pages
http://www.mpi-inf.mpg.de/conferences/frocos2011/

DEADLINES:
Early registration: until 25.08.2011
Regular registration: from 26.08.2011 until 25.09.2011
Late registration: from 26.09.2011

SCIENTIFIC PROGRAM
* Presentation of 3 invited talks
* Presentation of 1 invited tutorial
* Presentation of 15 regular research papers

INVITED SPEAKERS
* Alessandro Artale, Free University of Bozen-Bolzano
* Martin Lange, University of Kassel
* Tobias Nipkow, Technical University München

TUTORIAL
* André Platzer, Carnegie Mellon University

PROGRAM
--------
The program is available at:
http://www.mpi-inf.mpg.de/conferences/frocos2011/frocos11-program.html

=====================================================================

2011-08-13

[Caml-list] ML Workshop: register early by August 15

ACM SIGPLAN Workshop on ML
Sunday, 18 September 2011, Tokyo, Japan (co-located with ICFP)
http://conway.rutgers.edu/ml2011/

CALL FOR PARTICIPATION
* Early Registration deadline is August 15! *

The ML family of programming languages includes dialects known as
Standard ML, Objective Caml, and F#. These languages have inspired
a large amount of computer-science research, both practical and
theoretical. This workshop aims to provide a forum for discussion and
research on ML and related technology (higher-order, typed, or strict
languages).

The format of ML 2011 will continue the return in 2010 to a more
informal model: a workshop with presentations selected from submitted
abstracts. Presenters will be invited to submit working notes, source
code, and extended papers for distribution to the attendees, but the
workshop will not publish proceedings, so any contributions may be
submitted for publication elsewhere. We hope that this format will
encourage the presentation of exciting (if unpolished) research and
deliver a lively workshop atmosphere.

INVITED SPEAKERS

Naoki Kobayashi (Tohoku University)

Atsushi Ohori (Tohoku University)

ACCEPTED TALKS

Efficiently scrapping boilerplate code in OCaml
Dmitri Boulytchev, Sergey Mechtaev

Implementing implicit self-adjusting computation (short talk)
Yan Chen, Joshua Dunfield, Matthew A. Hammer, Umut A. Acar

Lightweight typed customizable unmarshaling
Pascal Cuoq, Damien Doligez, Julien Signoles

Adding GADTs to OCaml: the direct approach
Jacques Garrigue, Jacques Le Normand

A demo of Coco: a compiler of monadic coercions in ML (short talk)
Nataliya Guts, Michael Hicks, Nikhil Swamy, Daan Leijen

Verifying liveness properties of ML programs
M. M. Lester, R. P. Neatherway, C.-H. L. Ong, S. J. Ramsay

MixML remixed
Andreas Rossberg, Derek Dreyer

Report on OCaml type debugger
Kanae Tsushima, Kenichi Asai

Camomile: a Unicode library for OCaml (short talk)
Yoriyuki Yamagata

PROGRAM COMMITTEE

Amal Ahmed (Indiana University)
Andrew Tolmach (Portland State University)
Anil Madhavapeddy (University of Cambridge)
Chung-chieh Shan (chair)
Joshua Dunfield (Max Planck Institute for Software Systems)
Julia Lawall (University of Copenhagen)
Keisuke Nakano (University of Electro-Communications)
Martin Elsman (SimCorp)
Walid Taha (Halmstad University)

STEERING COMMITTEE

Eijiro Sumii (chair) (Tohoku University)
Andreas Rossberg (Google)
Jacques Garrigue (Nagoya University)
Matthew Fluet (Rochester Institute of Technology)
Robert Harper (Carnegie Mellon University)
Yaron Minsky (Jane Street)

2011-08-10

[Caml-list] PEPM 2012 Second call for papers

Please accept in our apologies for multiple postings of this announcement.

ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation
January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12)

Call For Papers
Paper submission deadline: Mon, October 10, 2011, 23:59, GMT

http://www.program-transformation.org/PEPM12

The PEPM Symposium/Workshop series aims to bring together researchers
and practitioners working in the broad area of program transformation,
which spans from refactoring, partial evaluation, supercompilation,
fusion and other metaprogramming to model-driven development, program
analyses including termination, inductive programming, program
generation and applications of machine learning and probabilistic
search. PEPM focuses on techniques, supporting theory, tools, and
applications of the analysis and manipulation of programs. Each
technique or tool of program manipulation should have a clear,
although perhaps informal, statement of desired properties, along with
an argument how these properties could be achieved.

Topics of interest for PEPM'12 include, but are not limited to:

- Program and model manipulation techniques such as:
supercompilation, partial evaluation, fusion, on-the-fly program
adaptation, active libraries, program inversion, slicing,
symbolic execution, refactoring, decompilation, and obfuscation.

- Program analysis techniques that are used to drive program/model
manipulation such as: abstract interpretation, termination
checking, binding-time analysis, constraint solving, type systems,
automated testing and test case generation.

- Techniques that treat programs/models as data objects including
metaprogramming, generative programming, embedded domain-specific
languages, program synthesis by sketching and inductive programming, staged
computation, and model-driven program generation and transformation.

- Application of the above techniques including case studies of
program manipulation in real-world (industrial, open-source)
projects and software development processes, descriptions of
robust tools capable of effectively handling realistic applications,
benchmarking. Examples of application domains include legacy
program understanding and transformation, DSL implementations,
visual languages and end-user programming, scientific computing,
middleware frameworks and infrastructure needed for distributed and
web-based applications, resource-limited computation, and security.

To maintain the dynamic and interactive nature of PEPM, we will
continue the category of `short papers' for tool demonstrations and
for presentations of exciting if not fully polished research, and of
interesting academic, industrial and open-source applications that are
new or unfamiliar.

Student attendants with accepted papers can apply for a SIGPLAN PAC grant to
help cover travel expenses and other support.

All accepted papers, short papers included, will appear in formal
proceedings published by ACM Press and will be included in the ACM Digital
Library. Selected papers may later on be invited for a journal special
issue dedicated to PEPM'12.

Submission Categories and Guidelines

Authors are strongly encouraged to consult the advice for authoring
research papers and tool papers before submitting. The PC Chairs
welcome any inquiries about the authoring advice.

Regular research papers must not exceed 10 pages in ACM Proceedings
style. Short papers are up to 4 pages in ACM Proceedings
style. Authors of tool demonstration proposals are expected to present
a live demonstration of the described tool at the workshop (tool
papers should include an additional appendix of up to 6 extra pages
giving the outline, screenshots, examples, etc. to indicate the
content of the proposed live demo at the workshop).

Important Dates

- Paper submission: Mon, October 10, 2011, 23:59, GMT
- Author notification: Tue, November 8, 2011
- Workshop: Mon-Tue, January 23-24, 2012

Invited Speakers

- Markus Pueschel (ETH Zurich, Switzerland)
- Martin Berger (University of Sussex, UK)

Program Chairs

- Oleg Kiselyov (Monterey, CA, USA)
- Simon Thompson (University of Kent, UK)

Program Committee Members

- Emilie Balland (INRIA, France)
- Ewen Denney (NASA Ames Research Center, USA)
- Martin Erwig (Oregon State University, USA)
- Sebastian Fischer (National Institute of Informatics, Japan)
- Lidia Fuentes (Universidad de Malaga, Spain)
- John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain)
- Dave Herman (Mozilla Research, USA)
- Stefan Holdermans (Vector Fabrics, the Netherlands)
- Christian Kaestner (University of Marburg, Germany)
- Emanuel Kitzelmann (International Computer Science Institute, USA)
- Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences)
- Shin-Cheng Mu (Academia Sinica, Taiwan)
- Alberto Pardo (Universidad de la Repu'blica, Uruguay)
- Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece)
- Anthony M. Sloane (Macquarie University, Australia)
- Armando Solar-Lezama (MIT, USA)
- Aaron Stump (The University of Iowa, USA)
- Kohei Suenaga (University of Kyoto, Japan)
- Eric Van Wyk (University of Minnesota, USA)
- Kwangkeun Yi (Seoul National University, Korea)

[Caml-list] Continuation Workshop 2011: Call for participation

ACM SIGPLAN Continuation Workshop 2011
http://logic.cs.tsukuba.ac.jp/cw2011/
co-located with ICFP 2011, Tokyo, Japan
Saturday, September 24, 2011

Call for Participation
Early Registration deadline is August 15!

Continuations have been discovered many times, which highlights their
many applications in programming language semantics and program
analysis, linguistics, logic, parallel processing, compilation and web
programming. Recently, there has been a surge of interest
specifically in delimited continuations: new implementations (in
Scala, Ruby, OCaml, Haskell), new applications (to probabilistic
programming, event-driven distributed processing), substructural and
constructive logics, natural language semantics.

The goal of the Continuation Workshop is to make continuations more
accessible and useful -- to practitioners and to researchers in
various areas of computer science and outside computer science. We
wish to promote communication among the implementors and users in many
fields. We would like to publicize the applications of continuations
in academic (logic, linguistics) and practical fields and various
programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc.).

Invited talks
-------------
Mats Rooth, Cornell University
http://conf.ling.cornell.edu/mr249/

From Logic to Effects and Back
Noam Zeilberger, Universite' Paris 7
http://www.pps.jussieu.fr/~noam/

Tutorials
---------
In the evening before the workshop, there will be a tutorial session
``Introduction to Programming with Shift and Reset''

Tutorial date and time: Friday, September 23, 2011, 19:00-21:00
Tutorial place: IIJ (next to NII, the place of the ICFP conference)
Tutorial speakers: Kenichi Asai and Oleg Kiselyov

Presentations
-------------

Non-Deterministic Search Library
Kenichi ASAI, Chihiro KANEKO

`Focus movement' by delimited continuations
Daisuke BEKKI

Swarm: transparent scalability through portable continuations
James DOUGLAS

Correctness of Functions with Shift and Reset
Noriko HIROTA, Kenichi ASAI

Yield, the control operator: applications and a conjecture
Roshan P. JAMES, Amr SABRY

Demonstration of Continuation based C on GCC
Shinji KONO

Modular rollback through free monads
Conor McBRIDE, Olin SHIVERS, Aaron TURON

Using delimited continuations for distributed computing with the CIEL engine
Derek G. MURRAY, Malte SCHWARZKOPF, Christopher SMOWTON,
Steven SMITH, Anil MADHAVAPEDDY, Steven HAND

The limit of the CPS hierarchy
Josef SVENNINGSSON

Visualizing continuations
Naoki TAKASHIMA, Yukiyoshi KAMEYAMA

2011-08-03

[Caml-list] DBPL '11 Call for participation

The 13th International Symposium
on Database Programming Languages
http://www.cs.cornell.edu/conferences/dbpl2011
Seattle, Washington, USA
August 29, 2011
co-located with VLDB 2011

Call for Participation

For over 20 years, DBPL has established itself as the principal venue
for publishing and discussing new ideas at the intersection of
databases and programming languages. Many key contributions in query
languages for object-oriented data, persistent databases, nested
relational data, semistructured data, as well as fundamental ideas in
types for query languages were first announced at DBPL. Today, the
emergence of new data management applications such as Semantic Web and
Web services, XML processing, Social and Sensor Networks, Cloud
Computing and Peer-to-peer data management has lead to a new flurry of
creative research in this area. DBPL is an established destination for
such new ideas.

----------------
INVITED SPEAKERS
----------------

* Philip Wadler (Edinburgh)
Databases and Programming Languages: Together again for the first time

* Christopher Olsten (Bionica Human Computing)
Programming and Debugging Large-Scale Data Processing Workflows

---------------
ACCEPTED PAPERS
---------------

* Temporal Data Model for Program Debugging
Demian Lessa, Bharat Jayaraman, Jan Chomicki
* DBWiki: A Database Wiki prototyped in Links
James Cheney, Sam Lindley, Heiko Mueller
* Chasing One's Tail: XPath Containment Under Cyclic DTDs
Peter Wood, Mahtab Montazerian
* On guarded simulations and acyclic first-order languages
George Fletcher, Jan Hidders, Stijn Vansummeren, Yongming Luo,
Francois Picalausa, Paul De Bra
* Remote Batch Invocation for Database Access
William Cook, Ben Wiedermann
* PSPARQL Query Containment
Melisachew Wudage Chekol, Jerome Euzenat, Pierre Geneves, Nabil Layaida
* Next Generation Database Programming and Execution Environment
Dirk Habich, Matthias Boehm, Maik Thiele, Benjamin Schlegel,
Ulrike Fischer, Hannes Voigt, Wolfgang Lehner
* Validity of Positive XPath Queries with Wildcard in the Presence of DTDs
Kenji Hashimoto, Yohei Kusunoki, Yasunori Ishihara, Toru Fujiwara

------------
REGISTRATION
------------

Registration and local arrangements are being handled through the main
VLDB conference.

* Registration: http://www.vldb.org/2011/?q=node/20
* Local Arrangements: http://www.vldb.org/2011/?q=node/21

----------
ORGANIZERS
----------

Nate Foster, Cornell University (Co-chair)
Anastasios Kementsietsidis, IBM (Co-chair)

Yanif Ahmad, Johns Hopkins
Gavin Bierman, MSR-Cambridge
Martin Bravenboer, LogicBlox
Songyun Duan, IBM
Floris Geerts, Edinburgh
Pierre Geneves, CNRS
Giorgio Ghelli, Pisa
Todd Green, UC Davis
Fritz Henglein, DIKU
Feifei Li, Florida State
Lipyeow Lim, Hawaii
Sam Lindley, Edinburgh
Kim Nguyen, LRI, Paris-Sud 11
Jorge Perez, UChile
Dimitris Theodoratos, NJIT
Yannis Velegrakis, Trento

Calls for participation