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

• 2021
• 
  Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida:
  CONCUR Test-Of-Time Award 2021 (Invited Paper). CONCUR 2021: 1:1-1:3
• 
  Simon Foster, Chung-Kil Hur, Jim Woodcock:
  Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL. CONCUR 2021: 20:1-20:18
• 
  Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris:
  Separating Sessions Smoothly. CONCUR 2021: 36:1-36:18
• 
  Nathalie Bertrand, Bastien Thomas, Josef Widder:
  Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. CONCUR 2021: 15:1-15:17
• 
  Ming Xu, Jingyi Mei, Ji Guan, Nengkun Yu:
  Model Checking Quantum Continuous-Time Markov Chains. CONCUR 2021: 13:1-13:17
• 
  Michal Ajdarów, Antonín Kucera:
  Deciding Polynomial Termination Complexity for VASS Programs. CONCUR 2021: 30:1-30:15
• 
  Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
  The Orbit Problem for Parametric Linear Dynamical Systems. CONCUR 2021: 28:1-28:17
• 
  Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi:
  Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CONCUR 2021: 34:1-34:22
• 
  Mrudula Balachander, Shibashis Guha, Jean-François Raskin:
  Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. CONCUR 2021: 9:1-9:17
• 
  A. R. Balasubramanian, K. S. Thejaswini:
  Adaptive Synchronisation of Pushdown Automata. CONCUR 2021: 17:1-17:15
• 
  Raven Beutner, Bernd Finkbeiner:
  A Temporal Logic for Strategic Hyperproperties. CONCUR 2021: 24:1-24:19
• 
  Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh:
  A Unifying Framework for Deciding Synchronizability. CONCUR 2021: 14:1-14:18
• 
  Michele Boreale, Daniele Gorla:
  Algebra and Coalgebra of Stream Products. CONCUR 2021: 19:1-19:17
• 
  Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
  Arena-Independent Finite-Memory Determinacy in Stochastic Games. CONCUR 2021: 26:1-26:18
• 
  Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
  Subgame-Perfect Equilibria in Mean-Payoff Games. CONCUR 2021: 8:1-8:17
• 
  Florian Bruse, Martin Lange:
  A Decidable Non-Regular Modal Fixpoint Logic. CONCUR 2021: 23:1-23:18
• 
  Véronique Bruyère, Jean-François Raskin, Clément Tamines:
  Stackelberg-Pareto Synthesis. CONCUR 2021: 27:1-27:17
• 
  Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato:
  Inclusion Testing of Büchi Automata Based on Well-Quasiorders. CONCUR 2021: 3:1-3:22
• 
  Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger:
  Enforcing ω-Regular Properties in Markov Chains by Restarting. CONCUR 2021: 5:1-5:22
• 
  Rob van Glabbeek, Peter Höfner, Weiyou Wang:
  Enabling Preserving Bisimulation Equivalence. CONCUR 2021: 33:1-33:20
• 
  Jan Friso Groote, Jan Martens, Erik P. de Vink:
  Bisimulation by Partitioning Is Ω((m+n)log n). CONCUR 2021: 31:1-31:16
• 
  Vojtech Havlena, Ondrej Lengál:
  Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. CONCUR 2021: 2:1-2:19
• 
  Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf:
  Decomposing Permutation Automata. CONCUR 2021: 18:1-18:19
• 
  Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
  Transience in Countable MDPs. CONCUR 2021: 11:1-11:15
• 
  Stefan Kiefer, Pavel Semukhin, Cas Widdershoven:
  Linear-Time Model Checking Branching Processes. CONCUR 2021: 6:1-6:16
• 
  Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata:
  Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down. CONCUR 2021: 21:1-21:22
• 
  Alexander Kozachinskiy:
  Continuous Positional Payoffs. CONCUR 2021: 10:1-10:17
• 
  Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis:
  Dynamic Data-Race Detection Through the Fine-Grained Lens. CONCUR 2021: 16:1-16:23
• 
  James C. A. Main, Mickael Randour, Jeremy Sproston:
  Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CONCUR 2021: 25:1-25:16
• 
  Rupak Majumdar, Madhavan Mukund, Felix Stutz, Damien Zufferey:
  Generalising Projection in Asynchronous Multiparty Session Types. CONCUR 2021: 35:1-35:24

skipping 8 more matches