2009-12-22

[Caml-list] Final Call for Participation: TLDI'10

*********************************************************************
FINAL CALL FOR PARTICIPATION

TLDI 2010

ACM SIGPLAN Workshop on
Types in Language Design and Implementation

23 January 2010
Madrid, Spain

To be held in conjunction with POPL 2010

http://research.microsoft.com/~akenn/tldi2010/
*********************************************************************

IMPORTANT DATES

Early registration deadline for POPL: December 22, 2009 (TODAY!)

Hotel reservation deadline: December 28, 2009 (Monday)


VENUE

TLDI'10 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid.


REGISTRATION

To register for TLDI'10, follow the link from the POPL 2010 page, at

http://www.cse.psu.edu/popl/10/


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-based analyses and type-theoretic
deductive systems have been central to advances in compilation
techniques for modern programming languages, verification of safety
and security properties of programs, program transformation and
optimization, and many other areas. The ACM SIGPLAN Workshop on Types
in Language Design and Implementation brings researchers together to
share new ideas and results concerning all aspects of types and
programming, and is now an annual event.


INVITED SPEAKER

Matthias Felleisen, Northeastern University, Boston


PRELIMINARY PROGRAM

----------------------
Opening remarks: 9:20-9:30

Invited talk 9:30-10:30

*** Adding Types to Untyped Languages
Matthias Felleisen, Northeastern University, Boston

----------------------
** Session I 11:00-12:30

*** Effects for Cooperable and Serializable Threads
Jaeheon Yi and Cormac Flanagan

*** Race-free and Memory-safe Multithreading: Design and Implementation in Cyclone
Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas

*** Distributed programming with distributed authorization
Kumar Avijit, Anupam Datta and Robert Harper

----------------------
** Session II 2:30-4:00

*** let should not be generalized
Dimitrios Vytiniotis, Simon Peyton Jones and Tom Schrijvers

*** Pointwise Generalized Algebraic Data Types
Chuan-kai Lin and Tim Sheard

*** Verifying Event-Driven Programs using Ramified Frame Properties
Neelakantan Krishnaswami, Lars Birkedal and Jonathan Aldrich

----------------------
** Session III 4:30-5:30

*** Lightweight Linear Types in System F^o
Karl Mazurak, Jianzhou Zhao and Steve Zdancewic

*** F-ing Modules
Andreas Rossberg, Claudio Russo and Derek Dreyer

----------------------


GENERAL CHAIR

Andrew Kennedy, Microsoft Research, Cambridge


PROGRAM CHAIR

Nick Benton, Microsoft Research, Cambridge


PROGRAM COMMITTEE

Gilles Barthe, IMDEA Software, Spain
Viviana Bono, University of Torino, Italy
Giorgio Ghelli, University of Pisa, Italy
Dan Grossman, University of Washington, USA
Atsushi Igarashi, Kyoto University, Japan
Conor McBride, University of Strathclyde, UK
Jeremy Siek, University of Colorado at Boulder, USA
Zhong Shao, Yale University, USA
Matthieu Sozeau, Harvard University, USA
Chris Stone, Harvey Mudd College, USA
Kristian Støvring, ITU Copenhagen, Denmark


_______________________________________________
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

2009-12-21

[Caml-list] SERA2010: 3rd Call for Papers, Special Sessions, Workshops and Sponsorships; DEADLINE Feb 1, 2010

Dear colleagues,

[ Apologies for the crossposting or if you get multiple copies of this email ]

We would like to invite you to submit a paper and / or a special session /
workshop proposal to the 8th IEEE/ACIS International Conference on Software
Engineering Research, Management and Applications (SERA2010) on
May 24 - 26, 2010. The event will take place at Concordia University, Montreal,
Canada.

http://users.encs.concordia.ca/~sera2010/

Please take notice of the attached Call for Papers, Call for Workshop Proposals
and Call for Sponsorship for further information.

The deadline for submission of either papers or the workshop/special session
proposals HAS BEEN EXTENDED TO February 1, 2010.

We kindly ask you to distribute this announcement among the colleagues in your
institution and post it on research mailing lists you have access to that you
may think this is relevant.


Important dates:
================

Paper and Proposals Submission: February 1, 2010
Acceptance Notification: March 1, 2010
Camera-ready Paper & Pre-Registration: March 15, 2010


Topics:
=======

http://users.encs.concordia.ca/~sera2010/files/First_CFP_SERA2010.pdf

- Formal Methods and Tools
- New theoretical foundations in Software Engineering Modeling
- Business Process & Enterprise Integration Engineering
- Communication Systems and Networks
- Computer Game Development, User Modeling and Management
- Cost Modeling and Analysis
- Data Mining and Knowledge Recovery
- Distributed Intelligent Systems
- Healthcare Engineering
- Human Computer Interaction
- Parallel and Distributed Computing Telecommunications
- Service Oriented Computing
- Mobile/Wireless Computing
- Requirements Modeling and Management
- Process Management & Improvement
- Reengineering, Reverse Engineering
- Autonomic Computing
- Requirements Engineering
- Safety and Security Critical Software
- Software Agent Technology
- Web Engineering, Web-Based Applications
- Virtual Reality and Computer Graphics


