<div dir="ltr">Quick updates (more details in the Call for Participation below):<br>
<br>
- Do not miss the chance to submit short talks on your cutting-edge<br>
research until 14 December 2017, AoE<br>
<a href="https://popl18.sigplan.org/track/prisc-2018#Call-for-Short-Talks" rel="noreferrer" target="_blank">https://popl18.sigplan.org/track/prisc-2018#Call-for-Short-Talks</a><br>
<br>
- POPL/PriSC registration is open; early rate ends on 10 December 2017<br>
<br>
- List of accepted PriSC presentations:<br>
<a href="https://popl18.sigplan.org/track/prisc-2018#event-overview" rel="noreferrer" target="_blank">https://popl18.sigplan.org/track/prisc-2018#event-overview</a><br>
<br>
- The PriSC invited talk will be given by Mathias Payer (Purdue University)<br>
on Challenges For Compiler-backed Security: From Sanitizer to Mitigation<br>
<br>
<br>
=============================================<br>
Call for Participation for Secure Compilation Workshop (PriSC @ POPL'18)<br>
=============================================<br>
<br>
Secure compilation is an emerging field that puts together advances in<br>
programming languages, security, verification, systems, compilers, and<br>
hardware architectures in order to devise secure compiler chains that<br>
eliminate many of today's low-level vulnerabilities. Secure<br>
compilation aims to protect high-level language abstractions in<br>
compiled code, even against adversarial low-level contexts, and to<br>
allow sound reasoning about security in the source language. The<br>
emerging secure compilation community aims to achieve this by:<br>
identifying and formalizing properties that secure compilers must<br>
possess; devising efficient enforcement mechanisms; and developing<br>
effective verification and proof techniques.<br>
<br>
<br>
=======================================<br>
2nd Workshop on Principles of Secure Compilation (PriSC 2018)<br>
=======================================<br>
<br>
The Workshop on Principles of Secure Compilation (PriSC) is a new<br>
informal 1-day workshop without any proceedings. The goal is to<br>
identify interesting research directions and open challenges and to<br>
bring together researchers interested in secure compilation.<br>
<br>
The 2nd PriSC edition will be held on Saturday, 13 January 2018, in<br>
Los Angeles, together with the ACM SIGPLAN-SIGACT Symposium on<br>
Principles of Programming Languages (POPL).<br>
<br>
More information at <a href="http://popl18.sigplan.org/track/prisc-2018" rel="noreferrer" target="_blank">http://popl18.sigplan.org/track/prisc-2018</a><br>
<br>
<br>
==========<br>
Important Dates<br>
==========<br>
<br>
POPL early registration deadline: 10 December 2017<br>
Short talk submission deadline: 14 December 2017, AoE<br>
Short talk notification: 18 December 2017<br>
PriSC Workshop takes place: 13 January 2018<br>
<br>
Do not miss the chance to submit short talks on your cutting-edge<br>
research. More information below.<br>
<br>
<br>
========<br>
Invited Talk<br>
========<br>
<br>
Challenges For Compiler-backed Security: From Sanitizer to Mitigation.<br>
Mathias Payer (Purdue University, <a href="https://nebelwelt.net/" rel="noreferrer" target="_blank">https://nebelwelt.net/</a>)<br>
<br>
<br>
===============<br>
Accepted Presentations<br>
===============<br>
<br>
Building Secure SGX Enclaves using F*, C/C++ and X64.<br>
Anitha Gollamudi, Cédric Fournet.<br>
<br>
Constant-time WebAssembly. John Renner, Sunjay Cauligi, Deian Stefan.<br>
<br>
Enforcing Well-bracketed Control Flow and Stack Encapsulation using<br>
Linear Capabilities. Lau Skorstengaard, Dominique Devriese, Lars Birkedal<br>
<br>
Formally Secure Compilation of Unsafe Low-Level Components.<br>
Guglielmo Fachini, Catalin Hritcu, Marco Stronati, Ana Nora Evans,<br>
Théo Laurent, Arthur Azevedo de Amorim, Benjamin C. Pierce, Andrew Tolmach<br>
<br>
Linear capabilities for modular fully-abstract compilation of verified code.<br>
Thomas Van Strydonck, Dominique Devriese, Frank Piessens.<br>
<br>
On Compositional Compiler Correctness and Fully Abstract Compilation.<br>
Daniel Patterson, Amal Ahmed.<br>
<br>
Per-Thread Compositional Compilation for Confidentiality-Preserving<br>
Concurrent Programs. Robert Sison.<br>
<br>
Robust Hyperproperty Preservation for Secure Compilation. Deepak Garg,<br>
Catalin Hritcu, Marco Patrignani, Marco Stronati, David Swasey.<br>
<br>
Secure Compilation in a Production Environment. Vijay D'Silva.<br>
<br>
Type-Theoretic Galois Connections.<br>
Pierre-Evariste Dagand, Nicolas Tabareau, Éric Tanter<br>
<br>
<br>
===================<br>
Participation and Registration<br>
===================<br>
<br>
PriSC will be held on Saturday, 13 Jan 2018 at the POPL'18 venue<br>
(Omni Hotel LA). To participate, please register through the POPL<br>
registration system: <a href="https://popl18.sigplan.org/attending/Registration" rel="noreferrer" target="_blank">https://popl18.sigplan.org/attending/Registration</a><br>
<br>
POPL early registration rate ends on 10 December 2017.<br>
<br>
<br>
============<br>
Call for Short Talks<br>
============<br>
<br>
We also have a short talks session, where participants get 5 minutes<br>
to present intriguing ideas, advertise ongoing work, etc. Anyone<br>
interested in giving a short 5-minute talk should submit an<br>
abstract. Any topic that could be of interest to the emerging secure<br>
compilation community is in scope. Presentations that provide a useful<br>
outside view or challenge the community are also welcome.<br>
<br>
Topics of interest include but are **not** limited to:<br>
<br>
- attacker models for secure compiler chains<br>
<br>
- secure compilation properties: full abstraction, memory safety,<br>
control-flow integrity, preserving non-interference or<br>
(hyper-)properties against adversarial contexts,<br>
secure multi-language interoperability<br>
<br>
- enforcement mechanisms: static checking, program verification,<br>
reference monitoring, program rewriting, software fault isolation,<br>
system-level protection, secure hardware, crypto, randomization<br>
<br>
- experimental evaluation and applications of secure compilation<br>
<br>
- proof methods: (bi)simulation, logical relations, game semantics,<br>
multi-language semantics, embedded interpreters<br>
<br>
- formal verification of secure compilation chain (protection<br>
mechanisms, compilers, linkers, loaders), machine-checked proofs,<br>
translation validation, property-based testing<br>
<br>
<br>
============================<br>
Guidelines for Submitting Short Talk Abstracts<br>
============================<br>
<br>
Abstracts should be submitted in text format and are not anonymous<br>
<br>
Giving a talk at the workshop does not preclude publication elsewhere.<br>
<br>
Please submit your abstracts at <a href="https://prisc18short.hotcrp.com" rel="noreferrer" target="_blank">https://prisc18short.hotcrp.com</a><br>
<br>
<br>
=============<br>
Program Committee<br>
=============<br>
<br>
Program Chair<br>
Catalin Hritcu Inria Paris<br>
<br>
Members<br>
Amal Ahmed Inria Paris and Northeastern University<br>
Lars Birkedal Aarhus University<br>
Dominique Devriese KU Leuven<br>
Cédric Fournet Microsoft Research<br>
Deepak Garg MPI-SWS<br>
Xavier Leroy Inria Paris<br>
David Naumann Stevens Institute of Technology<br>
Marco Patrignani MPI-SWS<br>
Frank Piessens KU Leuven<br>
Tamara Rezk Inria Sophia Antipolis<br>
Nikhil Swamy Microsoft Research<br>
<br>
<br>
===============<br>
Organizing Committee<br>
===============<br>
<br>
Amal Ahmed Inria Paris and Northeastern University<br>
Dominique Devriese KU Leuven<br>
Deepak Garg MPI-SWS<br>
Catalin Hritcu Inria Paris<br>
Marco Patrignani MPI-SWS<br>
Tamara Rezk Inria Sophia Antipolis<br>
<br>
<br>
===================<br>
Contact and More Information<br>
===================<br>
More information about PriSC 2018 can be found on the website:<br>
<a href="http://popl18.sigplan.org/track/prisc-2018" rel="noreferrer" target="_blank">http://popl18.sigplan.org/track/prisc-2018</a><br>
<br>
For questions please contact the Program Chair.<br>
<br>
To make sure you receive such announcements in the future please<br>
subscribe to the following low-traffic mailing list:<br>
<a href="https://lists.gforge.inria.fr/mailman/listinfo/prisc-announce" rel="noreferrer" target="_blank">https://lists.gforge.inria.fr/mailman/listinfo/prisc-announce</a></div>