Open AccessUsing SMT Solving for the Lookup of Infeasible Paths in Binary Programs
Author(s) -
Jordy Ruiz,
Hugues Cassé
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , static analysis , modulo , satisfiability , worst case execution time , key (lock) , parallel computing , component (thermodynamics) , binary number , set (abstract data type) , satisfiability modulo theories , code (set theory) , binary decision diagram , algorithm , theoretical computer science , programming language , execution time , arithmetic , operating system , mathematics , physics , combinatorics , thermodynamics
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom