[ecoop-info] PEPM 2019 Final Call for Posters/Demos

Atsushi Igarashi igarashi at kuis.kyoto-u.ac.jp
Tue Dec 25 16:08:57 CET 2018

            -- Final Call for Poster/Demo Abstracts --

POSTER/DEMO SESSIONS: PEPM 2019 is still accepting proposals for
poster/demo presentations on a rolling basis.  Proposals can be about
work that has been presented elsewhere.  See below for the submission

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) 2019

  * Website : http://popl19.sigplan.org/track/pepm-2019-papers
  * Time    : 14th – 15th January 2019
  * Place   : Cascais/Lisbon, Portugal (co-located with POPL 2019)


  * Web page : https://popl19.sigplan.org/attending/Registration
  * Early registration deadline : 10th December 2018 (passed)

Invited Talks
Applying Futamura projections to compose languages and tools in GraalVM
  Christian Humer (Oracle Labs)
What is the type of a partial evaluator?
  Jens Palsberg (UCLA)
Making proofs easy: Horn clause transformations to the aid of program verification
  Maurizio Proietti (IASI-CNR)

Accepted papers

Reduction from Branching-time Property Verification of Higher-Order Programs to HFL Validity Checking
  Keiichi Watanabe, Takeshi Tsukada, Hiroki Oshikawa, Naoki Kobayashi
Generating mutually recursive definitions
  Jeremy Yallop, Oleg Kiselyov
Method Name Suggestion with Hierarchical Attention Networks
  Sihan Xu, Xinya Cao, Jing Xu
Futures and Promises in Haskell and Scala
  Tamino Dauth, Martin Sulzmann
Combining Higher-Order Model Checking with Refinement Type Inference
  Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi
Typed parsing and unparsing for untyped regular expression engines
  Gabriel Radanne
Control Flow Obfuscation via CPS Transformation
  Kenny Zhuo Ming Lu
Extracting a Partial Evaluator from a Proof of Termination
  Kenichi Asai
A Simpler Lambda Calculus
  Barry Jay

Poster/demo abstract submission guideline

  * https://popl19.sigplan.org/track/pepm-2019-papers#Call-for-Poster-Demo-Abstracts

To maintain PEPM’s dynamic and interactive nature, PEPM 2019 will continue to
have special sessions for poster/demo presentations.  In addition to the main
interactive poster/demo session, there will also be a scheduled short-talk
session where each poster/demo can be advertised to the audience in, say, 5–10

Poster/demo abstracts should describe work relevant to PEPM (whose scope is
detailed below), typeset as a one-page PDF using the two-column ‘sigplan’
sub-format of the new ‘acmart’ format available at:


and sent by email to the programme co-chairs, Manuel Hermenegildo and Atsushi Igarashi, at:

  manuel.hermenegildo at imdea.org, igarashi at kuis.kyoto-u.ac.jp

Please also include in the email:

  * a short summary of the abstract (in plain text),
  * the type(s) of proposed presentation (poster and/or demo), and
  * whether you would like to give a scheduled short talk (in addition to the
    poster/demo presentation).

Abstracts will be considered for acceptance on a rolling basis.  Accepted abstracts,
along with their short summary, will be posted on PEPM 2019’s website.

At least one author of each accepted abstract must attend the workshop and
present the work during the poster/demo session.

Student participants with accepted posters/demos 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.


In addition to the traditional PEPM topics (see below), PEPM 2019 welcomes
submissions in new domains, in particular:

  * Semantics based and machine-learning based program synthesis and program

  * Modelling, analysis, and transformation techniques for distributed and
    concurrent protocols and programs, such as session types, linear types, and
    contract specifications.

More generally, topics of interest for PEPM 2019 include, but are not limited

  * 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

This list of categories is not exhaustive, and we encourage submissions
describing new theories and applications related to semantics-based program
manipulation in general.  If you have a question as to whether a potential
submission is within the scope of the workshop, please contact the programme
co-chairs, Manuel Hermenegildo and Atsushi Igarashi (manuel.hermenegildo at imdea.org, igarashi at kuis.kyoto-u.ac.jp).

More information about the ecoop-info mailing list