Call for Sponsorship:
=====================

http://users.encs.concordia.ca/~sera2010/files/SERA2010-CallForSponsorship-last.pdf


Submission:
===========

We solicit research and experience papers as well as research-in-progress and
practitioner reports in any of the technical areas listed under Scope & Topics.
Submit your paper via the web-based conference management system following
the instructions below:

* First, please review the IEEE PDF specifications.
http://www.ieee.org/portal/cms_docs/pubs/confstandards/pdfs/IEEE-PDF-SpecV401.pdf

* Go to the Conference Management System and follow the instructions on the
"Electronic Submission Page" that it takes you to.
http://acis.cps.cmich.edu:8080/SERA2010/submit.html

* The file that you submit should include the paper title, abstract, keywords,
and introduction followed by the body of your paper. The author's name and
address MUST NOT appear in this file. This is to facilitate a blind review.

* Upload your full paper in two column format (not to exceed 10 single-spaced
pages) via the web-based conference management system in PDF format, or you
can submit your paper in the final manuscript format.

* The format of the final manuscript should be in a two-column format and 8 pages
in length. Up to an extra 2 pages (total of 8) can be purchased at registration
time (see registration form for pricing).

* Please select at least two keywords from the drop-down menu and check boxes.
If you cannot find the right category in the drop-down menu then please enter
a category for your paper in the summary. We need this information when
determining reviewers for your paper.

Submissions, refereeing, and all correspondence will be conducted by e-mail.
All papers must be submitted through our Conference Management System.

http://acis.cps.cmich.edu:8080/SERA2010/submit.html

The program committee will review each submission and judge it with respect
to its originality, significance, and relevance.


Publication:
============

http://users.encs.concordia.ca/~sera2010/Publication.html

Accepted papers will be published in the IEEE Computer Society.

Conference organizers will select approximately 20 outstanding papers from
SERA 2010 to be published in Springer's Studies in Computational
Intelligence (SCI). The book series will be distributed at the conference
site.


Workshops and Special Sessions:
==============================

http://users.encs.concordia.ca/~sera2010/Conference.html


Committees:
===========

http://users.encs.concordia.ca/~sera2010/People.html


For further inquires about SERA2010 conference and event planning, please
e-mail to:

sera2010-priv@encs.concordia.ca

You may obtain further information on the conference at its web site

http://users.encs.concordia.ca/~sera2010/

Sincerely yours,

SERA2010 organizers
===============================================================================

_______________________________________________
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

2009-12-19

[Caml-list] POPL 2010 - Call for Participation - Early Registration Dec 22

*********************************************************************
* ACM SIGPLAN-SIGACT Symposium *
* on *
* Principles of Programming Languages *
* *
* January 20-22, 2010 *
* Madrid, Spain *
* *
* Call for Participation *
* *
* http://www.cse.psu.edu/popl/10/ *
*********************************************************************

Important dates

* Early registration deadline: *** December 22, 2009 ***
* Hotel reservation deadline: December 28, 2009
* Conference: January 20-22, 2010

Hotel

All the conference events will take place at the Melia Castilla
Hotel, Madrid. We encourage attendees to stay at the conference
hotel. Information about the hotel can be found on the POPL web
page: http://www.cse.psu.edu/popl/10/

Scope

The annual Symposium on Principles of Programming Languages is a
forum for the discussion of fundamental principles and important
innovations in the design, definition, analysis, transformation,
implementation and verification of programming languages,
programming systems, and programming abstractions. Both
experimental and theoretical papers are welcome.

Preliminary program

A preliminary program can be found at the end of this email in text
format, or it can be found here:

http://www.cse.psu.edu/popl/10/program.html

Invited speakers

* Neil Gershenfeld (MIT, USA)
* Thomas A. Henzinger (IST, Austria)

Student Attendees

Students with accepted papers or posters are encouraged to apply for
a SIGPLAN PAC grant that will help to cover travel expenses to POPL.
Details on the PAC program and the application can be found in the
conference web site. PAC also offers support for companion travel.

General Chair:
Manuel Hermenegildo
Director, IMDEA Software Institute
Professor, C.S. Department, T.U. of Madrid (UPM), Spain

Program Chair:
Jens Palsberg
Professor, UCLA Computer Science Department

Program Committee:
Alex Aiken Stanford University
Rajeev Alur University of Pennsylvania
Cristiano Calcagno Imperial College, London
Juan Chen Microsoft Research
Wei-Ngan Chin National University of Singapore
Mads Dam Royal Institute of Technology, Stockholm
Erik Ernst Aarhus University
John Field IBM T. J. Watson Research Center
Cormac Flanagan UC Santa Cruz
Roberto Giacobazzi Universita' degli Studi di Verona
Rachid Guerraoui EPFL
Sorin Lerner UC San Diego
Calvin Lin University of Texas, Austin
Atsushi Ohori Tohoku University
Jens Palsberg UCLA
Andrey Rybalchenko Max Planck Institute for Software Systems
Amr Sabry Indiana University
Mooly Sagiv Tel-Aviv University
Peter Sewell University of Cambridge
Tayssir Touili CNRS-LIAFA

Affiliated Events

