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

• 2024
• 
  Jialu Bao, Emanuele D'Osualdo, Azadeh Farzan:
  Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning. CoRR abs/2402.18708 (2024)
• 2023
• 
  Emanuele D'Osualdo, Azalea Raad, Viktor Vafeiadis:
  The Path to Durable Linearizability. Proc. ACM Program. Lang. 7(POPL): 748-774 (2023)
• 
  Michael Sammler, Simon Spies, Youngju Song, Emanuele D'Osualdo, Robbert Krebbers, Deepak Garg, Derek Dreyer:
  DimSum: A Decentralized Approach to Multi-language Semantics and Verification. Proc. ACM Program. Lang. 7(POPL): 775-805 (2023)
• 2022
• 
  Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
  Proving hypersafety compositionally. Proc. ACM Program. Lang. 6(OOPSLA2): 289-314 (2022)
• 
  Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez:
  A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency. Proc. ACM Program. Lang. 6(OOPSLA2): 841-869 (2022)
• 
  Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez:
  A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency. CoRR abs/2209.05421 (2022)
• 
  Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
  Proving Hypersafety Compositionally. CoRR abs/2209.07448 (2022)
• 
  Emanuele D'Osualdo, Azalea Raad, Viktor Vafeiadis:
  The Path to Durable Linearizability. CoRR abs/2211.07631 (2022)
• 2021
• 
  Emanuele D'Osualdo, Julian Sutherland, Azadeh Farzan, Philippa Gardner:
  TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. ACM Trans. Program. Lang. Syst. 43(4): 16:1-16:134 (2021)
• 2020
• 
  Emanuele D'Osualdo, Felix Stutz:
  Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CONCUR 2020: 31:1-31:23
• 2019
• 
  Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner, Julian Sutherland:
  TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. CoRR abs/1901.05750 (2019)
• 
  Emanuele D'Osualdo, Felix Stutz:
  Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CoRR abs/1911.05430 (2019)
• 2017
• 
  Emanuele D'Osualdo, Luke Ong, Alwen Tiu:
  Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of Depth-Bounded Processes. CSF 2017: 464-480
• 2016
• 
  Emanuele D'Osualdo, C.-H. Luke Ong:
  On Hierarchical Communication Topologies in the \pi -calculus. ESOP 2016: 149-175
• 
  Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche:
  First-order logic with reachability for infinite-state systems. LICS 2016: 457-466
• 
  Emanuele D'Osualdo, C.-H. Luke Ong:
  On Hierarchical Communication Topologies in the pi-calculus. CoRR abs/1601.01725 (2016)
• 2015
• 
  Emanuele D'Osualdo:
  Verification of message passing concurrent systems. University of Oxford, UK, 2015
• 
  Emanuele D'Osualdo, Luke Ong:
  A Type System for proving Depth Boundedness in the pi-calculus. CoRR abs/1502.00944 (2015)
• 2013
• 
  Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong:
  Automatic Verification of Erlang-Style Concurrency. SAS 2013: 454-476
• 
  Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong:
  Automatic Verification of Erlang-Style Concurrency. CoRR abs/1303.2201 (2013)
• 2012
• 
  Emanuele D'Osualdo, Jonathan Kochems, Luke Ong:
  Soter: an automatic safety verifier for erlang. AGERE!@SPLASH 2012: 137-140