Accepted Papers

ACM SIGPLAN 2008 Workshop on Partial Evaluation and Program Manipulation

The following papers have been accepted for presentation at the workshop (in no particular order):

  • Jakob Puchinger and Peter Stuckey. Automating Branch-and-Bound for Dynamic Programs
  • Janis Voigtländer. The destroy/build-rule (A case for doing things right from the start)
  • Huiqing Li and Simon Thompson. Tool Support for Refactoring Functional Programs
  • Boris Feigin and Alan Mycroft. Jones Optimality and Hardware Virtualization / A Report on Work in Progress
  • Isabella Mastroeni and Damiano Zanardini. Data dependencies and program slicing: From syntax to abstract semantics
  • Stephen A. Edwards and Jia Zeng. Static Elaboration of Recursion for Concurrent Software
  • Nic Volanschi and Christian Rinderknecht. Unparsed Patterns: Easy User-Extensibility of Program Manipulation Tools
  • Ping Zhu and Siau-Cheng Khoo. Specialization for Applications Using Shared Libraries
  • Jurriaan Hage and Stefan Holdermans. Heap Recycling for Lazy Languages
  • Daniel Prusa and Jan Jancura. Generic Framework for Integration of Programming Languages into Net Beans IDE
  • Torben Mogensen. Semi-Inversion of Functional Parameters
  • Corneliu Popeea, Dana N. Xu and Wei Ngan Chin. A Practical Inference and Specializer for Array Bound Checks Elimination
  • Nik Sultana and Simon Thompson. Mechanical verification of refactorings
  • Ando Saabas and Tarmo Uustalu. Proof optimization for partial redundancy elimination
  • Pawel Pietrzak, Jesús Correas Fernández, German Puebla and Manuel Hermenegildo. A Practical Type Analysis for Verification of Modular Prolog Programs
  • Alessandro Warth, James Douglass and Todd Millstein. Packrat Parsers Can Support Left Recursion
  • Yukiyoshi Kameyama, Oleg Kiselyov and Chung-chieh Shan. Closing the Stage: From staged code to typed closures
  • Jennifer Gillenwater, Gregory Malecha, Cherif Salama, Angela Yun Zhu, Walid Taha, Jim Grundy and John O'Leary. Synthesizable High Level Hardware Descriptions
  • Shin-Cheng Mu. Maximum Segment Sum is Back - Deriving Algorithms for Two Segment Problems with Bounded Lengths
  • Djoko Djoko Simplice, Rémi Douence and Pascal Fradet. Aspects Preserving Properties