* WFLP: Functional and (Constraint) Logic Programming
* January 17, 2010

* VMCAI: Verification Model Checking and Abstract Interpretation
* January 17-19, 2010

* PADL: Practical Applications of Declarative Languages
* January 18-19, 2010

* DAMP: Declarative Aspects of Multicore Programming
* January 19, 2010

* PLPV: Programming Languages meets Program Verification
* January 19, 2010

* PEPM: Partial Evaluation and Semantics-Based Program Manipulation
* January 18-19, 2010

* TLDI:Types in Language Design and Implementation
* January 23, 2010


POPL 2010 Preliminary Program
-----------------------------

Wednesday, January 20, 2009
===========================

* Invited talk, 9:00-10:00
* Session Chair: Jens Palsberg (UCLA)
- Reconfigurable Asynchronous Logic Automata
Neil Gershenfeld (MIT, USA)

* Session: Concurrency, 10:30-11:30
* Session Chair: John Field (IBM T. J. Watson Research Center)
- On the Verification Problem for Weak Memory Models
Mohamed Faouzi Atig (LIAFA, University Paris Diderot),
Ahmed Bouajjani (LIAFA, University Paris Diderot),
Sebastian Burckhardt (Microsoft Research),
Madan Musuvathi (Microsoft Research)
- Coarse-Grained Transactions
Eric Koskinen (University of Cambridge), Matthew Parkinson
(University of Cambridge), Maurice Herlihy (Brown University)
- Sequential Verification of Serializability
H. Attiya (Technion), G. Ramalingam (Microsoft Research India),
N. Rinetzky (Queen Mary University of London)

* Session: Static Analysis I, 12:00-1:00
* Session Chair: Tayssir Touili (CNRS-LIAFA)
- Compositional May-Must Program Analysis: Unleashing the Power of
Alternation
Patrice Godefroid (Microsoft Research Redmond),
Aditya V. Nori (Microsoft Research India),
Sriram K. Rajamani (Microsoft Research India),
Sai Deep Tetali (Microsoft Research India)
- Continuity Analysis of Programs
Authors: Swarat Chaudhuri (Pennsylvania State University),
Sumit Gulwani (Microsoft Research),
Roberto Lublinerman (Pennsylvania State University)
- Program Analysis via Satisfiability Modulo Path Programs
William R. Harris (University of Wisconsin, Madison, WI),
Sriram Sankaranarayanan (NEC Laboratories America, Princeton, NJ),
Franjo Ivancic (NEC Laboratories America, Princeton, NJ),
Aarti Gupta (NEC Laboratories America, Princeton, NJ)

* Session: Verified Compilers, 2:30-3:30
* Session Chair: Sorin Lerner (UC San Diego)
- A simple, verified validator for software pipelining
Jean-Baptiste Tristan (INRIA Paris-Rocquencourt),
Xavier Leroy (INRIA Paris-Rocquencourt)
- A Verified Compiler for an Impure Functional Language
Adam Chlipala (Harvard University)
- Verified just-in-time compiler on x86
Magnus O. Myreen (University of Cambridge)

* Session: Type Inference, 4:00-5:00
* Session Chair: Benjamin Pierce (University of Pennsylvania)
- Dependent Types from Counterexamples
Tachio Terauchi (Tohoku University)
- Low-Level Liquid Types
Patrick Rondon (UC San Diego), Ranjit Jhala (UC San Diego),
Ming Kawaguchi (UC San Diego)
- Type Inference for Datalog with Complex Type Hierarchies
Max Schaefer (Semmle Ltd., Oxford), Oege de Moor (Semmle Ltd., Oxford)

Thursday, January 21, 2009
==========================

* Invited talk, 9:00-10:00
* Session Chair: Jens Palsberg (UCLA)
- From Boolean to Quantitative Notions of Correctness
Thomas A. Henzinger (IST, Austria)

* Session: Reasoning about Programs, 10:30-11:30
* Session Chair: Roberto Giacobazzi (Universita' degli Studi di Verona)
- Nominal System T
Andrew M. Pitts (University of Cambridge)
- A Theory of Indirection via Approximation
Aquinas Hobor (National University of Singapore),
Robert Dockins (Princeton University), Andrew W. Appel (Princeton University)
- A Relational Modal Logic for Higher-Order Stateful ADTs
Derek Dreyer (MPI-SWS), Georg Neis (MPI-SWS), Andreas Rossberg (MPI-SWS),
Lars Birkedal (ITU-Copenhagen)

* Session: Static Analysis II, 12:00-1:00
* Session Chair: Andrey Rybalchenko (Max Planck Institute for Software Systems)
- Decision Procedures for Algebraic Data Types with Abstractions
Philippe Suter (EPFL), Mirco Dotta (EPFL), Viktor Kuncak (EPFL)
- Automatic Numeric Abstractions for Heap-Manipulating Programs
Stephen Magill (Carnegie Mellon University),
Ming-Hsien Tsai (National Taiwan University),
Peter Lee (Carnegie Mellon University),
Yih-Kuen Tsay (National Taiwan University)
- Static Determination of Quantitative Resource Usage for Higher-Order
Programs
Steffen Jost (University of St Andrews),
Hans-Wolfgang Loidl (University of St Andrews),
Kevin Hammond (University of St Andrews),
Martin Hofmann (Ludwig-Maximilians University, Munich)

* Session: Verification, 2:30-3:30
* Session Chair: Xavier Leroy (INRIA Rocquencourt)
- Toward a Verified Relational Database Management System
Ryan Wisnesky (Harvard University), Gregory Malecha (Harvard University),
Avraham Shinnar (Harvard University), Greg Morrisett (Harvard University)
- Counterexample-Guided Focus
Andreas Podelski (University of Freiburg), Thomas Wies (EPFL)
- Structuring the verification of heap-manipulating programs
Aleksandar Nanevski (Microsoft Research, Cambridge / IMDEA Software, Spain),
Viktor Vefeiadis (Microsoft Research, Cambridge),
Josh Berdine (Microsoft Research, Cambridge)

* Session: Types, 4:00-5:00
* Session Chair: Erik Ernst (Aarhus University)
- Dependent types and program equivalence
Limin Jia (University of Pennsylvania),
Jianzhou Zhao (University of Pennsylvania),
Vilhelm Sjoberg (University of Pennsylvania),
Stephanie Weirich (University of Pennsylvania)
- Pure Subtype Systems
DeLesley Hutchins (MZA Associates Corporation)
- Modular Session Types for Distributed Object-Oriented Programming
Simon J Gay (University of Glasgow, UK),
Vasco T Vasconcelos (University of Lisbon, Portugal),
Antonio Ravara (Instituto de Telecomunicacoes and Technical
University of Lisbon, Portugal),
Nils Gesbert (University of Glasgow, UK),
Alexandre Z Caldeira (University of Lisbon, Portugal)

Friday, January 22, 2009
=========================

* Session: Program Synthesis, 9:00-10:00
* Session Chair: Cristiano Calcagno (Imperial College, London)
- From Program Verification to Program Synthesis
Saurabh Srivastava (University of Maryland, College Park),
Sumit Gulwani (Microsoft Research, Redmond),
Jeffrey S. Foster (University of Maryland, College Park)
- Abstraction-Guided Synthesis of Synchronization
Martin Vechev (IBM Research), Eran Yahav (IBM Research),
Greta Yorsh (IBM Research)
- Programming with Angelic Non-determinism
Shaon Barman (UC Berkeley), Rastislav Bodik (UC Berkeley),
Satish Chandra (IBM TJ Watson Research), Joel Galenson (UC Berkeley),
Doug Kimelman (IBM TJ Watson Research), Casey Rodarmor (UC Berkeley),
Nicholas Tung (UC Berkeley)

* Session: Relating and Integrating Static and Dynamic Checks, 10:30-11:30
* Session Chair: Matthias Felleisen (Northeastern University)
- Contracts Made Manifest
Michael Greenberg (University of Pennsylvania),
Benjamin Pierce (University of Pennsylvania),
Stephanie Weirich (University of Pennsylvania)
- Threesomes, With and Without Blame
Jeremy G. Siek (University of Colorado at Boulder),
Philip Wadler (University of Edinburgh)
- Integrating Typed and Untyped Code in a Scripting Language
Tobias Wrigstad (Purdue University), Francesco Zappa Nardelli (INRIA),
Sylvain Lebresne (Purdue University), Johan Ostlund (Purdue University),
Jan Vitek (Purdue University)

* Session: Compilers, 12:00-1:00
* Session Chair: Peter Sewell (University of Cambridge)
- Generating Compiler Optimizations from Proofs
Ross Tate (UC San Diego), Michael Stepp (UC San Diego),
Sorin Lerner (UC San Diego)
- Automatically Generating Instruction Selectors Using Declarative
Machine Descriptions
Joao Dias (Tufts University), Norman Ramsey (Tufts University)
- Semantics and Algorithms for Data-dependent Grammars
Yitzhak Mandelbaum (AT&T Labs - Research), Trevor Jim (AT&T Labs - Research),
David Walker (Princeton University)

* Session: Security and Ownership, 2:30-3:30
* Session Chair: Mads Dam (Royal Institute of Technology, Stockholm)
- Paralocks - Role-Based Information Flow Control and Beyond
Niklas Broberg (Gothenburg University),
David Sands (Chalmers University of Technology)
- Modular Verification of Security Protocol Code by Typing
Karthikeyan Bhargavan (Microsoft Research),
Cedric Fournet (Microsoft Research),
Andrew D. Gordon (Microsoft Research)
- Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Jean-Phillipe Martin (Microsoft Research Cambridge),
Michael Hicks (University of Maryland, College Park),
Manuel Costa (Microsoft Research Cambridge),
Periklis Akritidis (University of Cambridge),
Miguel Castro (Microsoft Research Cambridge)

* Session: Medley, 4:00-5:00
* Session Chair: Mooly Sagiv (Tel-Aviv University)
- Nested Interpolants
Matthias Heizmann (University of Freiburg, Germany),
Jochen Hoenicke (University of Freiburg, Germany),
Andreas Podelski (University of Freiburg, Germany)
- Monads in Action
Andrzej Filinski (University of Copenhagen)
- Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes
for Program Verification
Naoki Kobayashi (Tohoku University), Naoshi Tabuchi (Tohoku University),
Hiroshi Unno (Tohoku University)


_______________________________________________
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

2009-12-18

[Caml-list] DisCoTec 2010: Call for Papers

[We apologize for multiple copies]

====================================================================
Call for Papers

DisCoTec 2010

5th International Federated Conferences on
Distributed Computing Techniques

http://discotec.project.cwi.nl/

Amsterdam, Netherlands, 7-10 June 2010
====================================================================

The DisCoTec series of federated conferences is one of the major
events sponsored by the International Federation for Information
processing (IFIP). The main conferences are:

* COORDINATION
* DAIS
* FMOODS & FORTE

This year IFIP offers some travel grants for students and an award
for the best paper of DisCoTec.
All conferences share the same deadlines:

* Important Dates *

February 08, 2010 Abstract Submission
February 12, 2010 Paper Submission
March 19, 2010 Notification of Acceptance
April 02, 2010 Camera ready version
June 07-09, 2010 Conference
June 10, 2010 Workshops


* General Chair *
Frank S. de Boer CWI, Netherlands

* Publicity Chair *
Gianluigi Zavattaro University of Bologna, Italy

* Workshops Chair *
Marcello M. Bonsangue University of Leiden, Netherlands

* Advisory Board *
John Derrick University of Sheffield, UK
Einar Broch Johnsen University of Oslo, Norway
Elie Najm Technical University of Paris, France
Rocco De Nicola University of Florence, Italy
George Angelos Papadopoulos University of Cyprus, Cyprus
Antonio Ravara University of Lisboa, Portugal
Gianluigi Zavattaro University of Bologna, Italy

--------------------------------------------------------------------

COORDINATION
12th International Conference on Coordination Models and Languages
http://discotec.project.cwi.nl/COORDINATION

--------------------------------------------------------------------

* Scope *

Coordination 2010 seeks high-quality papers on programming languages
and coordination models, middleware, services, and algorithms that
separate behavior from interaction, therefore increasing modularity,
simplifying reasoning, and ultimately enhancing software
development. 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, run-time systems, and related verification and
analysis techniques.

Past incarnations of Coordination have emphasized foundations.
However, given the increasing importance of concurrency in almost
every software domain, the organizers of Coordination 2010 are keen
to provide a strong forum for high-quality papers that address
practical aspects of concurrent programming models; for example,
application of concurrency to novel domains, comparisons of
alternative programming models on important problems, or
domain-specific languages.

* Publication *

Each paper will undergo a thorough process of review and the
conference proceedings will be published by Springer-Verlag in the
LNCS series.

* Program Committee Chairs *

Dave Clarke Katholieke Universiteit Leuven, Belgium
Gul Agha University of Illinois at Urbana-Champaign, USA

--------------------------------------------------------------------

DAIS
10th IFIP International Conference on
Distributed Applications and Interoperable Systems
http://discotec.project.cwi.nl/DAIS

--------------------------------------------------------------------

* Scope *

The DAIS conference series addresses all aspects of distributed
applications, including their design, implementation and operation,
the supporting middleware, appropriate software engineering
methodologies and tools, as well as experimental studies and
practice reports. This time we welcome in particular contributions
on architectures, models, technologies and platforms for large scale
and complex distributed applications and services that are related
to the latest trends towards bridging the physical/virtual worlds
based on flexible and versatile service architectures and platforms.

* Publication *

Each paper will undergo a thorough process of review and the
conference proceedings will be published by Springer-Verlag in the
LNCS series.

Extended versions of selected best papers published in DAIS'10 will
be invited for publication in a dedicated special issue of
Wiley Software: Practice and Experience

* Program Committee Chairs *

Frank Eliassen University of Oslo, Norway
Ruediger Kapitza University of Erlangen, Germany

--------------------------------------------------------------------

FMOODS & FORTE
12th IFIP International Conference on
Formal Methods for Open Object-based Distributed Systems
30th IFIP International Conference on
FORmal TEchniques for Networked and Distributed Systems
http://discotec.project.cwi.nl/FmoodsForte

--------------------------------------------------------------------

* Scope *

The joined conference FMOODS & FORTE is a forum for fundamental
research on theory and applications of distributed systems. The
conference solicits original contributions that advance the science
and technologies for distributed systems, in particular
in the areas of:

* component- and model-based design
* object technology, modularity, software adaptation
* service-oriented, ubiquitous, pervasive, grid and mobile
computing
* software quality, reliability and security

The conference encourages contributions that combine theory and
practice, address problems from the development of distributed
systems, and present novel solutions with formal methods and
theoretical foundations. FMOODS & FORTE 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.

* Publication *

Each paper will undergo a thorough process of review and the
conference proceedings will be published by Springer-Verlag in the
LNCS series.

* Program Committee Chairs *

John Hatcliff Kansas State University, United States of America
Elena Zucca University of Genoa, Italy


_______________________________________________
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

2009-12-14

[Caml-list] VMCAI 2010 - Call for Participation - Early Reg: Dec 22

----------------------------------------------------------------------
*** CALL FOR PARTICIPATION ***
[ Please redistribute. Apologies for multiple postings. ]

VMCAI 2010

The Eleventh International Conference on
Verification, Model Checking, and Abstract Interpretation

Madrid, Spain, January 17-19, 2010
(Co-located with POPL 2010)

http://software.imdea.org/events/vmcai10/

Early registration deadline: December 22, 2009
Hotel registration deadline: December 28, 2009
----------------------------------------------------------------------

VMCAI provides a forum for researchers from the communities of
Verification, Model Checking, and Abstract Interpretation,
facilitating interaction, cross-fertilization, and advancement of
hybrid methods. The program of VMCAI'10 will consist of invited
lectures, invited tutorials, and 21 contributed talks. The full
programme is available at the conference web site.

* Invited Talks:

Javier Esparza (Technical University of Munich):
Analysis of Systems with Stochastic Process Creation

Rustan Leino (Microsoft Research):
Verifying Concurrent Programs with Chalice

Reinhard Wilhelm (Saarland University):
Static Timing Analysis for Hard Real-Time Systems

* Invited Tutorials:

Roberto Giacobazzi (University of Verona):
Abstract Interpretation-based Protection

Joost Pieter Katoen (Aachen University):
Advances in Probabilistic Model Checking

Viktor Kuncak (EPFL Lausanne):
Building a Calculus of Data Structures


* Registration:

Further information on registration for VMCAI is available at the
conference web site: http://software.imdea.org/events/vmcai10/

Further information on accommodation is available at the POPL web
site: http://www.cse.psu.edu/popl/10/

* Program:

Sunday, January 17, 2010
9:00-10:00 Invited Talk

* Reinhardt Wilhelm (Saarland University)
Static Timing Analysis for Hard Real-Time Systems

Coffee break

10:30-11:30 Automata and Monitors

* RoLei Bu, Jianhua Zhao and Xuandong Li.
Path-Oriented Reachability Verification of a Class of Nonlinear
Hybrid Automata Using Convex Programming
* Meera Sridhar and Kevin Hamlen.
Model-Checking In-lined Reference Monitors

Coffee break

12.00-13.30 Abstract interpretation

* Liqian Chen, Antoine Mine, Ji Wang and Patrick Cousot.
An abstract domain for discovering interval linear equalities
* Valentin Perrelle and Nicolas Halbwachs.
An analysis of permutations in arrays
* Andy King and Harald Sondergaard.
Automatic Abstraction for Congruences

Lunch break

15.30-16.30 Model Checking

* Jori Dubrovin.
Checking Bounded Reachability in Asynchronous Systems by
Symbolic Event Tracing
* Benjamin Aminof, Orna Kupferman and Aniello Murano.
Improved Model Checking of Hierarchical Systems

Coffee break

17:00-18.30 Invited Tutorial

* Roberto Giaccobazzi (University of Verona)
Abstract Interpretation-based Protection

Monday, January 18, 2010

9.00-10.00 Invited Talk

* Rustan Leino (Microsoft Research)
Verifying Concurrent Programs with Chalice

Coffee break

10.30-11:30 Logical Methods

* Vijay D'silva, Daniel Kroening, Mitra Purandare and Georg Weissenbacher.
Interpolant Strength
* Kuat Yessenov, Ruzica Piskac and Viktor Kuncak.
Collections, Cardinalities, and Relations

Coffee break

12.00-13.30 Program Verification

* Alexander Summers and Sophia Drossopoulou.
A Considerate Specification of the Composite Pattern
* Thomas Henzinger, Thibaud B. Hottelier, Laura Kovacs and Andrei Voronkov.
Invariant and Type Inference for Matrices
* Yungbum Jung, Soonho Kong, Bow-Yaw Wang and Kwangkeun Yi.
Deriving Invariants in Propositional Logic by Algorithmic
Learning, Decision Procedure, and Predicate Abstraction

Lunch break

15.30-16.30 Quantitative Analysis

* Bjorn Wachter and Lijun Zhang.
Best Probabilistic Transformers
* Rohit Chadha, Axel Legay, Pavithra Prabhakar and Mahesh Viswanathan.
Complexity bounds for the verification of real-time software

Coffee break

17:00-18.30 Invited Tutorial

* Joost Pieter Katoen (University of Twente)
Advances in Probabilistic Model Checking

Tuesday, January 19, 2010

9.00-10.00 Invited Talk

* Javier Esparza (Technical University of Munich)
Analysis of Systems with Stochastic Process Creation

Coffee break

10.30-11:30 Temporal Logic

* Rajeev Alur and Swarat Chaudhuri.
Temporal Reasoning for Procedural Programs
* Cesar Sanchez and Martin Leucker.
Regular Linear Temporal Logic with Past

Coffee break

12.00-13.30 Shape Analysis

* Matthew Might.
Shape Analysis of Higher-Order Programs via Abstract Interpretation
* Mark Marron, Rupak Majumdar, Darko Stefanovic and Deepak Kapur.
Shape Analysis with Reference Set Relations
* Jorg Kreiker, Helmut Seidl and Vesal Vojdani.
Shape Analysis of Low-level C with Overlapping Structures

Lunch break

15.30-16.30 Concurrency

* Viktor Vafeiadis.
RGSep Action Inference
* Alexander Malkis, Shaz Qadeer and Shuvendu Lahiri.
Abstract Threads

Coffee break

17:00-18.30 Invited Tutorial

* Viktor Kuncak (EPF Lausanne)
Building a Calculus of Data Structures

----------------------------------------------------------------------

_______________________________________________
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

2009-12-09

[Caml-list] Call for Papers: ICLP 2010

[Sorry, in case of multiple postings]

------------------------------------------------------------------------
CALL FOR PAPERS
26th International Conference on Logic Programming (ICLP 2010)

Edinburgh, Scotland, U.K., July 16-19, 2010
ICLP 2009 will be held as part of the
Fifth Federated Logic Conference (FLoC 2010)
Submission deadline: January 26, 2010

http://www.floc-conference.org/ICLP-home.html
----------------------------------------------------------------------

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 (papers and posters) are sought in all
areas of logic programming including but not restricted to:

Theory: Semantic Foundations, Formalisms, Non-monotonic Reasoning,
Knowledge Representation.
Implementation: Compilation, Memory Management, Virtual Machines,
Parallelism.
Environments: Program Analysis, Transformation, Validation,
Verification, Debugging, Profiling, Testing.
Language Issues: Concurrency, Objects, Coordination, Mobility, Higher
Order, Types, Modes, Assertions, Programming Techniques.
Related Paradigms: Abductive Logic Programming, Inductive Logic
Programming, Constraint Logic Programming, Answer-Set Programming.
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 plenary invited talks in association with other
FLoC conferences, as well as ICLP invited talks, advanced tutorials,
the doctoral consortium, and several workshops.

SUBMISSION DETAILS

The four broad categories for submissions are: (1) technical papers
for describing technically sound, innovative ideas that can advance
the state of the art 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 general availability of the systems and
tools described; and (4) short papers/posters, for ongoing work not
yet ready for full publication and research project overviews.

All papers 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 15
pages. The limit for short papers / posters is 5 pages. Submissions
must be made in TPLP format
(ftp://ftp.cup.cam.ac.uk/pub/texarchive/journals/latex/tlp-cls/) via
the Easychair submission system, available at
http://www.easychair.org/conferences/?conf=iclp2010.

IMPORTANT DATES
Paper registration deadline: January 26, 2010
Submission deadline: February 2, 2010
Notification to authors: March 20, 2010
Camera-ready copy due: April 21, 2010
Conference: July 16-19, 2010

PAPER PUBLICATION

All accepted long papers will be published in the journal Theory and
Practice of Logic Programming (TPLP), Cambridge U. 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) and/or "shepherding."

At the time of the conference CUP will make the web page for
this(ese) TPLP issue(s) available including volume and issue numbers,
table of contents, page numbers, and the papers themselves. All
registered attendants at the conference will get a password for
on-line access to this web page during the conference and indefinitely
from then on ("lifetime access"), which can be used to read papers on
line, download them, or print them for personal use. Attendants will
also receive all the papers in a USB memory stick at the conference.

For short papers / posters the journal issue(s) will include a
listing of the titles and authors of these papers, as well as a URL
pointing to their printable copy. Short papers / posters will also get
space in the program for presentation.

ICLP'2010 ORGANIZATION

General Chair:
Veronica Dahl (Simon Fraser University, Canada)
Program Co-chairs:
Manuel Hermenegildo (IMDEA Soft. and UPM, Spain)
Torsten Schaub (University of Potsdam, Germany)
Workshops Chair:
Veronica Dahl (Simon Fraser University, Canada)
Doctoral Consortium:
Marcello Balduccini (Kodak Research Labs, USA)
Prolog Programming Contest:
Tom Schrijvers (K.U. Leuven, Belgium)

PROGRAM COMMITTEE

Maria Alpuente (Technical U. of Valencia, Spain)
Pedro Cabalar (Corunya University, Spain)
Manuel Carro (Technical U. of Madrid, Spain)
Marina De Vos (University of Bath, UK)
James Delgrande (Simon Fraser University, Canada)
Marc Denecker (KU Leuven, Belgium)
Agostino Dovier (University of Udine, Italy)
Esra Erdem (Sabanci University, Istanbul, Turkey)
Wolfgang Faber (University of Calabria, Italy)
Thom Fruehwirth (University of Ulm, Germany)
Maurizio Gabbrielli (University of Bologna, Italy)
John Gallagher (Roskilde University, Denmark)
Samir Genaim (Complutense University, Spain)
Haifeng Guo (University of Nebraska at Omaha, USA)
Joxan Jaffar (National U. of Singapore, Singapore)
Tomi Janhunen (Helsinki U. of Technology, Finland)
Michael Leuschel (U. of Duesseldorf, Germany)
Stephen Muggleton (Imperial College London, UK)
Alan Mycroft (U. of Cambridge, UK)
Gopalan Nadathur (University of Minnesota, USA)
Lee Naish (Melbourne University, Australia)
Enrico Pontelli (New Mexico State University, USA)
Vitor Santos Costa (University of Porto, Portugal)
Tom Schrijvers (K.U. Leuven, Belgium)
Tran Cao Son (New Mexico State University, USA)
Peter J. Stuckey (Melbourne University, Australia)
Terrance Swift (CENTRIA, Portugal)
Peter Szeredi (Budapest U. of Tech. and E., Hungary)
Frank Valencia (Ecole Polytechnique, France)
Wim Vanhoof (University of Namur, Belgium)
Kewen Wang (Griffith University, Australia)
Stefan Woltran (Vienna U. of Technology, Austria)
Neng-Fa Zhou (City University of New York, USA)

SPONSOR

The conference is sponsored by the Association for Logic Programming.

FINANCIAL ASSISTANCE

The Association for Logic Programming has funds to assist financially
disadvantaged participants and, specially, students in order to be
able to attend the conference.

WORKSHOPS

The ICLP 2009 program will include several workshops, held also as
part of FLoC. They are perhaps the best places for the presentation of
preliminary work, undeveloped novel ideas, and new open problems to a
wide and interested audience with opportunities for intensive
discussions and project collaboration.

DOCTORAL CONSORTIUM

The 6th Doctoral Consortium (DC) on Logic Programming provides
research students with the opportunity to present and discuss their
research directions, and to obtain feedback from both peers and
world-renown experts in the field. Accepted participants will receive
partial financial support to attend the event and the main
conference. The best paper and presentation from the DC will be given
the opportunity to present in a special session of the main ICLP
conference.

CONFERENCE VENUE / CO-LOCATION

In 2010 (as in the previous two FLoC editions) ICLP will be held as
part of the Fifth Federated Logic Conference, FLoC 2010 in Edinburgh,
Scotland, U.K., July 16-19, 2010. FLoC is held every four years
bringing together several international conferences related to
mathematical logic and computer science. Other participating
conferences are:

- Computer-Aided Verification (CAV),
- Int'l Joint Conference on Automated Reasoning (IJCAR),
- Interactive Theorem Proving (ITP),
- Logic in Computer Science (LICS),
- Rewriting Techniques and Applications (RTA), and
- Theory and Applications of Satisfiability Testing (SAT).

Plenary events involving multiple conferences are planned.
------------------------------------------------------------------------

_______________________________________________
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

2009-12-07

[Caml-list] Call for Participation: PLPV 2010

*********************************************************************
CALL FOR PARTICIPATION

PLPV 2010

The Fourth ACM SIGPLAN Workshop
on
Programming Languages meets Program Verification

19 January 2010
Madrid, Spain

To be held in conjunction with POPL 2010

http://slang.soe.ucsc.edu/plpv10/
*********************************************************************


IMPORTANT DATES

Hotel reservation deadline: December 28, 2009 (Monday)


VENUE

PLPV'10 and all POPL'10 affiliated events will take place at the Melia
Castilla Hotel, Madrid.


REGISTRATION

To register for PLPV'10, follow the link from the POPL 2010 page, at

http://www.cse.psu.edu/popl/10/


SCOPE

The goal of PLPV is to foster and stimulate research at the
intersection of programming languages and program verification. Work
in this area typically attempts to reduce the burden of program
verification by taking advantage of particular semantic and/or
structural properties of the programming language. One example is
dependently typed programming languages, which leverage a language's
type system to specify and check richer than usual specifications,
possibly with programmer-provided proof terms. Another example is
extended static checking systems like ESC/Java and Spec#, which
incorporate pre- and postconditions along with a static verifier for
these contracts.


INVITED SPEAKER

Gilles Barthe, Madrid Instutite for Advanced Studies


PRELIMINARY PROGRAM

----------------------
Invited Talk (9:00 - 10:00)

* CertiCrypt: Formal Certification of Code-Based Cryptographic Proofs
Gilles Barthe, Madrid Instutite for Advanced Studies

Session 1 (10:30 - 12:00)

* Singleton types here, Singleton types there, Singleton types everywhere
Stefan Monnier and David Haguenauer

* Operating system development with ATS
Matthew Danish and Hongwei Xi

* Modular Reasoning about Invariants over Shared State with Interposed
Data Members
Stephanie Balzer and Thomas Gross

Session 2 (2:00 - 3:00)

* Resource Typing in Guru
Aaron Stump and Evan Austin

* Free Theorems for Functional Logic Programs
Jan Christiansen, Daniel Seidel and Janis Voigtländer

Discussion (3:00 - 3:30)

* Status update and discussion of the Trellys Project

Session 3 (4:00 - 5:00)

* Arity-generic datatype-generic programming
Stephanie Weirich and Chris Casinghino

* Challenge Benchmarks for Verification of Real-time Programs
Tomas Kalibera, Gary Leavens and Jan Vitek

----------------------


PROGRAM CHAIRS

* Cormac Flanagan (University of California, Santa Cruz)
* Jean-Christophe Filliâtre (CNRS)


PROGRAM COMMITTEE

* Adam Chlipala (Harvard University)
* Ranjit Jhala (University of California, San Diego)
* Joseph Kiniry (University College Dublin)
* Rustan Leino (Microsoft Research)
* Xavier Leroy (INRIA Paris-Rocquencourt)
* Conor McBride (University of Strathclyde)
* Andrey Rybalchenko (Max Planck Institute for Software Systems)
* Tim Sheard (Portland State University)
* Stephanie Weirich (University of Pennsylvania)


_______________________________________________
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