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

• 2018
• 
  Stéphane Le Roux, Guillermo A. Pérez:
  The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. FoSSaCS 2018: 367-383
• 
  Sergey Goncharov, Lutz Schröder:
  Guarded Traced Categories. FoSSaCS 2018: 313-330
• 
  Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir:
  A Framework for Parameterized Monitorability. FoSSaCS 2018: 203-220
• 
  Thorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, Fredrik Nordvall Forsberg:
  Quotient Inductive-Inductive Types. FoSSaCS 2018: 293-310
• 
  Paolo Baldan, Tommaso Padoan:
  Automata for True Concurrency Properties. FoSSaCS 2018: 165-182
• 
  Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi:
  Comparator Automata in Quantitative Verification. FoSSaCS 2018: 420-437
• 
  Hugo Bazille, Eric Fabre, Blaise Genest:
  Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings. FoSSaCS 2018: 403-419
• 
  Patricia Bouyer:
  Games on Graphs with a Public Signal Monitoring. FoSSaCS 2018: 530-547
• 
  Marco Devesas Campos, Paul Blain Levy:
  A Syntactic View of Computational Adequacy. FoSSaCS 2018: 71-87
• 
  Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel:
  Non-angelic Concurrent Game Semantics. FoSSaCS 2018: 3-19
• 
  Ranald Clouston:
  Fitch-Style Modal Lambda Calculi. FoSSaCS 2018: 258-275
• 
  Pedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards:
  A Hierarchy of Scheduler Classes for Stochastic Automata. FoSSaCS 2018: 384-402
• 
  Ornela Dardha, Simon J. Gay:
  A New Linear Logic for Deadlock-Free Session-Typed Processes. FoSSaCS 2018: 91-109
• 
  Stéphane Demri, Étienne Lozes, Alessio Mansutti:
  The Effects of Adding Reachability Predicates in Propositional Separation Logic. FoSSaCS 2018: 476-493
• 
  Simon Docherty, David J. Pym:
  Modular Tableaux Calculi for Separation Theories. FoSSaCS 2018: 441-458
• 
  Abbas Edalat, Mehrdad Maleki:
  Differential Calculus with Imprecise Input and Its Logical Framework. FoSSaCS 2018: 459-475
• 
  Thomas Genet, Timothée Haudebourg, Thomas P. Jensen:
  Verifying Higher-Order Functions with Tree Automata. FoSSaCS 2018: 565-582
• 
  Rob van Glabbeek:
  A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract). FoSSaCS 2018: 183-202
• 
  Guilhem Jaber, Nikos Tzevelekos:
  A Trace Semantics for System F Parametric Polymorphism. FoSSaCS 2018: 20-38
• 
  Clément Jacq, Paul-André Melliès:
  Categorical Combinatorics for Non Deterministic Strategies on Simple Games. FoSSaCS 2018: 39-70
• 
  Shin-ya Katsumata:
  A Double Category Theoretic Analysis of Graded Linear Exponential Comonads. FoSSaCS 2018: 110-127
• 
  Delia Kesner, Alejandro Ríos, Andrés Viso:
  Call-by-Need, Neededness and All That. FoSSaCS 2018: 241-257
• 
  Slawomir Lasota, Radoslaw Piórkowski:
  WQO Dichotomy for 3-Graphs. FoSSaCS 2018: 548-564
• 
  Xinxin Liu, Tingting Yu, Wenhui Zhang:
  Logics for Bisimulation and Divergence. FoSSaCS 2018: 221-237
• 
  Étienne Miquey, Hugo Herbelin:
  Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with Control. FoSSaCS 2018: 276-292
• 
  Guillaume Rabusseau:
  Minimization of Graph Weighted Models over Circular Strings. FoSSaCS 2018: 513-529
• 
  Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto:
  From Symmetric Pattern-Matching to Quantum Control. FoSSaCS 2018: 348-364
• 
  Luigi Santocanale:
  The Equational Theory of the Natural Join and Inner Union is Decidable. FoSSaCS 2018: 494-510
• 
  Gabriel Scherer, Max S. New, Nick Rioux, Amal Ahmed:
  Fab ous Interoperability for ML and a Linear Language. FoSSaCS 2018: 146-162
• 
  Ana Sokolova, Harald Woracek:
  Proper Semirings and Proper Convex Functors. FoSSaCS 2018: 331-347

skipping 2 more matches