LOLA 2012: Syntax and Semantics of Low-Level Languages
June 24, 2012, Dubrovnik, Croatia

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



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

All talks to be held in Room B01.

09:00 - 10:00 Invited Talk

Ulrich Schoepp
Computation by Interaction for Structuring Low-Level Languages

10:00 - 10:40

Nikos Tzevelekos and Andrzej Murawski:
Algorithmic Games for Full Ground References

10:40 - 11:10 Break

11:10 - 11:50

Jacob Thamsborg, Lars Birkedal, Guilhem Jaber and Filip Sieczkowski:
Kripke Logical Relations for Region Polymorphism

11:50 - 12:30

Tadeusz Litak:
Extending Nakano-style Type Systems and Logics

12:30 - 14:00 Lunch

14:00 - 15:00 Invited Talk

Jade Alglave:
Reasoning Formally About Weak Memory from Testing

15:00 - 15:40

Nick Benton, Andrew Kennedy and Jonas Jensen:
Using Coq to Generate and Reason About x86 Systems Code

15:40 - 16:10 Break

16:10 - 16:50

Ruy Ley-Wild and Aleksandar Nanevski:
Subjective Concurrent Separation Logic

16:50 - 17:30

Paul-Andre Mellies:
Strong Monads and Enriched Adjunctions

Important Dates

   Submission deadline: April 13, Friday, 2012 (anywhere on earth)
   Author notification:   April 30, Monday, 2012
   Workshop:June 24, Sunday, 2012

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.


Last modified on May 26, 2012 by Amal Ahmed, College of Computer and Information Science, Northeastern University
Validate this page