<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05798927</id>
  <dt>a</dt>
  <an>05798927</an>
  <augroup>
    <au>Veanes, Margus</au>
    <au>Bj{\o}rner, Nikolaj</au>
    <au>de Moura, Leonardo</au>
  </augroup>
  <ti>Symbolic automata constraint solving.</ti>
  <so>Ferm\"uller, Christian G. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 17th international conference, LPAR-17, Yogyakarta, Indonesia, October 10--15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16241-1/pbk). Lecture Notes in Computer Science 6397, 640-654 (2010).</so>
  <py>2010</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-16242-8_45</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Constraints over regular and context-free languages are common in the context of string-manipulating programs. Efficient solving of such constraints, often in combination with arithmetic and other theories, has many useful applications in program analysis and testing. We introduce and evaluate a method for symbolically expressing and solving constraints over automata, including subset constraints. Our method uses techniques present in the state-of-the-art SMT solver Z3.</ab>
    <rv></rv>
  </abgroup>
</item>