2009-03-30

[Caml-list] ECOOP 2009 Call for Participation

ECOOP'2009
23rd European Conference on Object Oriented Programming
July 6th - 10th 2009, Genova, Italy
http://2009.ecoop.org

CALL FOR PARTICIPATION

ECOOP is the premier forum in Europe for bringing together
practitioners, researchers, and students to share their ideas and
experiences in a broad range of disciplines woven with the common thread
of object technology. It is a well-integrated collage of events,
including outstanding invited speakers, carefully refereed technical
papers, exciting tutorials, topic-focused workshops, and a summer school.


ECOOP 2008 has opened its doors for registration.

Early registration lasts until May 20, 2009.
http://ecoop09.disi.unige.it/registration.html

The program is taking shape and promises another exciting scientific event:

Technical Program (list of accepted papers follows):
http://ecoop09.disi.unige.it/accepted-papers.html

Workshops:
http://ecoop09.disi.unige.it/workshops.html

Tutorials:
http://ecoop09.disi.unige.it/workshops.html

---

Dave Clarke,
ECOOP 2009 Publicity Chair

Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

_______________________________________________
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-03-27

[Caml-list] FroCoS'09 Call for Papers

-------------------------------------------------------------------------
WE APOLOGIZE IF YOU RECEIVE MULTIPLE COPIES OF THIS MESSAGE
-------------------------------------------------------------------------

Final Call for Papers

