Robert Glück, Oege de Moor
Proceedings of the 13th Symposium on Partial Evaluation and Semantics-Based Program Manipulation
PEPM, 2008.

@proceedings{PEPM-2008,
	acmid         = "1328408",
	address       = "San Francisco, California, USA",
	editor        = "Robert Glück and Oege de Moor",
	isbn          = "978-1-59593-977-7",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 13th Symposium on Partial Evaluation and Semantics-Based Program Manipulation}",
	year          = 2008,
}

Contents (22 items)

3 ×#bound
3 ×#source code
2 ×#functional
2 ×#hardware
2 ×#proving
2 ×#recursion
2 ×#refactoring
2 ×#tool support
2 ×#using
2 ×#verification

PEPM-2008-Bodik #sketching #synthesis

Software synthesis with sketching (RB), pp. 1–2.

PEPM-2008-LamMLW #data flow #information management #web

Securing web applications with static and dynamic information flow tracking (MSL, MCM, VBL, JW), pp. 3–12.

PEPM-2008-Voigtlander #correctness #proving #theorem

Proving correctness via free theorems: the case of the destroy/build-rule (JV), pp. 13–20.

PEPM-2008-Mogensen #functional #parametricity

Semi-inversion of functional parameters (TÆM), pp. 21–29.

PEPM-2008-Mu #algorithm #bound #problem

Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.

PEPM-2008-GillenwaterMSZTGO #hardware #static typing #using

Synthesizable high level hardware descriptions: using statically typed two-level languages to guarantee verilog synthesizability (JG, GM, CS, AYZ, WT, JG, JO), pp. 41–50.

PEPM-2008-SultanaT #refactoring #verification

Mechanical verification of refactorings (NS, SJT), pp. 51–60.

PEPM-2008-PietrzakCPH #analysis #composition #prolog #source code #verification

A practical type analysis for verification of modular prolog programs (PP, JC, GP, MVH), pp. 61–70.

PEPM-2008-EdwardsZ #concurrent #recursion

Static elaboration of recursion for concurrent software (SAE, JZ), pp. 71–80.

PEPM-2008-PuchingerS #automation #bound #source code

Automating branch-and-bound for dynamic programs (JP, PJS), pp. 81–89.

PEPM-2008-SaabasU #optimisation #proving

Proof optimization for partial redundancy elimination (AS, TU), pp. 91–101.

PEPM-2008-WarthDM #parsing #recursion

Packrat parsers can support left recursion (AW, JRD, TDM), pp. 103–110.

PEPM-2008-VolanschiR #tool support

Unparsed patterns: easy user-extensibility of program manipulation tools (NV, CR), pp. 111–121.

PEPM-2008-JancuraP #framework #ide #integration #programming language

Generic framework for integration of programming languages into netbeans ide (JJ, DP), pp. 123–124.

PEPM-2008-MastroeniZ #dependence #semantics #slicing #syntax

Data dependencies and program slicing: from syntax to abstract semantics (IM, DZ), pp. 125–134.

PEPM-2008-DjokoDF #aspect-oriented

Aspects preserving properties (SDD, RD, PF), pp. 135–145.

PEPM-2008-KameyamaKS #staged

Closing the stage: from staged code to typed closures (YK, OK, CcS), pp. 147–157.

PEPM-2008-ZhuK #library #using

Specialization for applications using shared libraries (PZ, SCK), pp. 159–168.

PEPM-2008-FeiginM #hardware

Jones optimality and hardware virtualization: a report on work in progress (BF, AM), pp. 169–175.

PEPM-2008-PopeeaXC #array #bound #precise

A practical and precise inference and specializer for array bound checks elimination (CP, DNX, WNC), pp. 177–187.

PEPM-2008-HageH #lazy evaluation

Heap recycling for lazy languages (JH, SH), pp. 189–197.

PEPM-2008-LiT #functional #refactoring #source code #tool support

Tool support for refactoring functional programs (HL, SJT), pp. 199–203.