======================================================================
CALL FOR PARTICIPATION
PPDP 2011
13th International ACM SIGPLAN Symposium on
Principles and Practice of Declarative Programming
http://www-ps.informatik.uni-kiel.de/ppdp11/
July 20-22, 2011, Odense, Denmark
In cooperation with ACM SIGPLAN
Co-located with LOPSTR 2011, WFLP 2011, and AAIP 2011
======================================================================
ONLINE REGISTRATION IS OPEN, EARLY REGISTRATION DEADLINE: May 30, 2011
PPDP 2011 aims to provide a forum that brings together researchers
from the declarative programming communities, including those working
in the logic, constraint and functional programming paradigms, but
also embracing a variety of other paradigms such as visual
programming, executable specification languages, database languages,
AI languages and knowledge representation languages used, for example,
in the semantic web. The goal is to stimulate research in the use of
logical formalisms and methods for specifying, performing, and
analyzing computations, including mechanisms for mobility, modularity,
concurrency, object-orientation, security, and static analysis.
SYMPOSIUM PROGRAM (preliminary):
Wednesday, July 20, 2011:
9:00 - 10:00: PPDP/LOPSTR Invited Talk
* Fritz Henglein.
<TBA>
Coffee break
10:30 - 11:30: PPDP/LOPSTR Invited Talk
* Vitaly Lagoon.
The Challenges of Constraint-Based Test Generation
Coffee break
11:30 - 12:30: Session 1: Verification and Specification
* Felix Schernhammer and Jose Meseguer.
Incremental Checking of Well-Founded Recursive Specifications Modulo Axioms
* Kazuhiro Inaba, Soichiro Hidaka, Zhenjiang Hu, Hiroyuki Kato and Keisuke Nakano.
Graph-Transformation Verification using Monadic Second-Order Logic
Lunch and Excursion
Thursday, July 21, 2011:
9:00 - 10:00: Session 2: Declarative Languages
* Robert Giegerich, Stefan Janssen and Georg Sauthoff.
Bellman's GAP - A Declarative Language for Dynamic Programming
* Rafael Del Vado Vírseda and Fernando Pérez Morente.
A Modular Semantics for Higher-Order Declarative Programming with Constraints
Coffee break
10:30 - 12:30: Session 3: Analysis
* Jan Christiansen and Daniel Seidel.
Minimally Strict Polymorphic Functions
* Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, Jose Meseguer, Paliath Narendran and Ralf Sasse.
Protocol Analysis in Maude-NPA Using Unification Modulo Homomorphic Encryption
* Tony Bourdier and Horatiu Cirstea.
Symbolic analysis of network security policies using rewrite systems
* Dario Colazzo and Carlo Sartiani.
Precision and Complexity of XQuery Type Inference
Lunch break
14:00 - 15:00: Session 4: Concurrency
* David Sabel and Manfred Schmidt-Schauss.
A Contextual Semantics for Concurrent Haskell with Futures
* Jasmin Christian Blanchette, Tjark Weber, Mark Batty, Scott Owens, Susmit Sarkar.
Nitpicking C++ Concurrency
Coffee break
15:30 - 16:30: Session 5: Logic Programming and Constraints
* Vivek Nigam, Limin Jia, Boon Thau Loo and Andre Scedrov.
Maintaining Distributed Logic Programs Incrementally
* Rémy Haemmerlé, Pedro Lòopez-Garcìa and Manuel V. Hermenegildo.
CLP Projection for Constraint Handling Rules
Friday, July 22, 2011:
9:00 - 10:00: PPDP Invited Talk
* Andrey Rybalchenko.
Towards Automatic Synthesis of Software Verification Tools
Coffee break
10:30 - 12:30: Session 6: Types and Lambda Calculus
* Malgorzata Biernacka, Dariusz Biernacki and Serguei Lenglet.
Typing Control Operators in the CPS Hierarchy
* Bernardo Toninho, Luis Caires and Frank Pfenning.
Dependent Session Types via Intuitionistic Linear Type Theory
* Sandra Alves, Maribel Fernandez, Mário Florido and Ian Mackie.
Recursion in a linear typed lambda-calculus
* Nicolas Guenot.
Nested Proof Search as Reduction in the lambda-calculus
Lunch break and Closing
----------------------------------------------------------------------