7th International Symposium on
FRONTIERS OF COMBINING SYSTEMS (FroCoS'09)

Trento, Italy, September 16-18th, 2009
http://events.unitn.it/en/frocos09/

MOTIVATIONS
In various areas of computer science, such as logic, computation,
program development and verification, artificial intelligence, knowledge
representation, and automated reasoning, there is an obvious need for
using specialized formalisms and inference mechanisms for special
tasks. In order to be usable in practice, these specialized systems
must be combined with each other, and they must be integrated into
general purpose systems. The development of general techniques and
methods for the combination and integration of special formally defined
systems, as well as for the analysis and modularization of complex
systems has been initiated in many areas. The International Symposium
on Frontiers of Combining Systems (FROCOS) traditionally focuses on
this type of research questions and activities and aims at promoting
progress in the field.
Like its predecessors, FROCOS'09 wants to offer a common forum for
research activities in the general area of combination, modularization
and integration of systems (with emphasis on logic-based ones), and of
their practical use.

RELEVANT TOPICS
Typical topics of interest include (but are not limited to):
* combinations of logics such as combined predicate, temporal, modal,
or epistemic logics;
* combinations and modularity in ontologies;
* combination of decision procedures, of satisfiability procedures,
and of CS techniques;
* combinations and modularity in term rewriting;
* integration of equational and other theories into deductive systems;
* combination of deduction systems and computer algebra;
* integration of data structures into CLP formalisms and deduction processes;
* hybrid methods for deduction, resolution and constraint propagation;
* hybrid systems in knowledge representation and natural language semantics;
* combined logics for distributed and multi-agent systems;
* logical aspects of combining and modularizing programs and specifications.

INVITED SPEALERS
* Alessandro Armando, University of Genoa, Italy
* Thomas Eiter, TU Wien, Austria
* Boris Motik, Oxford University, UK
* Ashish Tiwari, SRI International, USA

PAPER SUBMISSION
Papers must describe original work, be written and presented in
English, and must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal or a
conference with refereed proceedings. Selection criteria include
accuracy and originality of ideas, clarity and significance of
results, and quality of presentation. All submissions will be subject
to academic peer review by at least three members of the program
committee. For each accepted paper, at least one author is required to
attend the conference to present the paper.
Papers must be edited in LATEX using the llncs style and be submitted
electronically as PDF files via the EasyChair system:
http://www.easychair.org/conferences/?conf=frocos09.
The page limit in Springer LNCS style is 16 pages.
Prospective authors are required to register a title and an abstract a
week before the paper submission deadline (see below).
Further information about paper submission is available at FROCOS'09 web page.

PROCEEDINGS
The proceedings of FroCoS'09 will be published by Springer-Verlag in
the LNAI/LNCS series.

IMPORTANT DATES
Abstract submission deadline: April 26th, 2009
Full paper submission deadline: May 3rd, 2009
Notification of acceptance: June 8th, 2009
Camera Ready Copy: June 22th, 2009
Conference: September 16-18th 2009

CHAIRS
- Silvio Ghilardi, University of Milano, Italy
- Roberto Sebastiani, University of Trento, Italy

PROGRAMME COMMITTEE
- Franz Baader, T.U. Dresden, Germany
- Peter Baumgartner, NICTA, Camberra, Australia
- Torben Brauner, Roskilde University, DK
- Leonardo de Moura, Microsoft Research, USA
- Bernhard Gramlich, T.U. Wien, Austria
- Sava Krstic, Intel Corporation, USA
- Viktor Kuncak, E.P.F. Lausanne, Switzerland
- Albert Oliveras, T.U. of Catalonia, Spain
- Silvio Ranise, University of Verona, Italy
- Christophe Ringeissen, LORIA, Nancy, France
- Ulrike Sattler, Univ. of Manchester, UK
- Renate Schmidt, Univ. of Manchester, UK
- Luciano Serafini, FBK-Irst, Italy
- Viorica Sofronie-Stokkermans, MPI, Saarbruken, Germany
- Cesare Tinelli, University of Iowa, USA
- Frank Wolter, University of Liverpool, UK
- Michael Zakharyaschev, London Knowledge Lab, UK

_______________________________________________
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-03-26

[Caml-list] Automated Reasoning Workshop 2009 - 2nd Call for Papers

**********************************************************************
Please excuse multiple posts
and distribute as widely as possible
**********************************************************************

CALL FOR PAPERS

2009 Workshop on Automated Reasoning
Bridging the Gap between Theory and Practice
http://www.csc.liv.ac.uk/~arw09/

21st - 22nd April 2009
University of Liverpool

** Deadline for submissions of extended abstracts: 31st March 2009 **

Topics
------
The workshop will cover the full breadth and diversity of automated
reasoning and will include topics such as:

* Theorem proving in classical and non-classical logics

* Reasoning systems and mechanisms:
- Description logics
- Equational reasoning, unification
- Induction
- Constraint Satisfaction
- Combining reasoning systems
- Specialised decision procedures

* Formal methods in software analysis:
- Verification
- Formal Modelling

* Non-classical inference:
- Non-monotonic reasoning, abduction
- Intuitionistic reasoning

* Logic-based knowledge representation:
- Ontology specification,
- Domain specific reasoning (spatial, temporal, epistemic etc.)

* Reasoning for agents (or about agents)

* Interactive theorem proving

* Implementation issues and empirical results

* Applications of automated reasoning


Submissions
-----------
We invite the submission of camera-ready, two-page extended abstracts
about recent work, work in progress, or a system description. The
abstract can describe work that has already been published elsewhere.
Anyone wishing to attend but not interested in presenting should send
a shorter position statement (1/2 - 1 page).
The main objective of the abstracts is to spread information about
recent work in our community, and we expect to accept most on-topic
submissions, but we may ask for revisions.

To prepare your submission, please use the LaTeX style file provided
on the workshop web page:
http://www.csc.liv.ac.uk/~arw09/arw09_latex.tar
Each submission should include the names and complete addresses
(including email) of all authors. Correspondence will be sent to the
first author, unless otherwise indicated.

Submissions should be sent in in either Postscript or PDF format by
email to the workshop organisers at: U.Hustadt@liverpool.ac.uk


Publication
-----------
Abstracts will be published in informal workshop notes and be made
available on the internet.


Presentations
-------------
Each workshop attendee will be allocated a 5-10 minute slot (depending
on time constraints), for a short talk to introduce their research.
Each attendee will also be allocated space in a poster session, where
they can further present and discuss their work. Please prepare
posters for the event.


Student Grants
--------------
We have a limited number of grants available to PhD students who wish
to attend ARW 2009. To indicate your interest please send a short
email to the workshop organisers (U.Hustadt@liverpool.ac.uk) anytime
before 10th April 2009.


Important Dates
---------------
Abstract submission: 31st March 2009
Notification of acceptance/rejection: 3rd April 2009
Final version due: 10th April 2009
Workshop: 21st - 22nd April 2009


Invited Speakers
----------------
To be announced shortly.


Program Committee
-----------------
Clare Dixon (University of Liverpool)
Jacques Fleuriot (University of Edinburgh)
Alexander Bolotov (University of Westminster)
Simon Colton (Imperial College London)
David Crocker (Escher Technologies)
Louise Dennis (University of Liverpool)
Roy Dyckhoff (University of St Andrews)
Ullrich Hustadt (University of Liverpool)
Mateja Jamnik (Univerity of Cambridge)
Tom Melham (University of Oxford)
Alice Miller (University of Glasgow)
Renate A. Schmidt (University of Manchester)
Volker Sorge (University of Birmingham)


Conference Venue
----------------
The workshop will take place at the University of Liverpool on
21st and 22nd April 2009.


Contact
-------
Please email Ullrich Hustadt (U.Hustadt@liverpool.ac.uk)
if you have any queries about the 2009 Automated Reasoning Workshop.

2009-03-25

[Caml-list] WMM'09 call for papers

Call for Papers

4rd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory
Edinburgh, Scotland

Co-located with ICFP'09.
http://www.cis.upenn.edu/~sweirich/wmm/

Important Dates

* Submission deadline: 19 June 2009
* Author Notification: 24 July 2009
* Workshop: 4 September 2009

Workshop Description

Researchers in programming languages have long felt the need for tools
to help formalize and check their work. With advances in language
technology demanding deep understanding of ever larger and more complex
languages, this need has become urgent. There are a number of automated
proof assistants being developed within the theorem proving community
that seem ready or nearly ready to be applied in this domain-yet,
despite numerous individual efforts in this direction, the use of proof
assistants in programming language research is still not commonplace:
the available tools are confusingly diverse, difficult to learn,
inadequately documented, and lacking in specific library facilities
required for work in programming languages.

The goal of this workshop is to bring together researchers who have
experience using automated proof assistants for programming language
metatheory, and those who are interested in using tool support for
formalizing their work. One starting point for discussion will be the
obstacles that hinder mechanization (whether they be pragmatic or
technical), and what users and developers can do to overcome them.

Format

The workshop will consist of presentations by the participants, selected
from submitted abstracts. It will focus on providing a fruitful
environment for interaction and presentation of ongoing work.
Participants are invited to submit working notes, source files, and
abstracts for distribution to the attendees, but as the workshop has no
formal proceedings, contributions may still be submitted for publication
elsewhere. (See the SIGPLAN republication policy for more details.)

Scope

The scope of the workshop includes, but is not limited to:

* Tool demonstrations: proof assistants, logical frameworks,
visualizers, etc.
* Libraries for programming language metatheory.
* Formalization techniques, especially with respect to binding issues.
* Analysis and comparison of solutions to the POPLmark challenge.
* Examples of formalized programming language metatheory.
* Proposals for new challenge problems that benchmark programming
language work.

Submission Guidelines

Email submissions to urbanc AT in.tum.de. Submissions should be no
longer than two pages in PDF and printable on A4 sized paper.
Persons for whom this poses a hardship should contact the program
chair.

Conference Organization

Program Committee

* Nick Benton, Microsoft Research Cambridge
* Olivier Danvy, University of Aarhus
* Daniel Licata, Carnegie Mellon University
* Francois Pottier, INRIA Paris-Rocquencourt
* Christian Urban, TU Munich (chair)

Workshop Organizers

* Karl Crary, Carnegie Mellon University
* Michael Norrish, National ICT Australia
* Stephanie Weirich, University of Pennsylvania

Previous Workshops

* Victoria, 2008
* Freiburg, 2007
* Portland, 2006


----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

_______________________________________________
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-03-17

[Caml-list] Call for Papers Test And Proof 2009

Last cfp TAP 2009 : test and proof : submission deadline 20 march 2009

(Apologies for multiple copies)


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

TAP: Tests And Proofs

The Third International Conference on Tests And Proofs (TAP) will be
held at ETH Zurich, Switzerland on 2 and 3 July 2009 as part of the
TOOLS EUROPE week.

The TAP conference is devoted to the convergence of proofs and tests. It
combines ideas from both sides for the advancement of software quality.


Purpose and Scope
-----------------
To prove the correctness of a program is to demonstrate, through
impeccable mathematical techniques, that it has no bugs; to test a
program is to run it with the expectation of discovering bugs. The two
techniques seem contradictory: if you have proved your program, it's
fruitless to comb it for bugs; and if you are testing it, that is surely
a sign that you have given up on any hope to prove its correctness.

Accordingly, proofs and tests have, since the onset of software
engineering research, been pursued by distinct communities using rather
different techniques and tools.

And yet the development of both approaches leads to the discovery of
common issues and to the realization that each may need the other. The
emergence of model checking has been one of the first signs that
contradiction may yield to complementarity, but in the past few years an
increasing number of research efforts have encountered the need for
combining proofs and tests, dropping earlier dogmatic views of
incompatibility and taking instead the best of what each of these
software engineering domains has to offer.

The conference will include a mix of invited and submitted presentation,
and a generous allocation of panels and informal discussions.


Topics
-------
Possible topics include (as an indicative rather than exhaustive list):

- Generation of test data, oracles, or preambles by deductive techniques
such as
* theorem proving,
* model checking,
* symbolic execution,
* constraint logic programming, etc.
- Generation of specifications by deduction
- Verification techniques combining proofs and tests
- Program proving with the aid of testing techniques
- Transfer of concepts from testing to proving (e.g., coverage criteria)
- Automatic bug finding
- Formal frameworks
- Tool descriptions and experience reports
- Case studies


Contributions
-------------
Two kinds of contributions are expected:

- Research papers: full papers of not more than 14 pages
in LNCS format, which have to be original, unpublished and
not submitted elsewhere. The research papers proceedings will be
published in Springer's LNCS series.

- Short presentations of work in progress, industrial
experience reports and tool demonstrations. An extended
abstract of not more than 3 pages is expected and will be
reviewed. The accepted extended abstracts will be
made available in supplementary proceedings. They will be
presented during the conference days.


Important dates
----------------
- Submission deadline: 20 March 2009
- Notification of acceptance: 20 April 2009
- Submission of final camera-ready version: 3 May 2009


Keynote speakers
----------------
- Sriram Rajamani (Microsoft Research)
- Boutheina Chetali (Security Research Group Manager at Gemalto)


Web site
---------
http://tap.ethz.ch

--------------------------------------
David Delahaye, David.Delahaye@cnam.fr
http://cedric.cnam.fr/~delahaye/

_______________________________________________
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-03-16

[Caml-list] Call for Papers: LPNMR'09

Call for Papers: LPNMR'09
=========================
10th International Conference on Logic Programming
and Nonmonotonic Reasoning

Potsdam, Germany, 14-18 September, 2009
http://www.cs.uni-potsdam.de/lpnmr09

LPNMR'09 is the tenth in the series of international meetings on logic
programming and nonmonotonic reasoning. The special theme of LPNMR'09
is Applications of Logic Programming and Nonmonotonic Reasoning; it
aims at providing a comprehensive survey of the state-of-the-art of
Applications in the field, with a slight focus on Answer Set
Programming (ASP).

LPNMR is a forum for exchanging ideas on declarative logic programming,
nonmonotonic reasoning, and knowledge representation. The aim of the
conference is to facilitate interactions between researchers interested
in the design and implementation of logic based programming languages
and database systems, and researchers who work in the areas of
knowledge representation and nonmonotonic reasoning. LPNMR strives to
encompass theoretical and experimental studies that led or will lead to
the construction of practical systems for declarative programming and
knowledge representation.

Authors are invited to submit papers presenting original and
unpublished research on nonmonotonic aspects of logic programming and
knowledge representation. We particularly encourage papers on LPNMR
techniques which led to the development of significant applications. In
addition to technical and original application papers, we also invite
submissions of short papers, system descriptions, and summaries of of
existing successful applications of LPNMR systems, which will be
presented in dedicated poster sessions.

As in the past, the proceedings of the conference will be published in
the Springer Verlag LNCS series (http://www.springeronline.com/lncs).

As part of the technical program, LPNMR'09 comprises special sessions
devoted to presentations and demonstrations of implemented nonmonotonic
reasoning systems and applications of LPNMR with a focus on
applications of ASP. Moreover, LPNMR'09 hosts the award ceremony of
the Second Answer Set Programming Competition
(http://www.cs.kuleuven.be/~dtai/events/ASP-competition).

Workshops
---------
The program of LPNMR'09 will also include several workshops. Workshops
provide a venue for presenting specialized topics and opportunities for
intensive discussions and project collaboration in any areas related to
LPNMR, including cross-disciplinary areas.

Those interested in organizing a workshop at LPNMR'09 are invited to
submit an informal workshop proposal to the program chairs until
30 April 2009.

Submission
----------
LPNMR'09 welcomes submissions in the following formats.

* Technical papers (13 pages)
* Original application papers (13 pages)
* Short papers (6 pages)
* System descriptions (6 pages)
* Summaries of of existing successful applications (6 pages)

All papers must not exceed the alloted number of pages including title
page, references and figures; they must be formatted according to the
Springer LNCS authors instructions. Papers must be written in English
and present original research. All submissions will be peer-reviewed by
an international panel. Paper submission will be electronic through
http://www.easychair.org/conferences/?conf=lpnmr09

Important Dates
---------------
* Paper registration 15 April 2009
* Paper submission 20 April 2009
* Workshop submission 30 April 2009
* Paper Notification 1 June 2009
* Final conference papers 22 June 2009

Venue
-----
The conference will be held at the University of Potsdam's Institute of
Informatics. Potsdam, once a city of kings and royal residences, is
today the capital of the state of Brandenburg in Germany and at the
same time a European city of culture and science. The heart of Prussia
is famous for its palaces and parks, its gardens and villas, and its
numerous museums. Last but not least it nicely complements the adjacent
capital city of Berlin.

Program Chairs
--------------
Fangzhen Lin, Hong Kong University of Science and Technology, Hong Kong,
China, http://www.cs.ust.hk/~flin

Torsten Schaub, University of Potsdam, Germany,
http://www.cs.uni-potsdam.de/~torsten

ASP/LPNMR Application Theme Chair
---------------------------------
Esra Erdem, Sabanci University, Istanbul, Turkey,
http://people.sabanciuniv.edu/esraerdem

ASP Competition Chair
---------------------
Marc Denecker, Leuven University, Belgium,
http://www.cs.kuleuven.ac.be/~marcd

Contact
-------
Email to lpnmr09@cs.uni-potsdam.de.

_______________________________________________
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-03-14

[Caml-list] Oregon Programming Languages Summer School (ad)

The Oregon PL Summer School will run July 23-31, 2009 with the topic
"Theory and Practice of Language Implementation". We are excited to have
a great collection of speakers! The school has a long and successful
tradition and is sponsored by the NSF, ACM SIGPLAN, and industry
(pending approval). The full "Call for Participation" can be found below.

Thanks,
Matthew Fluet & Yannis Smaragdakis (OPLSS'09 Organizers)


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

Call for Participation:
Summer School on the Theory and Practice of Language Implementation
July 23-31, 2009
University of Oregon (Eugene, Oregon)
http://www.cs.uoregon.edu/research/summerschool/summer09/
summerschool@cs.uoregon.edu

This Summer School will cover current research focused on the theory
and practice of programming language implementation. Speakers will
present material covering foundational theory, advanced techniques,
and applications.

Material will be presented at a tutorial level that will help graduate
students and researchers from academia or industry understand the
critical issues and open problems confronting the field. The course is
open to anyone interested. Prerequisites are an elementary knowledge
of logic and mathematics that is usually covered in undergraduate
classes on discrete mathematics. Some knowledge of programming
languages at the level provided by an undergraduate survey course will
also be expected. Our primary target group is PhD students. We also
expect attendance by faculty members who would like to conduct
research on this topic or introduce new courses at their universities.

The program consists of more than twenty-five, 80 minute lectures
presented by internationally recognized leaders in programming
languages and formal reasoning research. Topics include:

Garbage Collection and the Metronome GC
David Bacon, IBM Research
Algorithmic Program Synthesis
Ras Bodik, University of California - Berkeley
Abstract Interpretation
Patrick Cousot, Ecole Normale Superieure / New York University
Continuations to Go
Olivier Danvy, Aarhus University
Program Analysis for Computing Symbolic Complexity Bounds
Sumit Gulwani, Microsoft Research
Managed Runtime Environments: Implementations and Opportunities
Chandra Krintz, University of California - Santa Barbara
Pointer Analysis
Ondrej Lhotak, University of Waterloo
Control-flow Analysis of Higher-Order Languages
Matt Might, University of Utah
Multi-Threaded Programming and Transactional Memory
Yannis Smaragdakis, University of Massachusetts, Amherst


Venue
~~~~~
The summer school will be held at the University of Oregon, located in
the southern Willamette Valley city of Eugene, close to some of the
world's most spectacular beaches, mountains, lakes and forests. On
Sunday, July 26, students will have the option of participating in a
group activity in Oregon's countryside.

Registration
~~~~~~~~~~~~
The cost for registration is $175.00 (USD) for graduate students, and
$275.00 (USD) for other participants. Registration must be paid upon
acceptance to the summer school, and is non-refundable. There are a
limited number of grants available to fund part of the cost of student
participation. If you are a graduate student and want to apply for
grant money to cover your expenses, please also include a statement of
your needs with your registration.
Additional information about the program, registration, venue, and
housing options is available on the web site. Or, you may request more
information by email.
To register for the Summer School, send a CV that includes a short
description of your educational background and one letter of
reference, unless you have already been granted a Ph.D. Please include
your name, address and current academic status.
Send all registration materials to summerschool@cs.uoregon.edu.
All registration materials should be delivered to the program by April
17, 2009. Materials received after the closing date will be evaluated
on a space available basis. Non U.S. citizens should begin immediately
to obtain travel documents.

Housing
~~~~~~~
The school will provide on-campus housing and meals. To share a room
with another student attending the school, the cost is $510 (USD) per
person. Housing rates are based on check-in on Wednesday, July 22 and
check-out before noon on Saturday, August 1. Some single rooms may be
available for an additional fee of $150 (USD). If you'd like a single
room, please indicate your choice and we will try to accommodate you
on a first-come/first-served basis.

Organizers
~~~~~~~~~~
Organizing committee: Matthew Fluet and Yannis Smaragdakis
Sponsors: National Science Foundation, ACM SIGPLAN

_______________________________________________
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-03-13

[Caml-list] Call for paper - 10th Intl. Workshop on Termination - WST 2009

Dear all, the 10th Intl. Workshop on Termination
welcomes contributions from the functional programming community.
See the general call for papers below, and let me add a few words here.

The typical functional (compiler) programmer needs
- termination of programs
- termination of program transformations (rules)
- termination of program analysis (type checking/inference)
So I'm sure the workshop topic is highly relevant,
and we are looking for *your* contributions.

Also, we have an annual competition for automated termination provers,
http://termination-portal.org/wiki/Termination_Competition
and since 2007 it contains a Haskell category but no OCaml category yet.
The problems there are taken directly from the Standard Library. So if
you have some kind of (OCaml) source code analyzer
that knows something about termination (perhaps only internally),
then you're welcome turn it into a termination prover
and submit it to this competition.
(Details will be discussed at the workshop.)

Best regards, Frederic Blanqui.

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

10th International Workshop on Termination (WST 2009)

Leipzig, Germany, June 3-5, 2009

http://www.imn.htwk-leipzig.de/wst09/

Termination is a fundamental topic in computer science. Classical
undecidability results show that termination is difficult. On the
other hand, programs are usually required to terminate. So methods
are needed that prove termination and non-termination automatically
for a wide range of programs. Termination proofs are essential not
only for program verification, but also as components of program
transformation systems. The topic is challenging both in theory
(mathematical logic, proof theory) and practice (software development,
formal methods), and many interesting ramifications are yet to be
explored.

The 10th International Workshop on Termination will delve into all
aspects of termination of processes. It will continue the sequence of
successful workshops held in St. Andrews (1993), La Bresse (1995), Ede
(1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen
(2004), Seattle (2006), and Paris (2007). It will attain the same
friendly atmosphere as those past workshops. The intent is to bring
together, in an informal setting, researchers interested in all
aspects of termination, whether this interest be practical or
theoretical, primary or derived. The workshop shall help exchange
ideas from term rewriting and from the various programming language
communities.

Contributions from the imperative, constraint, functional, and logic
programming communities, and papers investigating new applications of
termination are particularly welcome.

Program Committee:

Frederic Blanqui, INRIA, FR and Tsinghua University, CN
Byron Cook, Microsoft Corporation, US
Alfons Geser, HTWK Leipzig, DE (chair)
Michael Hanus, Universität Kiel, DE
Janis Voigtlander, Technische Universität Dresden, DE

Local organization:

Johannes Waldmann, HTWK Leipzig, DE

Important Dates:

Paper submission 19 April 2009
Notification 26 April 2009
Final Paper Version 3 May 2009

Conference Venue:

The workshop will be held in the city of Leipzig,
at the conference center Mediencampus Villa Ida.

Hosting institution:

Hochschule fur Technik, Wirtschaft und Kultur Leipzig,
in cooperation with Leipzig School of Media
and Medienstiftung der Sparkasse Leipzig.

_______________________________________________
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-03-04

[Caml-list] ASP-competition Call for Participation

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


The Second Answer Set Programming Competition

Call For Participation

K.U.Leuven, Belgium, spring 2009

http://www.cs.kuleuven.be/~dtai/events/ASP-competition/


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


The second ASP competition is a Modeling and Solving competition open
to all declarative problem solving systems from areas such as ASP, SAT
and CP. In the competition, both satisfiability problems and
optimization problems need to be solved. Each team submits a solver
and modelings for all benchmark problems. These are used to solve a
number of instances of each benchmark problem. The solver that solves
the most instances wins. The results will be published in the Tenth
International Conference on Logic Programming and Nonmonotonic
Reasoning (LPNMR'09). For more details on the format of the
competition, see the webpage.

The competition is open for all solvers. The Modeling and Solving
formula offers the best opportunities for different communities to
show the strength of their applications and solvers. Modeling support
for SAT teams, for whom modeling can be a burden, is available on the
webpage.

The competition is currently in its second phase: the registration of
participating teams and the installation of solutions to the submitted
benchmarks. We invite teams from different areas to enter their solvers
in the competition. For more details, see the webpage.


IMPORTANT DATES:
* 01/03/2009-01/05/2009:
o Registration of teams.
* 01/03/2009-15/05/2009:
o Installation period: Participants install and test
solvers and programs on the K.U.Leuven pinac pool.
* 15/05/2009-15/06/2009:
o Competition phase
* 15/09/2009:
o Results announced at LPNMR'09.

Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

_______________________________________________
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