Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types (bibtex)

Reference:

Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types (), In CoRR, volume abs/1306.5264, 2013.

Bibtex Entry:

@article{DBLP:journals/corr/BjornerMR13,
  author    = {Nikolaj Bj{\o}rner and
               Kenneth L. McMillan and
               Andrey Rybalchenko},
  title     = {Higher-order Program Verification as Satisfiability Modulo Theories
               with Algebraic Data-types},
  journal   = {CoRR},
  volume    = {abs/1306.5264},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.5264},
  archivePrefix = {arXiv},
  eprint    = {1306.5264},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BjornerMR13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}