7 Jul 2018
Oxford, England
LOLA 2018: Syntax and Semantics of Low-Level Languages ===================================================== Saturday, 7 July 2018, Oxford, United Kingdom A satellite workshop of LICS 2018 at FLoC 2018 https://cs.appstate.edu/~johannp/lola18/ Important dates ------------------------------------------------- LOLA submission deadline 15 April 2018 Notification 13 May 2018 Early Registration Deadline 6 June 2018 Workshop 7 July 2018 ------------------------------------------------- Submission: https://easychair.org/conferences/?conf=lola2018 Registration: http://www.floc2018.org/register/ Invited Speakers ---------------- Nada Amin, University of Cambridge https://www.cl.cam.ac.uk/~na482/ Nick Benton, Facebook Research https://research.fb.com/people/benton-nick/ Context ------- Since the late 1960s it has been known that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high-level programming languages, and to the development of reasoning principles for such languages. Yet low-level languages, such as machine code, and the compilation of high-level languages into low-level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of the past two decades has been that low-level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low-level languages (such as heaps, registers and code pointers) and low-level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS at FLoC 2018, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to: * Typed assembly languages, * Certified assembly programming, * Certified and certifying compilation, * Proof-carrying code, * Program optimization, * Modal logic and realizability in machine code, * Realizability and double orthogonality in assembly code, * Parametricity, modules and existential types, * General references, Kripke models and recursive types, * Continuations and concurrency, * Resource analysis and implicit complexity, * Closures and explicit substitutions, * Linear logic and separation logic, * Game semantics, abstract machines and hardware synthesis, * Monoidal and premonoidal categories, traces and effects. Submission ---------- LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a two page abstract or of a longer (published or unpublished) paper describing completed work. Authors are invited to submit their contribution by 15 April 2018. Abstracts must be written in English and be submitted as a single PDF file at EasyChair: https://easychair.org/conferences/?conf=lola2018 Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. At least one author of an accepted workshop proposal must be registered for the workshop. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Program Committee ----------------- * Zena Ariola, University of Oregon * Valentin Blot, Universite Paris-Sud * Karl Crary, Carnegie Mellon University * Patricia Johann, Appalachian State University (co-chair) * Ohad Kammar, University of Oxford (co-chair) * Andrew Kennedy, Facebook * Ori Lahav, Tel Aviv University * Jim Laird, University of Bath * Rasmus Mogelberg, IT University Copenhagen * Dave Naumann, Stevens University of Technology * Azalea Raad, MPI-SWS * Christine Rizkallah, University of Pennsylvania * Claudio Russo, Microsoft Research Cambridge -- [LOGIC] mailing list http://www.dvmlg.de/mailingliste.html Archive: http://www.illc.uva.nl/LogicList/ provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam