[loginf] LOLA 2014 - Call for Talk Proposals

Martin Hofmann hofmann at ifi.lmu.de
Mon Mar 3 17:39:25 CET 2014



  LOLA 2014

Syntax and Semantics of Low Level Languages

Sunday 13th July 2014, Vienna, Austria

  A satellite workshop of CSL/LICS 2014
at the Vienna Summer of Logic

http://vsl2014.at/lola/ [1]


  Submission deadline: Friday 9 May 2014
Author notification: Wednesday 21 May 2014
  Workshop: Sunday 13th July 2014


The submissions will be made by easychair at
  https://www.easychair.org/conferences/?conf=lola2014 [2]


  It has been understood since the late 1960s 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 a low level ones have traditionally been seen as having
  little or no essential connection to logic.

  However, a fundamental discovery of this past decade 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 sublinear programming.

  The LOLA workshop, affiliated with CSL-LICS, will bring together
researchers interested in many aspects of the relationship 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,
  Implicit complexity, sublinear programming and Turing machines,
Closures and explicit substitutions,
  Linear logic and separation logic,
Game semantics, abstract machines and hardware synthesis,
  Monoidal and premonoidal categories, traces and effects.


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.


Amal Ahmed (Northeastern Universtiy)
Jade Alglave (University College London)
  Lennart Beringer (Princeton University)
Ugo Dal Lago (Università di Bologna)
  Martin Hofmann (LMU Munich, co-chair)
Neelakantan Krishnaswami (The University of Birmingham)
  Andrzej Murawski (University of Warwick, co-chair)
Francois Pottier (INRIA)
  David van Horn (University of Maryland)
Steve Zdancewic (University of Pennsylvania)

[1] http://vsl2014.at/lola/
[2] https://www.easychair.org/conferences/?conf=lola2014

More information about the loginf mailing list