• 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 29 matches

• 2001
• 
  Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen:
  What Are Polymorphically-Typed Ambients? ESOP 2001: 206-220
• 
  Roland Carl Backhouse:
  Fusion on Languages. ESOP 2001: 107-121
• 
  Gilles Barthe, Guillaume Dufay, Line Jakubiec, Bernard P. Serpette, Simão Melo de Sousa:
  A Formal Executable Semantics of the JavaCard Platform. ESOP 2001: 302-319
• 
  Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
  Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. ESOP 2001: 402-416
• 
  Gérard Boudol:
  The Recursive Record Semantics of Objects Revisited. ESOP 2001: 269-283
• 
  Marco Cadoli, Andrea Schaerf:
  Compiling Problem Specifications into SAT. ESOP 2001: 387-401
• 
  Luca Cardelli, Giorgio Ghelli:
  A Query Language Based on the Ambient Logic. ESOP 2001: 1-22
• 
  John Clements, Matthew Flatt, Matthias Felleisen:
  Modeling an Algebraic Stepper. ESOP 2001: 320-334
• 
  Sylvain Conchon, François Pottier:
  JOIN(X): Constraint-Based Type Inference for the Join-Calculus. ESOP 2001: 221-236
• 
  Pascal Cuoq, Marc Pouzet:
  Modular Causality in a Synchronous Stream Language. ESOP 2001: 237-251
• 
  Samir Genaim, Michael Codish:
  The Def-inite Approach to Dependency Analysis. ESOP 2001: 417-432
• 
  Paul T. Graunke, Shriram Krishnamurthi, Steve Van Der Hoeven, Matthias Felleisen:
  Programming the Web with High-Level Programming Languages. ESOP 2001: 122-136
• 
  Michael Huth, Radha Jagadeesan, David A. Schmidt:
  Modal Transition Systems: A Foundation for Three-Valued Program Analysis. ESOP 2001: 155-169
• 
  Bart Jacobs:
  A Formalisation of Java's Exception Mechanism. ESOP 2001: 284-301
• 
  Shin-ya Katsumata, Atsushi Ohori:
  Proof-Directed De-compilation of Low-Level Code. ESOP 2001: 352-366
• 
  Raghavan Komondoor, Susan Horwitz:
  Tool Demonstration: Finding Duplicated Code Using Program Dependences. ESOP 2001: 383-386
• 
  Peeter Laud:
  Semantics and Program Analysis of Computationally Secure Information Flow. ESOP 2001: 77-91
• 
  John C. Mitchell:
  Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis. ESOP 2001: 23-29
• 
  David Monniaux:
  Backwards Abstract Interpretation of Probabilistic Programs. ESOP 2001: 367-382
• 
  Markus Müller-Olm, Oliver Rüthing:
  On the Complexity of Constant Propagation. ESOP 2001: 190-205
• 
  Flemming Nielson, Helmut Seidl:
  Control-Flow Analysis in Cubic Time. ESOP 2001: 252-268
• 
  François Pottier, Christian Skalka, Scott F. Smith:
  A Systematic Approach to Static Access Control. ESOP 2001: 30-45
• 
  Francesco Ranzato:
  On the Completeness of Model Checking. ESOP 2001: 137-154
• 
  Zhendong Su, Alexander Aiken:
  Entailment with Conditional Equality Constraints. ESOP 2001: 170-189
• 
  Peter Thiemann:
  Enforcing Safety Properties Using Type Specialization. ESOP 2001: 62-76
• 
  Stephanie Weirich:
  Encoding Intensional Type Analysis. ESOP 2001: 92-106
• 
  Zhichen Xu, Thomas W. Reps, Barton P. Miller:
  Typestate Checking of Machine Code. ESOP 2001: 335-351
• 
  Steve Zdancewic, Andrew C. Myers:
  Secure Information Flow and CPS. ESOP 2001: 46-61
• 
  David Sands:
  Programming Languages and Systems, 10th European Symposium on Programming, ESOP 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings. Lecture Notes in Computer Science 2028, Springer 2001, ISBN 3-540-41862-8 [contents]