Using SMT Solving for the Lookup of Infeasible Paths in Binary Programs

Jordy Ruiz, Hugues Cassé. Using SMT Solving for the Lookup of Infeasible Paths in Binary Programs. In Francisco J. Cazorla, editor, 15th International Workshop on Worst-Case Execution Time Analysis, WCET 2015, July 7, 2015, Lund, Sweden. Volume 47 of OASICS, pages 95-104, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

@inproceedings{RuizC15-0,
  title = {Using SMT Solving for the Lookup of Infeasible Paths in Binary Programs},
  author = {Jordy Ruiz and Hugues Cassé},
  year = {2015},
  doi = {10.4230/OASIcs.WCET.2015.95},
  url = {http://dx.doi.org/10.4230/OASIcs.WCET.2015.95},
  researchr = {https://researchr.org/publication/RuizC15-0},
  cites = {0},
  citedby = {0},
  pages = {95-104},
  booktitle = {15th International Workshop on Worst-Case Execution Time Analysis, WCET 2015, July 7, 2015, Lund, Sweden},
  editor = {Francisco J. Cazorla},
  volume = {47},
  series = {OASICS},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-95-8},
}