POPL 2007: Preliminary List of Accepted Papers

POPL 2007: Preliminary List of Accepted Papers

  1. Jeffrey Mark Siskind and Barak A. Pearlmutter

    MAP-CLOSURE is to Closure Conversion as CALL/CC is to CPS Conversion: An implementation of mutation in a functional language using CALL/CC and MAP-CLOSURE

  2. Barak A. Pearlmutter and Jeffrey Mark Siskind

    Lazy Multivariate Higher-Order Forward-Mode AD

  3. Matthew Parkinson, Richard Bornat and Peter O'Hearn

    Modular Verification of a Non-Blocking Stack

  4. Jacob Matthews and Robert Bruce Findler

    Operational Semantics for Multi-Language Programs

  5. Yitzhak Mandelbaum, Kathleen Fisher, David Walker, Mary Fernandez, and Artem Gleyzer

    PADS/ML: A Functional Data Description Language

  6. Marina Polishchuk, Ben Liblit, and Chloë W. Schulze

    Dynamic Heap Type Inference for Program Understanding and Debugging

  7. Maria Jump and Kathryn S McKinley

    Cork: Dynamic Memory Leak Detection for Garbage-Collected Languages

  8. Patrice Godefroid

    Compositional Dynamic Test Generation

  9. Michael Emmi, Jeffrey Fischer, Ranjit Jhala, Rupak Majumdar

    Lock Allocation

  10. Juan Chen

    A Typed Intermediate Language for Compiling Multiple Inheritance

  11. Derek Dreyer, Robert Harper, and Manuel M.T. Chakravarty

    Modular Type Classes

  12. Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Ding

    Locality Approximation Using Time

  13. Ralf Lammel

    Scrap your boilerplate with XPath-like combinators

  14. Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Vardi

    Proving That Programs Eventually Do Something Good

  15. Andrew M Pitts and Mark R Shinwell

    Generative Unbinding of Names

  16. Matthew Might

    Logic-Flow Analysis of Higher-Order Programs

  17. John Reppy, Yingqi Xiao

    Specialization of CML message-passing primitives

  18. Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi

    Preferential Path Profiling: Compactly Numbering Interesting Paths

  19. Andrew W. Appel, Paul-Andre Mellies, Christopher D. Richards, Jerome Vouillon

    A Very Modal Model of a Modern, Major, General Type System

  20. Daniel K. Lee, Karl Crary, Robert Harper

    Towards a Mechanized Metatheory of Standard ML

  21. Mayur Naik and Alex Aiken

    Conditional Must Not Aliasing for Static Race Detection

  22. Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, Oege de Moor, Damien Sereni, Julian Tibble, Mathieu Verbaere

    Semantics of Static Pointcuts in AspectJ

  23. Gerwin Klein, Harvey Tuch, Michael Norrish

    Types, Bytes, and Separation Logic

  24. Cristiano Calcagno, Philippa Gardner, Uri Zarfaty

    Context Logic as Modal Logic: Completeness and Parametric Inexpressivity

  25. Pasquale Malacaria

    Assessing security threats of looping constructs

  26. Dachuan Yu, Ajay Chander, Nayeem Islam, and Igor Serikov

    JavaScript Instrumentation for Browser Security

  27. Ben Wiedermann and William R. Cook

    Extracting Queries by Static Analysis of Transparent Persistence

  28. Michele Bugliesi and Marco Giunti

    Secure Implementations of Typed Channel Abstractions

  29. Dan Ghica

    Geometry of Synthesis: A structural approach to VLSI design

  30. Vineet Kahlon and Aarti Gupta

    On the Analysis of Interacting Pushdown System

  31. Kristian Stoevring and Soren B. Lassen

    A Complete, Co-Inductive Syntactic Theory of Sequential Control and State

  32. Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter O'Hearn

    Variance analyses from invariance analyses

  33. Mila Dalla Preda, Mihai Christodorescu, Somesh Jha, Saumya Debray

    A Semantics-Based Approach to Malware Detection

  34. Atsushi Ohori , Isao Sasano

    Lightweight Fusion by Fixed Point Promotion

  35. Sumit Gulwani and Nebojsa Jojic

    Program Verification as Probabilistic Inference

  36. Ranjit Jhala, Rupak Majumdar

    Interprocedural Analysis of Asynchronous Programs