Neil D. Jones
Proceedings of the Fourth Symposium on Partial Evaluation and Semantics-Based Program Manipulation
PEPM, 1995.

@proceedings{PEPM-1995,
	acmid         = "215465",
	address       = "La Jolla, California, USA",
	editor        = "Neil D. Jones",
	isbn          = "0-89791-720-0",
	publisher     = "{ACM Press}",
	title         = "{Proceedings of the Fourth Symposium on Partial Evaluation and Semantics-Based Program Manipulation}",
	year          = 1995,
}

Contents (24 items)

7 ×#source code
6 ×#analysis
3 ×#abstract interpretation
3 ×#higher-order
3 ×#logic programming
3 ×#partial evaluation
3 ×#semantics
2 ×#concurrent
2 ×#data type
2 ×#using

PEPM-1995-Reps #analysis #problem

Shape Analysis as a Generalized Path Problem (TWR), pp. 1–11.

PEPM-1995-RamakrishnanRS #analysis #constraints #framework #logic programming #source code #theorem proving

A Symbolic Constraint Solving Framework for Analysis of Logic Programs (CRR, IVR, RCS), pp. 12–23.

PEPM-1995-Jones #years after

Special Address: MIX ten years after (NDJ), pp. 24–38.

PEPM-1995-Mogensen #online #partial evaluation #self #λ-calculus

Self-applicable Online Partial Evaluation of Pure λ Calculus (TÆM), pp. 39–44.

PEPM-1995-TangJ #type system

Effect Systems with Subtyping (YMT, PJ), pp. 45–53.

PEPM-1995-DussartBV

Polyvariant Constructor Specialisation (DD, EB, KDV), pp. 54–65.

PEPM-1995-MalmkjaerO #higher-order

Polyvariant Specialisation for Higher-Order, Block-Structured Languages (KM, PØ), pp. 66–76.

PEPM-1995-PueblaH #implementation #logic programming #multi #source code

Implementation of Multiple Specialization in Logic Programs (GP, MVH), pp. 77–87.

PEPM-1995-Metayer #data type #proving #recursion #source code

Proving Properties of Programs Defined over Recursive Data Structures (DLM), pp. 88–99.

PEPM-1995-DasRH #analysis #imperative #semantics #source code

Semantic Foundations of Binding Time Analysis for Imperative Programs (MD, TWR, PVH), pp. 100–110.

PEPM-1995-Debray #abstract interpretation #low level #optimisation

Abstract Interpretation and Low-Level Code Optimization (SKD), pp. 111–121.

PEPM-1995-Monsuez #abstract interpretation #strict #type inference #using

Using Abstract Interpretation to Define a Strictness Type Inference System (BM), pp. 122–133.

PEPM-1995-Goubault #automaton #higher-order #interpreter

Schedulers as Abstract Interpreter of Higher Dimensional Automata (EG), pp. 134–145.

PEPM-1995-SperberT #lr #parsing

The Essence of LR Parsing (MS, PT), pp. 146–155.

PEPM-1995-Jensen #analysis #data flow #source code

Clock Analysis of Synchronous Dataflow Programs (TPJ), pp. 156–167.

PEPM-1995-EtalleG

The Replacement Operation for CLP Modules (SE, MG), pp. 168–177.

PEPM-1995-Sands #higher-order

Higher Order Expression Procedures (DS), pp. 178–189.

PEPM-1995-LiuT

Caching Intermediate Results for Program Improvement (YAL, TT), pp. 190–201.

PEPM-1995-Colby #communication #concurrent #source code

Analyzing the Communication Topology of Concurrent Programs (CC), pp. 202–213.

PEPM-1995-Cridlig #analysis #concurrent #model checking #semantics #using

Semantic Analysis of Shared-Memory Concurrent Languages using Abstract Model-Checking (RC), pp. 214–225.

PEPM-1995-Deutsch #abstract interpretation #data type #induction #modelling #pointer #semantics

Semantic models and abstract interpretation techniques for inductive data structures and pointers (AD), pp. 226–229.

PEPM-1995-Doh #partial evaluation

Action Transformation by Partial Evaluation (KGD), pp. 230–240.

PEPM-1995-Lu #analysis #logic programming #source code

Type Analysis of Logic Programs in the Presence of Type Definitions (LL), pp. 241–252.

PEPM-1995-LeuschelS #partial evaluation #towards

Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters (ML, DDS), pp. 253–263.