Infeasible Path Detection : a Formal Model and an Algorithm
Le test boîte blanche basé sur les chemins est largement utilisé pour la validation de programmes. A partir du graphe de flot de contrôle (CFG) du programme sous test, les cas de test sont générés en sélectionnant des chemins d'intérêt, puis en essayant de fournir, pour chaque chemin, des valeu...
Main Author: | Aïssat, Romain |
---|---|
Other Authors: | Paris Saclay |
Language: | en |
Published: |
2017
|
Subjects: | |
Online Access: | http://www.theses.fr/2017SACLS036/document |
Similar Items
-
Formal Approaches for Automatic Deobfuscation and Reverse-engineering of Protected Codes
by: David, Robin
Published: (2017) -
An Approach for Detecting Infeasible Paths Based on a SMT Solver
by: Shujuan Jiang, et al.
Published: (2019-01-01) -
Detecting Interprocedural Infeasible Paths Based on Unsatisfiable Path Constraint Patterns
by: Honglei Zhu, et al.
Published: (2019-01-01) -
A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems
by: Soodabeh Asadi, et al.
Published: (2014-03-01) -
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
by: Asadi S., et al.
Published: (2015-01-01)