CS 7190 (Fall 2011)

Seminar in Programming Languages
Time: Wednesdays at 3:35pm
Location: TBA

Overview

The Programming Languages Discussion Group meets weekly to discuss papers in the area of programming languages, program analysis, and compilers. The goal is to encourage interactions and discussions between students, researchers, and faculty with interests in this area. The seminar is open to everybody interested in languages and compilers. First-year and second-year students are especially encouraged to participate. Participating students should register for the 1-credit course CS 7190.

Talks will be advertised on the pldg-l email list.

Schedule


Date Topic Presenter
31 Aug Organizational Meeting
7 Sep Broberg and Sands.
Paralocks – Role-based information flow control and beyond.
POPL 2010.
Mike George
14 Sep Swamy, Chen, Fournet, Strub, Bharagavan, and Yang.
Secure distributed programming with value-dependent types.
ICFP 2011.
Jean-Baptiste Jeannin
21 Sep Smaragdakis, Bravenboer, and Lhotak.
Pick your contexts well: Understanding object-sensitivity.
POPL 2011.
Owen Arden
28 Sep Lexically scoped code generation.
See Kameyama, Kiselyov, Shan. Shifting the stage: Staging with delimited control. PEPM 2009.
Chung-chieh Shan
5 Oct An, Chaudhuri, Foster, Hicks.
Dynamic inference of static types for Ruby.
POPL 2011.
Nate Foster
12 Oct Danvy and Zerny.
A prequel to reduction semantics for deterministic programming languages.
Olivier Danvy
19 Oct Enforcing security policies: limitations and extensions.
See Tawbi, Talhi and Debbabi. Execution monitoring enforcement under memory-limitations constraints. I&C 2008.
Nadia Tawbi
26 Oct Reitblatt, Foster, Rexford, Walker.
Consistent updates for software-defined networks: change you can believe in!
HotNets X.
Mark Reitblatt
2 Nov Hoffman, Pierce, and Wagner.
Edit lenses.
POPL 2012.
Raghu Rajkumar
9 Nov Ahmed, Findler, Siek, Wadler.
Blame for all.
POPL 2011.
Lonnie Princehouse
16 Nov Gibbons and Hinze.
Just do it: Simple monadic equational reasoning.
ICFP 2011.
Chin Isradisaikul
30 Nov Moore and Chong.
Static analysis for efficient hybrid information-flow control.
CSF 2011.
Elisavet Kozyri
7 Dec Kozen.
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events.
LICS 1991. (Recipient of the LICS 2011 Test-of-Time Award.)
Dexter Kozen
Validate XHTML Validate CSS
Last updated January 2012