2013-09-21

[Caml-list] PEPM 2014: Final call for papers

ACM SIGPLAN 2014 WORKSHOP ON PARTIAL EVALUATION AND PROGRAM MANIPULATION
Mon-Tue, January 20-21, 2014
San Diego, California, USA
co-located with POPL'14

Sponsored by ACM SIGPLAN

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

SCOPE

The PEPM Symposium/Workshop series aims at bringing together researchers and
practitioners working in the areas of program manipulation, partial evaluation,
and program generation. PEPM focuses on techniques, theory, tools, and
applications of analysis and manipulation of programs.
The 2014 PEPM workshop will be based on a broad interpretation of
semantics-based program manipulation and continue last years'
successful effort to expand the scope of PEPM significantly beyond the
traditionally covered areas of partial evaluation and specialization
and include practical applications of program transformations such as
refactoring tools, and practical implementation techniques such as
rule-based transformation systems. In addition, the scope of PEPM
covers manipulation and transformations of program and system
representations such as structural and semantic models that occur in
the context of model-driven development. In order to reach out to
practitioners, a separate category of tool demonstration papers will
be solicited.

Topics of interest for PEPM 2014 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. PAC also offers
other support, such as for child-care expenses during the meeting or
for travel costs for companions of SIGPLAN members with physical
disabilities, as well as for travel from locations outside of North
America and Europe. For details on the PAC programme, see its web
page.

All accepted papers, short papers included, will appear in formal
proceedings published by ACM Press. In addition to printed
proceedings, accepted papers will be included in the ACM Digital
Library. A special issue for Science of Computer Programming is
planned with recommended papers from PEPM 2014.

PEPM has also established a Best Paper award. The winner will be
announced at the workshop.

SUBMISSION CATEGORIES AND GUIDELINES

Regular Research Papers must not exceed 12 pages in ACM Proceedings
style (including appendix). Tool demonstration papers and short papers
must not exceed 6 pages in ACM Proceedings style (including
appendix). At least one author of each accepted contribution must
attend the workshop and present the work. In the case of tool
demonstration papers, a live demonstration of the described tool is
expected. Suggested topics, evaluation criteria, and writing
guidelines for both research and tool demonstration papers will be
made available on the PEPM 2014 Web-site. Papers should be submitted
electronically via the workshop web site.

Authors using LaTeX to prepare their submissions should use the new
improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template).

IMPORTANT DATES

Abstract due: Thu, October 3, 2013 (Extended)
Paper submission: Thu, October 10, 2013, 23:59, GMT (Extended)
Author notification: Mon, November 11, 2013
Camera-ready papers due: * to be announced *

INVITED SPEAKERS

We are happy to announce the two invited speakers of PEPM 2014:

Manuel Fahndrich (Microsoft Research, USA)
Sven-Bodo Scholz (Heriott-Watt University, Scotland)

PROGRAM CHAIRS

Wei-Ngan Chin (National University of Singapore, Singapore)
Jurriaan Hage (Utrecht University, Netherlands)

PROGRAM COMMITTEE

Evelyne Contejean (LRI, CNRS, Universite Paris-Sud, France)
Cristina David (University of Oxford, UK)
Alain Frisch (LexiFi, France)
Ronald Garcia (University of British Columbia, Canada)
Zhenjiang Hu (National Institute of Informatics, Japan)
Paul H J Kelly (Imperial College, UK)
Oleg Kiselyov (Monterey, USA)
Naoki Kobayashi (University of Tokyo, Japan)
Jens Krinke (University College London, UK)
Ryan Newton (University of Indiana, USA)
Alberto Pardo (Universidad de la Republica, Uruguay)
Sungwoo Park (Pohang University of Science and Technology, South Korea)
Tiark Rompf (Oracle Labs & EPFL, Switzerland)
Sukyoung Ryu (KAIST, South Korea)
Kostis Sagonas (Uppsala University, Sweden)
Max Schaefer (Nanyang Technological University, Singapore)
Harald Sondergaard (The University of Melbourne, Australia)
Eijiro Sumii (Tohoku University, Japan)
Eric Van Wyk (University of Minnesota, USA)
Jeremy Yallop (University of Cambridge, UK)


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

2013-09-11

[Caml-list] SynCoP 2014: 1st Call for Papers

====================================================================
Call for papers

SynCoP 2014
1st International Workshop on the SYNthesis of COntinuous Parameters

http://lipn.univ-paris13.fr/SynCoP2014/
====================================================================


SynCoP aims at bringing together researchers working on parameter
synthesis for systems with continuous variables, where the parameters
consist of a (usually dense) set of constant values. Such problems arise
for real-time, hybrid or probabilistic systems where the goal is to
identify suitable parameters to achieve desired behavior, or to verify
the behavior for a given range of parameter values. A parameter could
be, e.g., a delay in a real-time system, or a reaction rate in a
biological cell model.

The workshop will take place on Saturday the 5th of April 2014, in
Grenoble, France, as a satellite of ETAPS 2014.


=================
IMPORTANT DATES
=================
Abstract: January 13th, 2014
Full papers: January 20th, 2014
Notification: February 20th, 2014
Camera ready: March 15th, 2014
Workshop: April 5th, 2014


=================
TOPICS OF THE WORKSHOP
=================

The scientific subject of the workshop covers (but is not limited to)
the following areas:
* parameter synthesis,
* parametric model checking,
* robustness analysis,
* formalisms such as parametric timed and hybrid automata, parametric
time(d) Petri nets, parametric probabilistic automata,
* applications to major areas of computer science and control engineering.


=================
SUBMISSION AND PUBLICATION
=================

The content of papers should be original and not submitted elsewhere.
All papers will be submitted to at least three reviews.

The page limit is 15 pages in the EPTCS format (http://style.eptcs.org/).
All accepted papers will be published in the Electronic Proceedings in
Theoretical Computer Science (EPTCS) series, that are free and open
access online proceedings.
The papers will be referenced in major databases such as DBLP, and
published under the Creative Commons CC-BY license.
Hereby, the authors retain their copyright.
(Substantial revisions may later be published elsewhere.)

Submission will be made in English in PDF format through Easychair:
https://www.easychair.org/conferences/?conf=syncop2014


=================
INVITED SPEAKERS
=================
* Alexandre Donze, Faculty of Electrical Engineering and Computer
Science, UC Berkeley, USA
* Didier Lime, IRCCyN / Ecole Centrale de Nantes, France
(to be completed)


=================
CHAIRS
=================
- Etienne Andre (Universite Paris 13, Sorbonne Paris Cite, France)
- Goran Frehse (Universite Joseph Fourier Grenoble 1 - Verimag, France)


=================
PROGRAM COMMITTEE
=================
* Eugene Asarin, Paris, France
* Alessandro Cimatti, Trento, Italy
* Alexandre Donze, Berkeley, USA
* Georgios Fainekos, Arizona, USA
* Laurent Fribourg, Cachan, France
* Antoine Girard, Grenoble, France
* Kim Larsen, Aalborg, Denmark
* Yang Liu, Singapore
* Olivier H. Roux, Nantes, France
* Sriram Sankaranarayanan, Boulder, USA
* Ashish Tiwari, USA
* Farn Wang, Taipei, Taiwan
(to be completed)

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

2013-09-06

[Caml-list] ETAPS 2014 2nd call for papers

[We apologise for multiple copies.]

About a month to go!

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

SECOND CALL FOR PAPERS: ETAPS 2014

17th European Joint Conferences on Theory And Practice of Software

Grenoble, France

5-13 April 2014

http://www.etaps.org/2014

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

-- ABOUT ETAPS --

ETAPS is the primary European forum for academic and industrial
researchers working on topics relating to software science. ETAPS,
established in 1998, is a confederation of six main annual
conferences, accompanied by satellite workshops. ETAPS 2014 is the
seventeenth event in the series.


-- MAIN CONFERENCES (7-11 April) --

* CC: Compiler Construction
* ESOP: European Symposium on Programming
* FASE: Fundamental Approaches to Software Engineering
* FOSSACS: Foundations of Software Science
and Computation Structures
* POST: Principles of Security and Trust
* TACAS: Tools and Algorithms for
the Construction and Analysis of Systems

TACAS '14 hosts the 3rd Competition on Software Verification
(SV-COMP).


-- INVITED SPEAKERS --

* Robert Harper (Carnegie Mellon University, US)
* John Launchbury (Galois, US)
* Benoit Dupont de Dinechin (Kalray, France)
* Maurice Herlihy (Brown University, US)
* Christel Baier (Technical University of Dresden, Germany)
* Petr Jancar (Technical Univ of Ostrava, Czech Republic)
* David Mazieres (Stanford University, US)
* Orna Kupferman (Hebrew University Jerusalem, Israel)


-- IMPORTANT DATES --

* 4 October 2013: Submission deadline for abstracts (strict)
* 11 October 2013: Submission deadline for full papers (strict)
* 20 December 2013: Notification of acceptance
* 17 January 2014: Camera-ready versions due

ESOP and FoSSaCS will use a rebuttal (author response) phase.


-- GENERAL SUBMISSION INFORMATION --

ETAPS conferences accept two types of contributions: research papers
and tool demonstration papers. Both types will appear in the
proceedings and have presentations during the conference. (TACAS has
more categories, see below.)

A condition of submission is that, if the submission is accepted, one
of the authors attends the conference to give the
presentation. Submitted papers must be in English presenting original
research. They must be unpublished and not submitted for publication
elsewhere. In particular, simultaneous submission of the same
contribution to multiple ETAPS conferences is forbidden. The
proceedings will be published in the Advanced Research in Computing
and Software Science (ARCoSS) subline of Springer's Lecture Notes in
Computer Science series.

Papers must follow the formatting guidelines specified by Springer at
the URL

http://www.springer.de/comp/lncs/authors.html

and be submitted electronically in pdf through the Easychair author
interface of the respective conference.

Submissions not adhering to the specified format and length may be
rejected immediately.


- Research papers

Different ETAPS 2014 conferences have different page limits.
Specifically, FASE, FOSSACS and TACAS have a page limit of 15 pages,
whereas CC, ESOP and POST allow at most 20 pages. Additional material
intended for the referees but not for publication in the final version
- for example, details of proofs - may be placed in a clearly marked
appendix that is not included in the page limit. ETAPS referees are at
liberty to ignore appendices and papers must be understandable without
them.

TACAS solicits not only regular research papers, but also case study
papers.


- Tool demonstration papers

Submissions should consist of two parts:

* The first part, at most 4 pages, should describe the tool
presented. Please include the URL of the tool (if available) and
provide information that illustrates the maturity and robustness of
the tool. (This part will be included in the proceedings.)

* The second part, at most 6 pages, should explain how the
demonstration will be carried out and what it will show, including
screen dumps and examples. (This part will be not be included in the
proceedings, but will be evaluated.)

ESOP and FOSSACS do not accept tool demonstration papers.

In addition to tool demonstration papers (max 6 pages in their case),
TACAS solicits also regular tool papers (max 15 pages) adhering to
specific instructions about content and organization.


-- SATELLITE EVENTS (5-6 April, 12-13 April) --

Around 20 satellite workshops will take place before and after the
main conferences. In addition, on 6 April, some tutorials on topics of
wide interest will be offered.


-- HOST CITY --

Located in the southeastern part of France, Grenoble is considered as
the capital of the Alps. Grenoble is surrounded by nature and high
mountains: down the Alps, Grenoble is the meeting point of two
important rivers, Drac and Isere. Grenoble has important historical
and gastronomic heritages. Leisure activities in breathtaking nature
are easily organizable and within short-distance. Grenoble is also a
major scientific center in Europe dedicated to high-tech technologies,
e.g., nano, micro, bio, and information technologies.


-- HOST INSTITUTION --

The event is organized by Universite Joseph Fourier. Located at the
heart of the Alps, in outstanding scientific and natural surroundings,
the Universite Joseph Fourier in Grenoble is a leading University of
Science, Technology and Health.


-- ORGANIZERS

* General chair: Saddek Bensalem
* Conferences chair: Yassine Lakhnech
* Workshops chair: Axel Legay
* Publicity chair: Ylies Falcone
* Finance chair: Nicolas Halbwachs
* Web site chair: Marius Bozga


-- FURTHER INFORMATION --

Please do not hesitate to contact the organizers at
etaps2014.organization@imag.fr.



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

[Caml-list] Oberwolfach Seminar on Mathematics for Scientific Programming

Dear all,

I'm lecturing in November at a week-long seminar on rigorous (ie functional) programming techniques for computational science. There is funding for bed, board, and part of travel costs. If you're in contact with computational scientists who might be interested, could you pass this on, please? Application deadline is 15th September. 

Thanks,
Jeremy

  *

Call for Participation

OBERWOLFACH SEMINAR ON 
MATHEMATICS FOR SCIENTIFIC COMPUTATION

Mathematisches Forschunginstitut Oberwolfach
24th to 30th November 2013


MOTIVATION

Computational science today depends crucially on simulations, which are typically based on algorithms that have a sound mathematical justification.  For example, an iterative procedure such as Newton's method is motivated by appealing to the properties of twice continuously differentiable functions and their Taylor expansion, which also yield convergence conditions and approximation estimates.

These algorithms are then implemented on a computer, using a programming language such as Fortran or C++.  Often, the implementation will introduce new computational steps and otherwise modify the structure of the mathematical algorithm - for handling or reducing round-off errors, enabling more efficient memory access, exploiting parallelization, and so on.  As a result, the final implementation usually looks very different from the mathematical algorithm, and the justification given for the latter does not directly extend to the former.  But if we are to ensure the correctness of simulations, we need mathematical certainty for both.

We aim to bring to the scientific programming community mathematical techniques that allow us to achieve the transition from mathematical algorithm to efficient implementation in a principled manner, with each step motivated by the application of a mathematical theorem. The intended participants are students and researchers in computational science (including areas such as engineering, biology, and economics), and any scientists dissatisfied with state of the art in transforming mathematics into code. They will be equipped subsequently to make a significant contribution to increasing the correctness of the simulations that play such an important role in current scientific activity.


CONTENT

This rigorous approach to programming is most easily presented in the framework of functional programming: program calculation can be reduced to straightforward equational reasoning, provided that all program variables are immutable.  Accordingly, we will introduce the basic syntax and ideas using Haskell, currently the one of the most successful functional programming languages.  The emphasis is not on functional programming as such, and even less so on a specific language such as Haskell; but rather, on the mathematics behind program development, which can then be transferred to other contexts, such as imperative programming, or parallel programming.

This mathematical foundation lies in category theory, which unifies what could otherwise appear as a large collection of "bite-sized" theorems for program development, too many for any developer to remember and use efficiently.  Category theory is a broad subject: we will limit ourselves to what is essential as a framework for datatypes and programs (functors, universal properties, algebras, monads). The many examples, such as fusion (loop elimination), optimal bracketing (important for non-associative operations such as those on floating-point numbers), or parallel programming skeletons (such as Google's MapReduce), will be readily understandable and relevant to scientific computing practitioners.

One of the most effective ways to counter floating-point errors and to obtain validated results is to use interval analysis, which however requires more complex data structures and algorithms than is common in other areas of scientific computation.  Extending a function on real or floating-point numbers to one on intervals is a matter of symbolic computation, similar to the symbolic differentiation or integration that is performed by tools such as Mathematica.  The problem of obtaining the best extension is complicated by the fact that some familiar properties (such as that x-x=0 for any x, and distributivity of multiplication over addition) do not apply to intervals, and is a good source of examples for calculational programming.

Finally, we will present a larger application, a generic program for inter-temporal optimization with dynamic programming.  This kind of problem is ubiquitous in economic modeling, and hence in many integrated assessment models, such as those aiming to compute costs of climate change. It has both algebraic aspects (the organization of the computation for backward induction), which can be tackled with the categorical methods presented, and numerical ones (the local optimization techniques), where interval analysis can be used.

The Seminar is organized by:

* Paul Flondor, Professor of Mathematics at Politehnica University Bucharest
* Jeremy Gibbons, Professor of Computing at the University of Oxford
* Cezar Ionescu, researcher at Potsdam Institute for Climate Impact Research


HOW TO APPLY

Applications to participate should include

* full name and address, including e-mail address
* short CV, present position, university
* name of supervisor of PhD thesis
* a short summary of previous work and interest

and should be sent preferably by e-mail (pdf files) to:

  Prof. Dr. Dietmar Kröner
  Mathematisches Forschungsinstitut Oberwolfach
  Schwarzwaldstr. 9-11
  77709 Oberwolfach-Walke
  Germany

The deadline for applications is 15th September, and the number of participants is restricted to 25. The Institute covers accommodation and food; thanks to support from the Carl Friedrich von Siemens Foundation, some contribution may also be made towards travel expenses. For more information, contact the organizers or see the Institute's webpage:


Jeremy.Gibbons@cs.ox.ac.uk
Oxford University Department of Computer Science,
Wolfson Building, Parks Road, Oxford OX1 3QD, UK.
+44 1865 283521