LOLA 2011: Syntax and Semantics of Low-Level Languages
June 20, 2011, Toronto, Canada

A satellite workshop of Logic in Computer Science (LICS 2011)



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 the some of the most advanced contemporary researches 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 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:

Invited Speakers

Program of the Workshop

09:00 - 10:00 Invited Talk.

Paul-Andre Mellies:
An Invitation to Tensorial Logic.

10:00 - 10:20 Break

10:20 - 11:00

Ian Wehrman and Josh Berdine:
A Proposal for Weak-Memory Local Reasoning

11:00 - 11:40

Guilhem Jaber and Nicolas Tabareau:
The Journey of Biorthogonal Logical Relations to the Realm of Assembly Code (full paper in pdf)

11:40 - 12:20

Dan R. Ghica and Nikos Tzevelekos:
System Level Games: Taking semantics out of context

12:20 - 13:40 Lunch

13:40 - 14:40 Invited Talk.

Adam Chlipala.
Bedrock: Higher-Order and Automated Proofs about Low-Level Programs

14:40 - 15:20

Lu Zhao, Guodong Li, and John Regehr:
A Practical Logic Framework for Verifying Safety Properties about Executables (full paper in pdf)

15:20 - 15:50 Break

15:50 - 16:30

Alexey Gotsman, Josh Berdine, and Byron Cook:
Precision and the Conjunction Rule in Concurrent Separation Logic

16:30 - 17:30 Discussion Session

Important Dates

   Paper deadline: April 29, Friday, 2011
      Submission site:
   Author notification:   May 13, Friday, 2011
   Workshop:June 20, Monday, 2011

Submission Information

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 short abstract or of a longer (published or unpublished) paper describing completed work.

The submissions will be made by easychair at LOLA submission site until Friday 29th April 2011, included.


Last modified on March 25, 2011 by Zhong Shao, Dept. of Computer Science, Yale University
Validate this page