33. POPL 2006: Charleston, South Carolina, USA

• James McKinna:
  Why dependent types matter. 1
  
• Kathleen Fisher, Yitzhak Mandelbaum, David Walker:
  The next 700 data description languages. 2-15
  
• Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yutao Zhong, Youfeng Wu:
  A hierarchical model of data locality. 16-29
  
• Gautam Gupta, Sanjay V. Rajopadhye:
  Simplifying reductions. 30-41
  
• Xavier Leroy:
  Formal certification of a compiler back-end or: programming a compiler with a proof assistant. 42-54
  
• Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith, Keith Wansbrough:
  Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations. 55-66
  
• Mads Dam:
  Decidability and proof systems for language-based noninterference relations. 67-78
  
• Sebastian Hunt, David Sands:
  On flow-sensitive security types. 79-90
  
• Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee:
  A logic for information flow in object-oriented programs. 91-102
  
• Jerome Vouillon:
  Polymorphic regular tree types and patterns. 103-114
  
• Shuvendu K. Lahiri, Shaz Qadeer:
  Verifying properties of well-founded linked lists. 115-126
  
• Matthew Might, Olin Shivers:
  Environment analysis via Delta CFA. 127-140
  
• Vasileios Koutavas, Mitchell Wand:
  Small bisimulations for reasoning about higher-order imperative programs. 141-152
  
• Rajeev Alur, Swarat Chaudhuri, P. Madhusudan:
  A fixpoint calculus for local and global program flows. 153-165
  
• Martin Odersky:
  The Scala experiment: can we provide better language support for component systems? 166-167
  
• Norman Danner, James S. Royer:
  Adventures in time and space. 168-179
  
• Albert Cohen, Marc Duranton, Christine Eisenbeis, Claire Pagetti, Florence Plateau, Marc Pouzet:
  N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems. 180-193
  
• Guangyu Chen, Feihui Li, Mahmut T. Kandemir:
  Compiler-directed channel allocation for saving power in on-chip networks. 194-205
  
• Nils Anders Danielsson, John Hughes, Patrik Jansson, Jeremy Gibbons:
  Fast and loose reasoning is morally correct. 206-217
  
• Philippe Meunier, Robert Bruce Findler, Matthias Felleisen:
  Modular set-based analysis from contracts. 218-231
  
• François Pottier, Yann Régis-Gianas:
  Stratified type inference for generalized algebraic data types. 232-244
  
• Cormac Flanagan:
  Hybrid type checking. 245-256
  
• Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno:
  A polymorphic modal type system for lisp-like multi-staged languages. 257-268
  
• Tim Sweeney:
  The next mainstream programming language: a game developer's perspective. 269
  
• Erik Ernst, Klaus Ostermann, William R. Cook:
  A virtual class calculus. 270-282
  
• Jed Liu, Aaron Kimball, Andrew C. Myers:
  Interruptible iterators. 283-294
  
• Gabriel Dos Reis, Bjarne Stroustrup:
  Specifying C++ concepts. 295-308
  
• Hayo Thielecke:
  Frame rules from answer types for code pointers. 309-319
  
• Zhaozhong Ni, Zhong Shao:
  Certified assembly programming with embedded code pointers. 320-333
  
• Mandana Vaziri, Frank Tip, Julian Dolby:
  Associating synchronization constraints with data in an object-oriented language. 334-345
  
• Bill McCloskey, Feng Zhou, David Gay, Eric A. Brewer:
  Autolocker: synchronization inference for atomic sections. 346-358
  
• Yi Lu, John Potter:
  Protecting representation with effect encapsulation. 359-371
  
• Zhendong Su, Gary Wassermann:
  The essence of command injection attacks in web applications. 372-382
  
• Daniel S. Dantas, David Walker:
  Harmless advice. 383-396
  
• Vijay Menon, Neal Glew, Brian R. Murphy, Andrew McCreight, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Leaf Petersen:
  A verifiable SSA program representation for aggressive compiler optimization. 397-408
  
• Reuben Olinsky, Christian Lindig, Norman Ramsey:
  Staged allocation: a compositional technique for specifying and implementing procedure calling conventions. 409-421