PEPM 2018 Final Call for Poster/Demo Abstracts and Participation ================================================================
A tentative programme is available, with two invited talks decided. Poster/demo abstracts are due this Friday (8th December, AoE). See below for the submission guideline. Registration ------------ * Web page : https://popl18.sigplan.org/attending/Registration * Early registration deadline : 10th December 2017 Programme --------- * https://popl18.sigplan.org/track/PEPM-2018#program Monday, 8th January 2018 10:30 - 11:30 Developments in Property-Based Testing (Invited Talk) Jan Midtgaard 11:30 - 12:00 Selective CPS Transformation for Shift and Reset Kenichi Asai, Chihiro Uehara Lunch 14:00 - 14:30 A Guess-and-Assume Approach to Loop Fusion for Program Verification Akifumi Imanishi, Kohei Suenaga, Atsushi Igarashi 14:30 - 15:00 Gradually Typed Symbolic Expressions David Broman, Jeremy G. Siek 15:00 - 15:30 On the Cost of Type-Tag Soundness Ben Greenman, Zeina Migeed Break 16:00 - 17:00 TBA (Invited Talk) Conal Elliott Tuesday, 9th January 2018 10:30 - 11:30 Challenges in the Design and Compilation of Programming Languages for Exascale Machines (Invited Talk) Alex Aiken 11:30 - 12:00 Checking Cryptographic API Usage with Composable Annotations (Short Paper) Duncan Mitchell, L. Thomas van Binsbergen, Blake Loring, Johannes Kinder Lunch 14:00 - 14:30 Partially Static Data as Free Extension of Algebras (Short Paper) Jeremy Yallop, Tamara von Glehn, Ohad Kammar 14:30 - 15:00 Program Generation for ML Modules (Short Paper) Takahisa Watanabe, Yukiyoshi Kameyama 15:00 - 15:30 Recursive Programs in Normal Form (Short Paper) Barry Jay Break 16:00 - 17:30 Posters/demos (TBA) Poster/demo abstract submission guideline ----------------------------------------- * https://popl18.sigplan.org/track/PEPM-2018#Call-for-Poster-Demo-Abstracts To maintain PEPM’s dynamic and interactive nature, PEPM 2018 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 minutes. 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: http://sigplan.org/Resources/Author/ and sent by email to the programme co-chairs, Fritz Henglein and Josh Ko, at: hengl...@diku.dk, hsiang-sh...@nii.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 should be sent no later than: Friday, 8th December 2017, anywhere on earth and will be considered for acceptance on a rolling basis. Accepted abstracts, along with their short summary, will be posted on PEPM 2018’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. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2018 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * 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 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 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, Fritz Henglein and Josh Ko (hengl...@diku.dk, hsiang-sh...@nii.ac.jp). _______________________________________________ Haskell mailing list Haskell@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
