[TYPES/announce] [CFP] PEPM 2025 co-located with POPL
Guillaume Allais
guillaume.allais at ens-lyon.org
Mon Oct 14 10:24:20 EDT 2024
Apologies for duplicates
This is the last CFP reminder before the deadline.
Note that you can submit on Friday even if you have
not registered the paper on Monday.
Added:
- Additional PC members
- Invited speakers
------------------------------------------------------------------------
CALL FOR PAPERS
The 2025 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
Site:
https://urldefense.com/v3/__https://pepm25.hotcrp.com__;!!IBzWLUs!TIDa-gbEmKFJFwnYffguxFAvilWOSD1a1qm8j-v-24tc39-v65UDmn6emmYAnTe57zvNMtlFnVkgMTXcTGdiX1iTTAjWxccHzObmI6zB0jREog$
# Important Dates, AoE, UTC-12h
Abstract due Mon 14 Oct 2024
Paper due Fri 18 Oct 2024
Author notification Mon 18 Nov 2024
Camera ready Wed 4 Dec 2024
Workshop Tue 21 Jan 2025
------------------------------------------------------------------------
# About
The ACM SIGPLAN Workshop on Partial Evaluation and
Program Manipulation (PEPM) has a history going back
to 1991 and has been held in conjunction with POPL
every year since 2006.
The origin of PEPM is in the discoveries of practically
useful automated techniques for evaluating programs
with only partial input. Over time, PEPM has broadened
its scope to include a variety of research areas centered
around semantics-based program manipulation — the systematic
exploitation of treating programs not only as subject
to black-box execution, but also as data structures
that can be generated, analyzed, and transformed while
establishing or maintaining important semantic properties.
# Scope
In addition to the traditional PEPM topics (see below),
PEPM 2025 welcomes submissions in new domains, in particular:
* Semantics based and machine-learning based program synthesis
and program optimisation.
* Modeling, 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 2025 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 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,
Guillaume Allais (guillaume.allais at strath.ac.uk)
and Annie Liu (liu at cs.stonybrook.edu).
# Submission Categories and Guidelines
Three kinds of submissions will be accepted:
1. 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.
2. 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.
3. Talk Proposals may propose lectures about topics of interest
for PEPM, existing work representing relevant contributions,
or promising contributions that are not mature enough to be
proposed as papers of the other categories. Talk Proposals
must not exceed 2 pages.
References and appendices are not included in page limits.
Appendices may not necessarily be read by reviewers.
All the submissionss should be typeset using the two-column
‘sigplan’ sub-format of the new ‘acmart’ format available at:
https://urldefense.com/v3/__http://sigplan.org/Resources/Author/__;!!IBzWLUs!TIDa-gbEmKFJFwnYffguxFAvilWOSD1a1qm8j-v-24tc39-v65UDmn6emmYAnTe57zvNMtlFnVkgMTXcTGdiX1iTTAjWxccHzObmI6wtZdx29g$
and submitted electronically via HotCRP:
https://urldefense.com/v3/__https://pepm25.hotcrp.com__;!!IBzWLUs!TIDa-gbEmKFJFwnYffguxFAvilWOSD1a1qm8j-v-24tc39-v65UDmn6emmYAnTe57zvNMtlFnVkgMTXcTGdiX1iTTAjWxccHzObmI6zB0jREog$
Reviewing will be single-blind.
Submissions are welcome from PC members (except the two co-chairs).
Accepted regular research papers will appear in formal proceedings
published by ACM, and be included in the ACM Digital Library.
Accepted short papers do not constitute formal publications and
will not appear in the proceedings.
At least one author of each accepted contribution must attend
the workshop (physically or virtually) to present the work.
In the case of tool demonstration papers, a live demonstration
of the described tool is expected.
# Invited speakers
Brigitte Pientka, McGill University, Canada
Satnam Singh, Groq, United States
# Program Committee
## Chairs
Guillaume Allais. University of Strathclyde. UK
Y. Annie Liu, Stony Brook University, US
## PC Members
Nada Amin, Harvard University, United States
Zena M. Ariola, University of Oregon, United States
Liang-Ting Chen, Academia Sinica, Taiwan
Youyou Cong, Tokyo Institute of Technology, Japan
Fritz Henglein, University of Copenhagenn, Denmark
Manuel Hermenegildo, IMDEA Software Institute, Spain
Zhenjiang Hu, Peking University, China
Chantal Keller, Université Paris Saclay, France
András Kovács, University of Gothenburg, Sweden
Sam Lindley, University of Edinburgh, United Kingdom
Torben Mogensen, DIKU, University of Copenhagen, Denmark
Jens Palsberg, University of California, Los Angeles (UCLA), United States
Martin Rinard, MIT, United States
Tiark Rompf, Purdue University, United States
João Saraiva, Universidade do Minho, Portugal
Jeremy Yallop, University of Cambridge, United Kingdom
Mark van den Brand, Eindhoven University of Technology, Netherlands
More information about the Types-announce
mailing list