[ecoop-info] PLDI 2008 ADVANCE PROGRAM / Call for Participation

[Jens Knoop]

===============================================================================
   SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
                        Tucson, Arizona, June 7 - 13, 2008
                           http://pldi2008.cs.ucr.edu/

                        Registration Deadline: May 14, 2008
                     Hotel Reservation Deadline: May 7, 2008
===============================================================================
        Supported by: Google, Microsoft Research, Intel, AMD, IBM Research
===============================================================================
                                COLOCATED EVENTS
   LCTES: Conference on Languages, Compilers, and Tools for Embedded Systems
    ISMM: International Symposium on Memory Management
    PLAS: Workshop on Programming Languages and Analysis for Security
     SAW: Static Analysis Workshop
===============================================================================
PLDI Tutorial Program

Morning Session: 8:30 am - 12:00 pm

M1:     Demystifying GCC: Under the Hood of the GNU Compiler Collection
        Morgan Deters and Ron Cytron (Washington University)

M2:     Transactional Memory: From Semantics to Implementation
        Yang Ni, Tatiana Shpeisman, and Adam Welc (Intel Corporation)

Afternoon Session: 1:30 pm - 5:00 pm

A1:     Analysis and Optimization of Parallel Programs
        Sam Midkiff (Purdue University) and Vivek Sarkar (Rice University)

A2:     Building a High Level Language Compiler for GPGPU
        Bixia Zheng, Derek Gladding, and Micah Villmow (AMD)
===============================================================================
PLDI Technical Program

Monday, June 9, 2008

Opening Remarks (8:30am - 8:40am)

Invited Talk: TBD (8:40am - 9:40am)

Session I (9:45am - 10:35am)
    Checking Race Freedom via Linear Programming
       Tachio Terauchi (Tohoku University)
    Race Directed Randomized Dynamic Analysis of Concurrent Programs
       Koushik Sen (University of California, Berkeley)

Break (10:35am - 11:00am)

Session II (11:00am - 12:15pm)
    Immix: A Mark-Region Garbage Collector with Space Efficiency, Fast 
    Collection, and Mutator Performance
       Stephen Blackburn (Australian National University) and Kathryn McKinley
       (The University of Texas at Austin)
    A Study of Concurrent Real-Time Garbage Collectors
       Filip Pizlo (Purdue University), Erez Petrank (Microsoft Research and 
       Technion), and Bjarne Steensgaard (Microsoft Corporation)
    Conditional Correlation Analysis for Safe Region-based Memory Management
       Xi Wang (Tsinghua University), Zhilei Xu (Tsinghua University), 
       Xuezheng Liu (Microsoft Research Asia), Zhenyu Guo (Microsoft 
       Research Asia), Xiaoge Wang (Tsinghua University), 
       and Zheng Zhang (Microsoft Research Asia)

SIGPLAN Awards Lunch (12:30pm - 2:00pm); Sponsored by Google

Session III (2:00pm - 3:15pm)
    Automatic Volume Management for Programmable Microfluidics
       Ahmed M. Amin (Purdue University), Mithuna Thottethodi (Purdue 
       University), T. N. Vijaykumar (Purdue University), 
       Steven Wereley (Purdue University), and
       Stephen C. Jacobson (Indiana University)
    Foundations of the C++ Concurrency Memory Model
       Hans-J. Boehm (HP Labs) and Sarita Adve (Univ. of Illinois at 
       Urbana-Champaign)
    Expressive and Safe Static Reflection
       Shan Shan Huang  (Georgia Institute of Technology, College of 
       Computing) and Yannis Smaragdakis (Univ. of Oregon, Dept. of 
       Computer and Information Science)

Break (3:15pm - 3:40pm)

Session IV (3:40pm - 4:55pm)
    Iterative Optimization in the Polyhedral Model: Part II, 
    Multidimensional Time
       Louis-Noel Pouchet (INRIA Futurs), Cedric Bastoul (University of 
       Paris-Sud 11), John Cavazos (Computer and Information Sciences, 
       University of Delaware), and Albert Cohen (INRIA Futurs)
    A Practical Automatic Polyhedral Parallelization and Locality 
    Optimization System
       Uday Bondhugula (The Ohio State University), Albert Hartono (The Ohio 
       State University), P. Sadayappan (The Ohio State University), and 
       J. Ramanujam (Louisiana State University)
    Orchestrating Execution of Stream Programs on Multicore Platforms
       Manjunath Kudlur and Scott Mahlke (University of Michigan)

PLDI Business Meeting (5:00pm - 6:00pm)

Tuesday, June 10, 2008

