-- CALL FOR PAPERS --
Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2018
===================================================================
* Website :
http://popl18.sigplan.org/track/PEPM-2018
* Time : 8th – 9th January 2018
* Place : Los Angeles, CA, US (co-located with POPL 2018)
The Workshop on Partial Evaluation and Program Manipulation (PEPM),
which has a history going back to 1991 and has co-located with POPL
every year since 2006, originates in the discoveries of practically
useful automated techniques for evaluating programs with only partial
input. Over the years, the scope of PEPM has expanded to include a
variety of research areas centred around the theme of semantics-based
program manipulation — the systematic exploitation of treating
programs not only as subject to black-box execution, but also as data
structures that c
an be generated, analysed, and transformed while
establishing or maintaining important semantic properties.
Scope
-----
In addition to the traditional PEPM topics (see below), PEPM 2018
welcomes submissions from the following two areas new to the PEPM
community:
* Session type–based modelling and verification of distributed
protocols: [...]
* (Machine learning–aided) program synthesis techniques: [...]
More generally, topics of interest for PEPM 2018 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.
* 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.
* 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.
* 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, embedded and resource-limited computation,
and security.
This list of categories is not exhaustive, and we encourage
submissions describing applications of semantics-based program
manipulation techniques in new domains. If you have a question as to
whether a potential submission is within the scope of the workshop,
please contact the programme co-chairs.
Submission categories and guidelines
------------------------------------
Two kinds of submissions will be accepted: Regular Research Papers and
Short Papers.
* Regular Research Papers should describe new results, and will be
judged on originality, correctness, significance, and clarity.
Regular research papers must not exceed 12 pages (excluding
bibliography).
* Short Papers may include tool demonstrations and presentations of
exciting if not fully polished research, and of interesting
academic, industrial, and open-source applications that are new or
unfamiliar. Short papers must not exceed 6 pages (excluding
bibliography).
Both kinds of submissions should be typeset using the ‘sigplan’
sub-format of the new ‘acmart’ format available at:
http://sigplan.org/Resources/Author/
and submitted electronically via HotCRP:
https://pepm18.hotcrp.com/
PEPM 2018 will employ lightweight double-blind reviewing according to
the rules of POPL 2018. Quoting from POPL 2018’s call for papers:
“submitted papers must adhere to two rules:
1. author names and institutions must be omitted, and
2. references to authors’ own related work should be in the third
person (e.g., not “We build on our previous work ...” but rather “We
build on the work of ...”).
The purpose of this process is to help the PC and external reviewers
come to an initial judgment about the paper without bias, not to
make it impossible for them to discover the authors if they were to
try. Nothing should be done in the name of anonymity that weakens
the submission or makes the job of reviewing the paper more
difficult. In particular, important background references should
not be omitted or anonymized. In addition, authors should feel free
to disseminate their ideas or draft versions of their paper as they
normally would. For instance, authors may post drafts of their
papers on the web or give talks on their research ideas.”
See the following FAQ page for more information:
http://popl18.sigplan.org/track/POPL-2018-papers#Submission-and-Reviewing-FAQ
Submissions are welcome from PC members (except the two co-chairs)
provided that there are non-PC co-authors.
Accepted papers will appear in formal proceedings published by ACM,
and be included in the ACM Digital Library. Authors of short papers,
however, can ask for their papers to be left out of the formal
proceedings.
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 tool demonstration papers will be made available on the PEPM
2018 web site.
Student participants 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.
Important dates
---------------
* Paper submission : Friday 6th October 2017 (firm)
* Author notification : Saturday 4th November 2017
* Workshop : Monday 8th - Tuesday 9th January 2018
The proceedings will be published 2 weeks pre-conference.
AUTHORS TAKE NOTE: The official publication date is the date the
proceedings are made available in the ACM Digital Library. This date
may be up to two weeks prior to the first day of your conference. The
official publication date affects the deadline for any patent filings
related to published work. (For those rare conferences whose
proceedings are published in the ACM Digital Library after the
conference is over, the official publication date remains the first
day of the conference.)
Best paper award
----------------
PEPM 2018 continues the tradition of a Best Paper award. The winner
will be announced at the workshop.
Programme Committee
-------------------
Nada Amin (EPFL)
Shigeru Chiba (University of Tokyo)
Ezgi Çiçek (Max Planck Institute for Software Systems)
Olivier Danvy (Yale-NUS College)
Ronald Garcia (University of British Columbia)
Simon Gay (University of Glasgow)
Andy Gill (X, the Moonshot Factory)
Fritz Henglein (co-chair) (University of Copenhagen)
Anastasia Izmaylova (IMC Financial Markets)
Johan Jeuring (Utrecht University)
Gabriele Keller (University of New South Wales)
Oleg Kiselyov (Tohoku University)
Hsiang-Shang Ko (co-chair) (National Institute of Informatics)
Ralf Lämmel (University of Koblenz-Landau)
Julia Lawall (Inria)
Simon Peyton Jones (Microsoft Research Cambridge)
Frank Pfenning (Carnegie Mellon University)
Sriram Rajamani (Microsoft Research India)
Norman Ramsey (Tufts University)
Thomas Reps (University of Wisconsin-Madison)
Sergei Romanenko (Keldysh Institute of Applied Mathematics)
Tiark Rompf (Purdue University)
Wolfram Schulte (Facebook)
Peter Sestoft (IT University of Copenhagen)
Harald Søndergaard (University of Melbourne)
Kohei Suenaga (Kyoto University)
Martin Vechev (ETH Zurich)
Marcos Viera (University of the Republic)
Nobuko Yoshida (Imperial College London)