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

• 2018
• 
  Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
  Realizability of concurrent recursive programs. Formal Methods Syst. Des. 53(3): 339-362 (2018)
• 
  Rémy Boutonnet, Nicolas Halbwachs:
  Improving the results of program analysis by abstract interpretation beyond the decreasing sequence. Formal Methods Syst. Des. 53(3): 384-406 (2018)
• 
  Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg:
  An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods Syst. Des. 53(3): 363-383 (2018)
• 
  Chaoqiang Deng, Kedar S. Namjoshi:
  Securing a compiler transformation. Formal Methods Syst. Des. 53(2): 166-188 (2018)
• 
  Yliès Falcone, César Sánchez:
  Introduction to the special issue on runtime verification. Formal Methods Syst. Des. 53(1): 1-5 (2018)
• 
  Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
  Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. 53(2): 313-338 (2018)
• 
  Jean Goubault-Larrecq, Jean-Philippe Lachance:
  On the complexity of monitoring Orchids signatures, and recurrence equations. Formal Methods Syst. Des. 53(1): 6-32 (2018)
• 
  Kihong Heo, Hakjoo Oh, Hongseok Yang:
  Learning analysis strategies for octagon and context sensitivity from labeled data generated by static analyses. Formal Methods Syst. Des. 53(2): 189-220 (2018)
• 
  Stefan Jaksic, Ezio Bartocci, Radu Grosu, Thang Nguyen, Dejan Nickovic:
  Quantitative monitoring of STL with edit distance. Formal Methods Syst. Des. 53(1): 83-112 (2018)
• 
  Matthieu Journault, Antoine Miné:
  Inferring functional properties of matrix manipulating programs by abstract interpretation. Formal Methods Syst. Des. 53(2): 221-258 (2018)
• 
  Sean Kauffman, Klaus Havelund, Rajeev Joshi, Sebastian Fischmeister:
  Inferring event stream abstractions. Formal Methods Syst. Des. 53(1): 54-82 (2018)
• 
  Hernán Ponce de León, Andrey Mokhov:
  Compact and efficiently verifiable models for concurrent systems. Formal Methods Syst. Des. 53(3): 407-431 (2018)
• 
  Carlos Moreno, Sebastian Fischmeister:
  Non-intrusive runtime monitoring through power consumption to enforce safety and security properties in embedded systems. Formal Methods Syst. Des. 53(1): 113-137 (2018)
• 
  Francesco Ranzato:
  Abstracting Nash equilibria of supermodular games. Formal Methods Syst. Des. 53(2): 259-285 (2018)
• 
  Xavier Rival:
  Foreword. Formal Methods Syst. Des. 53(2): 165 (2018)
• 
  Grigore Rosu:
  Finite-trace linear temporal logic: coinductive completeness. Formal Methods Syst. Des. 53(1): 138-163 (2018)
• 
  Pierre Roux, Yuen-Lam Voronin, Sriram Sankaranarayanan:
  Validating numerical semidefinite programming solvers for polynomial invariants. Formal Methods Syst. Des. 53(2): 286-312 (2018)
• 
  Jinghao Shi, Shuvendu K. Lahiri, Ranveer Chandra, Geoffrey Challen:
  Wireless protocol validation under uncertainty. Formal Methods Syst. Des. 53(1): 33-53 (2018)