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

• 2020
• 
  Emanuele D'Osualdo, Felix Stutz:
  Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CONCUR 2020: 31:1-31:23
• 
  Ori Lahav, Udi Boker:
  Decidable verification under a causally consistent shared memory. PLDI 2020: 211-226
• 
  Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
  What's Decidable About Program Verification Modulo Axioms? TACAS (2) 2020: 158-177
• 2019
• 
  Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
  Decidable verification of uninterpreted programs. Proc. ACM Program. Lang. 3(POPL): 46:1-46:29 (2019)
• 
  Idan Berkovits, Marijana Lazic, Giuliano Losa, Oded Padon, Sharon Shoham:
  Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. CAV (2) 2019: 245-266
• 
  Gerhard Lakemeyer:
  Decidable Verification of Golog Programs: Situation Calculus Meets Description Logic. Description Logics 2019
• 
  Francesco Belardinelli, Vadim Malvone:
  Decidable Verification of Agent-Based Data-Aware Systems. PRIMA 2019: 52-68
• 
  Idan Berkovits, Marijana Lazic, Giuliano Losa, Oded Padon, Sharon Shoham:
  Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. CoRR abs/1905.07805 (2019)
• 
  Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
  What's Decidable About Program Verification Modulo Axioms? CoRR abs/1910.10889 (2019)
• 
  Emanuele D'Osualdo, Felix Stutz:
  Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CoRR abs/1911.05430 (2019)
• 2018
• 
  Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
  Decidable Verification of Multi-agent Systems with Bounded Private Actions. AAMAS 2018: 1865-1867
• 
  Kenneth L. McMillan, Oded Padon:
  Deductive Verification in Decidable Fragments with Ivy. SAS 2018: 43-55
• 
  Sharon Shoham:
  Interactive Verification of Distributed Protocols Using Decidable Logic. SAS 2018: 77-85
• 
  Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
  Decidable Verification of Uninterpreted Programs. CoRR abs/1811.00192 (2018)
• 2017
• 
  Jens Claßen, Benjamin Zarrieß:
  Decidable Verification of Decision-Theoretic Golog. FroCoS 2017: 227-243
• 2016
• 
  Benjamin Zarrieß, Jens Claßen:
  Decidable Verification of Golog Programs over Non-Local Effect Actions. AAAI 2016: 1109-1115
• 2015
• 
  Benjamin Zarrieß, Jens Claßen:
  Decidable Verification of Knowledge-Based Programs over Description Logic Actions with Sensing. Description Logics 2015
• 2014
• 
  Stefan Ratschan:
  Safety verification of non-linear hybrid systems is quasi-decidable. Formal Methods Syst. Des. 44(1): 71-90 (2014)
• 
  Jens Claßen, Martin Liebenberg, Gerhard Lakemeyer, Benjamin Zarrieß:
  Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs. AAAI 2014: 1012-1019
• 2012
• 
  Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi:
  Bounded Situation Calculus Action Theories and Decidable Verification. CogRob@AAAI 2012
• 
  Vijay Ganesh, Mia Minnes, Armando Solar-Lezama, Martin C. Rinard:
  Word Equations with Length Constraints: What's Decidable? Haifa Verification Conference 2012: 209-226
• 
  Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi:
  Bounded Situation Calculus Action Theories and Decidable Verification. KR 2012
• 2009
• 
  Nathaniel Charlton, Bernhard Reus:
  A decidable class of verification conditions for programs with higher order store. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009)
• 2002
• 
  Danièle Beauquier, Anatol Slissenko:
  Decidable verification for reducible timed automata specified in a first order logic with time. Theor. Comput. Sci. 275(1-2): 347-388 (2002)
• 2000
• 
  Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer:
  Conter Machines: Decidable Properties and Applications to Verification Problems. MFCS 2000: 426-435
• 1999
• 
  Danièle Beauquier, Anatol Slissenko:
  Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT 1999: 100-111