Call For Papers

Sponsored by ACM SIGPLAN

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

Important: the correct date of the workshop is Mon-Tue, 21-22 January 2013. We hope you have not made travel arrangements, and apologize for any inconvenience this has caused!

Submission deadline extended until Sun, Oct 7 23:59 GMT!

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 2013 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'13 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. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13.

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

Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply.

Papers should be submitted electronically via the workshop web site.

Submission Categories and Guidelines

Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice.

Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers and short papers must not exceed 4 pages in ACM Proceedings style. 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'13 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: Tue, October 2, 2012 (extended!)
• Paper submission: Sun, October 7, 2012, 23:59, GMT (extended!)
• Author notification: Tue, November 6, 2012
• Camera-Ready Paper: Wed, November 14, 2012

Invited Speakers

We are proud to present the following two invited talks:

• Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations
  
  Abstract Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results on bidirectional transformations, most of them are limited to lists and trees. We have challenged the problem of bidirectional transformations on graphs, and succeeded in implementing a bidirectional graph transformation engine called GRoundTram. In GRoundTram, graphs are treated as regular trees and manipulated by structural recursion that enjoys a nice bulk and bidirectional semantics. In this talk, I'd briefly explain our solution to the problem of bidirectional graph transformation, demonstrate some applications in bidirectional model-driven software development, and discuss practical challenges in manipulating various graphs (such as unordered, ordered, and probability graphs), determining backward transformation, and improving efficiency and scalability.
  
  
• Peter Thiemann (Institut für Informatik, Technische Fakultät, Universität Freiburg, Germany): Partially Static Operations
  
  Abstract Partial evaluation assigns binding times to values manipulated in a program. A partial evaluator processes values with a static binding time whereas a dynamic binding time mandates code generation. Binding time descriptions have evolved from monolithic to fine grained, partially static data structures where different components may have different binding times.
  
  We consider the next step in this evolution where not just data structures but also operations can give rise to partially static structures, which are processed by the partial evaluator. We introduce this notion in an online setting, generalize it, generate a binding-time analysis for it, and implement an offline partial evaluator supporting partially static operations with it. We report on our initial experiences with this new approach.

Program Committee

Program Chairs

• Elvira Albert (Complutense University of Madrid, Spain)
• Shin-Cheng Mu (Academia Sinica, Taiwan)

Program Committee Members

• María Alpuente (Technical University of Valencia, Spain)
• Kenichi Asai (Ochanomizu University, Japan)
• Maria Garcia de la Banda (Monash University, Australia and IMDEA Software Institute, Spain)
• James R. Cordy (Queen's University, Canada)
• R. Kent Dybvig (Cisco and Indiana University, USA)
• João Paulo Fernandes (University of Beira Interior, Portugal)
• Samir Genaim (Complutense University of Madrid, Spain)
• Roberto Giacobazzi (Verona University, Italy)
• Andy Gill (University of Kansas, USA)
• Jurriaan Hage (Utrecht University, Netherlands)
• Martin Hofmann (Ludwig-Maximilians-Universität München, Germany)
• Julia Lawall (Inria, France)
• Yanhong Annie Liu (Stony Brook University, USA)
• Kazutaka Matsuda (University of Tokyo, Japan)
• Keisuke Nakano (University of Electro-Communications, Japan)
• Klaus Ostermann (University of Marburg, Germany)
• Sergei A. Romanenko (Russian Academy of Sciences, Russia)
• Jeremy G. Siek (University of Colorado at Boulder, USA)
• Walid Mohamed Taha (Halmstad University, Sweden, and Rice University, USA)
• Tarmo Uustalu (Institute of Cybernetics, Tallinn, Estonia)
• Janis Voigtländer (University of Bonn, Germany)
• Dana N. Xu (Inria, France)

Steering Committee

• Elvira Albert (Complutense University of Madrid, Spain)
• Siau-Cheng Khoo (National University of Singapore, Singapore)
• Oleg Kiselyov (Monterey, CA, USA)
• Shin-Cheng Mu (Academia Sinica, Taiwan)
• Jeremy G. Siek (University of Colorado at Boulder, USA)
• Simon Thompson (University of Kent, UK)