• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 25 matches

• 1995
• 
  Christopher Colby:
  Analyzing the Communication Topology of Concurrent Programs. PEPM 1995: 202-213
• 
  Régis Cridlig:
  Semantic Analysis of Shared-Memory Concurrent Languages using Abstract Model-Checking. PEPM 1995: 214-225
• 
  Manuvir Das, Thomas W. Reps, Pascal Van Hentenryck:
  Semantic Foundations of Binding Time Analysis for Imperative Programs. PEPM 1995: 100-110
• 
  Saumya K. Debray:
  Abstract Interpretation and Low-Level Code Optimization. PEPM 1995: 111-121
• 
  Alain Deutsch:
  Semantic models and abstract interpretation techniques for inductive data structures and pointers. PEPM 1995: 226-229
• 
  Kyung-Goo Doh:
  Action Transformation by Partial Evaluation. PEPM 1995: 230-240
• 
  Dirk Dussart, Eddy Bevers, Karel De Vlaminck:
  Polyvariant Constructor Specialisation. PEPM 1995: 54-65
• 
  Sandro Etalle, Maurizio Gabbrielli:
  The Replacement Operation for CLP Modules. PEPM 1995: 168-177
• 
  Eric Goubault:
  Schedulers as Abstract Interpreter of Higher Dimensional Automata. PEPM 1995: 134-145
• 
  Thomas P. Jensen:
  Clock Analysis of Synchronous Dataflow Programs. PEPM 1995: 156-167
• 
  Neil D. Jones:
  Special Address: MIX ten years after. PEPM 1995: 24-38
• 
  Michael Leuschel, Danny De Schreye:
  Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. PEPM 1995: 253-263
• 
  Yanhong A. Liu, Tim Teitelbaum:
  Caching Intermediate Results for Program Improvement. PEPM 1995: 190-201
• 
  Lunjin Lu:
  Type Analysis of Logic Programs in the Presence of Type Definitions. PEPM 1995: 241-252
• 
  Karoline Malmkjær, Peter Ørbæk:
  Polyvariant Specialisation for Higher-Order, Block-Structured Languages. PEPM 1995: 66-76
• 
  Daniel Le Métayer:
  Proving Properties of Programs Defined over Recursive Data Structures. PEPM 1995: 88-99
• 
  Torben Æ. Mogensen:
  Self-applicable Online Partial Evaluation of Pure Lambda Calculus. PEPM 1995: 39-44
• 
  Bruno Monsuez:
  Using Abstract Interpretation to Define a Strictness Type Inference System. PEPM 1995: 122-133
• 
  Germán Puebla, Manuel V. Hermenegildo:
  Implementation of Multiple Specialization in Logic Programs. PEPM 1995: 77-87
• 
  C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar:
  A Symbolic Constraint Solving Framework for Analysis of Logic Programs. PEPM 1995: 12-23
• 
  Thomas W. Reps:
  Shape Analysis as a Generalized Path Problem. PEPM 1995: 1-11
• 
  David Sands:
  Higher Order Expression Procedures. PEPM 1995: 178-189
• 
  Michael Sperber, Peter Thiemann:
  The Essence of LR Parsing. PEPM 1995: 146-155
• 
  Yan Mei Tang, Pierre Jouvelot:
  Effect Systems with Subtyping. PEPM 1995: 45-53
• 
  Neil D. Jones:
  Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, USA, June 21-23, 1995. ACM Press 1995, ISBN 0-89791-720-0 [contents]