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

• 2018
• 
  Francesca Scozzari:
  Seventh Workshop on Numericaland Symbolic Abstract Domains, NSAD@SAS 2017, New York City, NY, USA, August 29, 2017. Electronic Notes in Theoretical Computer Science 334, Elsevier 2018 [contents]
• 2017
• 
  Gianluca Amato, Marco Rubino:
  Experimental Evaluation of Numerical Domains for Inferring Ranges. NSAD@SAS 2017: 3-16
• 
  Jacob Lidman, Josef Svenningsson:
  Fuzzy Set Abstraction. NSAD@SAS 2017: 17-29
• 
  Francesca Scozzari:
  Preface. NSAD@SAS 2017: 1-2
• 
  Enea Zaffanella:
  On the Efficiency of Convex Polyhedra. NSAD@SAS 2017: 31-44
• 
  Isabella Mastroeni:
  Proceedings of the Sixth Workshop on Numerical and Symbolic Abstract Domains, NSAD@SAS 2016, Edinburgh, UK, September 11, 2016. Electronic Notes in Theoretical Computer Science 331, Elsevier 2017 [contents]
• 2016
• 
  Vincenzo Arceri, Sergio Maffeis:
  Abstract Domains for Type Juggling. NSAD@SAS 2016: 41-55
• 
  Jacques-Henri Jourdan:
  Sparsity Preserving Algorithms for Octagons. NSAD@SAS 2016: 57-70
• 
  Isabella Mastroeni:
  Preface. NSAD@SAS 2016: 1-2
• 
  Antoine Miné:
  Static Analysis of Embedded Real-Time Concurrent Software with Dynamic Priorities. NSAD@SAS 2016: 3-39
• 
  Mila Dalla Preda, Michele Pasqua:
  Software Watermarking: A Semantics-based Approach. NSAD@SAS 2016: 71-85
• 
  Mila Dalla Preda, Vanessa Vidali:
  Abstract Similarity Analysis. NSAD@SAS 2016: 87-99
• 2014
• 
  Gianluca Amato, Francesca Scozzari, Enea Zaffanella:
  Efficient Constraint/Generator Removal from Double Description of Polyhedra. NSAD 2014: 3-15
• 
  Vivien Maisonneuve, Olivier Hermant, François Irigoin:
  Computing Invariants with Transformers: Experimental Scalability and Accuracy. NSAD 2014: 17-31
• 
  Axel Simon, Arnaud Venet:
  Preface. NSAD 2014: 1-2
• 
  Xueguang Wu, Liqian Chen, Ji Wang:
  An Abstract Domain to Infer Symbolic Ranges over Nonnegative Parameters. NSAD 2014: 33-45
• 
  Axel Simon, Arnaud Venet:
  Fifth International Workshop on Numerical and Symbolic Abstract Domains, NSAD@SAS 2014, Munich, Germany, September 10, 2014. Electronic Notes in Theoretical Computer Science 307, Elsevier 2014 [contents]
• 2012
• 
  Gianluca Amato, Francesca Scozzari:
  The Abstract Domain of Parallelotopes. NSAD@SAS 2012: 17-28
• 
  Eva Beckschulze, Stefan Kowalewski, Jörg Brauer:
  Access-Based Localization for Octagons. NSAD@SAS 2012: 29-40
• 
  Mehdi Bouaziz:
  TreeKs: A Functor to Make Numerical Abstract Domains Scalable. NSAD@SAS 2012: 41-52
• 
  Jedrzej Fulara:
  Generic Abstraction of Dictionaries and Arrays. NSAD@SAS 2012: 53-64
• 
  Eric Goubault, Tristan Le Gall, Sylvie Putot:
  An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations. NSAD@SAS 2012: 65-76
• 
  Matthieu Martel:
  Accurate Evaluation of Arithmetic Expressions (Invited Talk). NSAD@SAS 2012: 3-16
• 
  Damien Massé:
  Proving Termination by Policy Iteration. NSAD@SAS 2012: 77-88
• 
  Jan Midtgaard, Matthew Might:
  Preface. NSAD@SAS 2012: 1
• 
  Antoine Miné:
  Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations. NSAD@SAS 2012: 89-100
• 
  Damien Massé, Laurent Mauborgne:
  Proceedings of the Third International Workshop on Numerical and Symbolic Abstract Domains, NSAD@SAS 2011, Venice, Italy, September 13, 2011. Electronic Notes in Theoretical Computer Science 288, Elsevier 2012 [contents]
• 
  Jan Midtgaard, Matthew Might:
  Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, NSAD@SAS 2012, Deauville, France, September 10, 2012. Electronic Notes in Theoretical Computer Science 287, Elsevier 2012 [contents]
• 2011
• 
  Stefan Bygde, Björn Lisper, Niklas Holsti:
  Fully Bounded Polyhedral Analysis of Integers with Wrapping. NSAD@SAS 2011: 3-13
• 
  Manuel Fähndrich, Francesco Logozzo:
  Checking Compatibility of Bit Sizes in Floating Point Comparison Operations. NSAD@SAS 2011: 15-23

skipping 19 more matches