Session V (8:30am - 9:45am)
    Deriving Linearizable Fine-Grained Concurrent Objects
        Martin Vechev and Eran Yahav (IBM T.J. Watson Research Center)
    Sketching Concurrent Data Structures
        Armando Solar-Lezama, Christopher Grant Jones, Gilad Arnold, and
         Rastislav Bodik (University of California, Berkeley)
    SharC: Checking Data Sharing Strategies for Multithreaded C
        Zachary Anderson (University of California, Berkeley), David Gay
        (Intel Research Berkeley), Rob Ennals (Intel Research Berkeley),
        and Eric Brewer (University of California, Berkeley)

Break (9:45am - 10:05am)

Session VI (10:05am - 11:20am)
    Liquid Types
        Patrick Rondon, Ming Kawaguchi and Ranjit Jhala (University of 
        California, San Diego)
    Certifying Low-Level Programs with Hardware Interrupts and 
    Preemptive Threads
        Xinyu Feng (TTI-C), Zhong Shao (Yale University), 
        Yuan Dong (Tsinghua University), and
        Yu Guo (University of Science and Technology of China)
    Type-Preserving Compilation for Realistic Object-Oriented Compilers
        Juan Chen (Microsoft Research), Chris Hawblitzel (Microsoft Research),
        Frances Perry (Princeton University), Mike Emmi (University of 
        California, Los Angeles), Jeremy Condit (Microsoft Research), 
        Derrick Coetzee (Microsoft Research), and
        Polyvios Pratikakis (University of Maryland, College Park)

Break (11:20am - 11:40am)

Session VII (11:40am - 12:30pm)
    Quantitative Information Flow as Network Flow Capacity
        Stephen McCamant and Michael Ernst (Massachusetts Institute 
        of Technology)
    Grammar-based Whitebox Fuzzing
        Patrice Godefroid (Microsoft Research), Adam Kiezun (Massachusetts 
        Institute of Technology), and Michael Levin (Microsoft Center for 
        Software Excellence)

Lunch (included) (12:30pm - 2:00pm)

Session VIII (2:00pm - 3:15pm)
    Register Allocation by Puzzle Solving
        Fernando Pereira and Jens Palsberg (University of California, 
        Los Angeles)
    Copy Coalescing by Graph Recoloring
        Sebastian Hack (ENS Lyon)
    Efficient Program Execution Indexing
        Bin Xin, Nick Sumner, and Xiangyu Zhang (Purdue University)

Break (3:15pm - 3:40pm)

Session IX (3:40pm - 5:20pm)
    Bootstrapping: A Technique for Scalable Flow and Context-Sensitive 
    Pointer Alias Analysis
        Vineet Kahlon (NEC Labs, Princeton, USA)
    Explaining Failures of Program Analyses
        Daniel von Dincklage and Amer Diwan (University of Colorado)
    Sound, Complete, and Scalable Path-Sensitive Analysis
        Isil Dillig, Thomas Dillig, and Alex Aiken (Stanford University)
    Program Analysis as Constraint Solving
        Sumit Gulwani (Microsoft Research), Saurabh Srivastava (University 
        of Maryland at College Park), and Ramarathnam Venkatesan (Microsoft 
        Research)

Student Research Competition (5:30pm - 6:30pm)

Wednesday, June 11, 2008
Session X (8:30am - 10:10am)
    Velodrome: A Sound and Complete Dynamic Atomicity Checker for 
    Multithreaded Programs
        Cormac Flanagan and Jaeheon Yi (University of California, Santa Cruz),
        and Stephen Freund (Williams College)
    Inferring Locks for Atomic Sections
        Sigmund Cherem (Cornell University), Trishul Chilimbi (Microsoft 
        Research), and Sumit Gulwani (Microsoft Research)
    Dataflow Analysis for Concurrent Programs using Datarace Detection
        Ravi Chugh, Jan Voung, Ranjit Jhala, and Sorin Lerner (University of 
        California, San Diego)
    Xmem: Type-Safe, Transparent, Shared Memory for Cross-Runtime 
    Communication and Coordination
        Michal Wegiel and Chandra Krintz (University of California, 
        Santa Barbara)

Break (10:10am - 10:35am)

Session XI (10:35am - 12:15pm)
    Discovering Properties about Arrays in Simple Programs
        Mathias Péron and Nicolas Halbwachs (Verimag / CNRS)
    Full Functional Verification for Linked Data Structures
        Karen Zee (Massachusetts Institute of Technology), Viktor 
        Kuncak (EPFL, Switzerland), and
        Martin Rinard (Massachusetts Institute of Technology)
    Fair Stateless Model Checking
        Madanlal Musuvathi and Shaz Qadeer (Microsoft Research)
    Model Checking Transactional Memories
        Rachid Guerraoui, Thomas Henzinger, Barbara Jobstmann, and 
        Vasu Singh (EPFL, Switzerland)

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