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

• 2009
• 
  Martín Abadi, Gordon D. Plotkin:
  A model of cooperative threads. POPL 2009: 29-40
• 
  Amal Ahmed, Derek Dreyer, Andreas Rossberg:
  State-dependent representation independence. POPL 2009: 340-353
• 
  Chris Barker:
  Wild control operators. POPL 2009: 152
• 
  Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin:
  Formal certification of code-based cryptographic proofs. POPL 2009: 90-101
• 
  Gérard Boudol, Gustavo Petri:
  Relaxed memory models: an operational approach. POPL 2009: 392-403
• 
  Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun:
  Feedback-directed barrier optimization in a strongly isolated STM. POPL 2009: 213-225
• 
  James Brotherston, Cristiano Calcagno:
  Classical BI: a logic for reasoning about dualising resources. POPL 2009: 328-339
• 
  Julien Brunel, Damien Doligez, René Rydhof Hansen, Julia L. Lawall, Gilles Muller:
  A foundation for flow-based program matching: using temporal logic and model checking. POPL 2009: 114-126
• 
  Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
  Compositional shape analysis by means of bi-abduction. POPL 2009: 289-300
• 
  Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, Shaz Qadeer:
  Unifying type checking and property checking for low-level code. POPL 2009: 302-314
• 
  Tayfun Elmas, Shaz Qadeer, Serdar Tasiran:
  A calculus of atomic actions. POPL 2009: 2-15
• 
  Xinyu Feng:
  Local rely-guarantee reasoning. POPL 2009: 315-327
• 
  Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko:
  Verifying liveness for asynchronous programs. POPL 2009: 102-113
• 
  Ronald Garcia, Andrew Lumsdaine, Amr Sabry:
  Lazy evaluation and delimited control. POPL 2009: 153-164
• 
  Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis:
  Proving that non-blocking algorithms don't block. POPL 2009: 16-28
• 
  Rachid Guerraoui, Michal Kapalka:
  The semantics of progress in lock-based transactional memory. POPL 2009: 404-415
• 
  Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv:
  A combination framework for tracking partition sizes. POPL 2009: 239-251
• 
  Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi:
  SPEED: precise and efficient static estimation of program computational complexity. POPL 2009: 127-139
• 
  Ben Hardekopf, Calvin Lin:
  Semi-sparse flow-sensitive pointer analysis. POPL 2009: 226-238
• 
  Tim Harris:
  Language constructs for transactional memory. POPL 2009: 1
• 
  Chris Hawblitzel, Erez Petrank:
  Automated verification of practical garbage collectors. POPL 2009: 441-453
• 
  Peter A. Jonsson, Johan Nordlander:
  Positive supercompilation for a higher order call-by-value language. POPL 2009: 277-288
• 
  Naoki Kobayashi:
  Types and higher-order recursion schemes for verification of higher-order programs. POPL 2009: 416-428
• 
  Neelakantan R. Krishnaswami:
  Focusing on pattern matching. POPL 2009: 366-378
• 
  Daan Leijen:
  Flexible types: robust type inference for first-class polymorphism. POPL 2009: 66-77
• 
  Ruy Ley-Wild, Umut A. Acar, Matthew Fluet:
  A cost semantics for self-adjusting computation. POPL 2009: 186-199
• 
  Roberto Lublinerman, Christian Szegedy, Stavros Tripakis:
  Modular code generation from synchronous block diagrams: modularity vs. code size. POPL 2009: 78-89
• 
  David Monniaux:
  Automatic modular abstractions for linear constraints. POPL 2009: 140-151
• 
  Benoît Montagu, Didier Rémy:
  Modeling abstract types in modules with open existential types. POPL 2009: 354-365
• 
  Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
  The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. POPL 2009: 177-185

skipping 10 more matches