[isabelle] LOLA 2011 Final Program and Call for Participation




===================================================================

              *** CALL FOR PARTICIPATION ***

                        LOLA  2011

       Syntax and Semantics of Low Level Languages

          Monday 20th June 2011, Toronto, Canada

             A LICS 2011-affiliated workshop 

            http://flint.cs.yale.edu/lola2011

===================================================================

IMPORTANT DEADLINES:

 * early registration deadline: 31 May 2011
 * standard registration:       1 June 2011 - 29 June 2011

Registration, accomodation, and travel/visa information for all
LICS-affiliated workshops is on the LICS 2011 web pages:

  http://www2.informatik.hu-berlin.de/lics/lics11/


FINAL WORKSHOP PROGRAM:


09:00 - 10:00 Invited Talk. 

Paul-Andre Mellies: 
An Invitation to Tensorial Logic. 

10:00 - 10:40 

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

10:40 - 11:00 Break 

11:00 - 12:00 Invited Talk. 

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

12:00 - 12:40 

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

12:40 - 14:10 Lunch 

14:10 - 14:50 

Guilhem Jaber and Nicolas Tabareau: 
The Journey of Biorthogonal Logical Relations to the Realm of Assembly Code 

14:50 - 15:30 

Lu Zhao, Guodong Li, and John Regehr: 
A Practical Logic Framework for Verifying Safety Properties about Executables 

15:30 - 16:00 Break 

16:00 - 16:40 

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

16:40 - 17:30 Discussion Session 


DESCRIPTION OF THE WORKSHOP:

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 the various aspects of the relationship
between logic and low level languages and programs.

PROGRAM COMMITTEE

* Nick Benton (MSR Cambridge)
* Josh Berdine (MSR Cambridge)
* Lars Birkedal (IT University of Copenhagen, co-chair)
* Xinyu Feng (University of Science and Technology of China)
* Greg Morrisett (Harvard University)
* Xavier Rival (INRIA Roquencourt and ENS Paris)
* Zhong Shao (Yale University, co-chair)
* Nicolas Tabareau (INRIA - EMN)
* Jérôme Vouillon (CNRS)
* Noam Zeilberger (University of Paris VII)







This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.