Home

Objective

To provide a forum for programming language and operating system researchers to collaborate and exchange ideas.

Where


Room location: MCS 180
Use the Hinsdale St. entrance. The room is immediately after the entrace on your left.

111 Cummington St., Room MCS 180
Computer Science Department
Boston University
Boston, MA 02215

When

For Spring 2009, the meetings typically take place on Wednesdays at 4pm.

Recent and Future Meetings

  • Safe Kernel Extensions Without Run-Time Checking Proof-carrying code is a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The ...
    Posted Mar 25, 2009, 8:25 AM by Likai Liu
  • Expressing the type of mmap() system call in ATS The POSIX standard specifies a mmap() system call that allows programs to request memory pages to be mapped into the current process address space. The memory pages could be backed ...
    Posted Mar 18, 2009, 2:38 PM by Likai Liu
  • Liberating Semi-Automated PL Proofs from Binder Bookkeeping The advantages of machine-checked proofs about programming languages have been clear for decades now, and the POPLmark Challenge has helped get more PL researchers started building such formal proofs ...
    Posted Feb 8, 2009, 10:27 AM by Likai Liu
  • Linear Closures In this talk, I will explain how linear closures are supported in ATS. In particular, I will present an approach to forming linear lazy values that allows resources held in ...
    Posted Feb 8, 2009, 10:22 AM by Likai Liu
  • How to assgin a type to the UNIX system call fork? The system call [fork] is *the* mechanism in UNIX to support concurrency. In this talk, I will present some types I assigned to fork (or variants of fork) in the ...
    Posted Dec 3, 2008, 12:51 PM by Likai Liu
Showing posts 1 - 5 of 10. View more ยป

Call for Talks

Topics related to programming languages, operating systems, dependent types, linear logic, garbage collection, task scheduling, and software engineering in general are welcomed. Please write to our mailing list.

Comments