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

• 2014
• 
  Lukás Holík, Lorenzo Clemente:
  Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013. EPTCS 140, 2014 [contents]
• 2013
• 
  Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
  Zenoness for Timed Pushdown Automata. INFINITY 2013: 35-47
• 
  Yu-Fang Chen, Bow-Yaw Wang, Di-De Yen:
  A Finite Exact Representation of Register Automata Configurations. INFINITY 2013: 16-34
• 
  Gal Katz, Doron A. Peled:
  Synthesis of Parametric Programs using Genetic Programming and Model Checking. INFINITY 2013: 70-84
• 
  Oded Maler:
  Algorithmic Verification of Continuous and Hybrid Systems. INFINITY 2013: 48-69
• 
  Johann Schuster, Markus Siegle:
  Lattice structures for bisimilar Probabilistic Automata. INFINITY 2013: 1-15
• 2012
• 
  Arnaud Gotlieb, Tristan Denmat, Nadjib Lazaar:
  Constraint-based reachability. Infinity 2012: 25-43
• 
  Parosh Aziz Abdulla, Richard Mayr:
  Petri Nets with Time and Cost. Infinity 2012: 9-24
• 
  Aurel Randolph, Hanifa Boucheneb, Abdessamad Imine, Alejandro Quintero:
  On Consistency of Operational Transformation Approach. Infinity 2012: 45-59
• 
  Lukasz Fronc:
  Effective Marking Equivalence Checking in Systems with Dynamic Process Creation. Infinity 2012: 61-75
• 
  Mohamed Faouzi Atig, Ahmed Rezine:
  Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012. EPTCS 107, 2012 [contents]
• 2011
• 
  Doron A. Peled, Sven Schewe:
  Practical Distributed Control Synthesis. INFINITY 2011: 2-17
• 
  Alex Spelten, Wolfgang Thomas, Sarah Winter:
  Trees over Infinite Structures and Path Logics with Synchronization. INFINITY 2011: 20-34
• 
  Laurent Fribourg, Bertrand Revol, Romain Soulat:
  Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems. INFINITY 2011: 35-48
• 
  Alberto Ciaffaglione:
  A coinductive semantics of the Unlimited Register Machine. INFINITY 2011: 49-63
• 
  Christian Krause, Holger Giese:
  Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements. INFINITY 2011: 64-78
• 
  Takashi Tomita, Shigeki Hagihara, Naoki Yonezaki:
  A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking. INFINITY 2011: 79-93
• 
  Fang Yu, Chao Wang:
  Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, Taipei, Taiwan, 10th October 2011. EPTCS 73, 2011 [contents]
• 2010
• 
  Stéphane Demri:
  On Selective Unboundedness of VASS. INFINITY 2010: 1-15
• 
  Hanifa Boucheneb, Kamel Barkaoui:
  On interleaving in {P,A}-Time Petri nets with strong semantics. INFINITY 2010: 17-31
• 
  Oded Maler, Kim G. Larsen, Bruce H. Krogh:
  On Zone-Based Analysis of Duration Probabilistic Automata. INFINITY 2010: 33-46
• 
  Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers:
  A Decidable Characterization of a Graphical Pi-calculus with Iterators. INFINITY 2010: 47-61
• 
  Bernard Boigelot, Julien Brusten, Jean-François Degbomont:
  Implicit Real Vector Automata. INFINITY 2010: 63-76
• 
  Nathalie Bertrand, Christophe Morvan:
  Probabilistic regular graphs. INFINITY 2010: 77-90
• 
  Étienne André:
  IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata. INFINITY 2010: 91-99
• 
  Yu-Fang Chen, Ahmed Rezine:
  Proceedings 12th International Workshop on Verification of Infinite-State Systems, INFINITY 2010, Singapore, Singapore, 21st September 2010. EPTCS 39, 2010 [contents]
• 2009
• 
  Nguyen Van Tang:
  A Tighter Bound for the Determinization of Visibly Pushdown Automata. INFINITY 2009: 62-76
• 
  Laurent Fribourg, Étienne André:
  An Inverse Method for Policy-Iteration Based Algorithms. INFINITY 2009: 44-61
• 
  Bahareh Badban, Stefan Leue, Jan-Georg Smaus:
  Automated Predicate Abstraction for Real-Time Models. INFINITY 2009: 36-43
• 
  Christophe Morvan:
  On external presentations of infinite graphs. INFINITY 2009: 23-35

skipping 78 more matches