Code

Shortest path search heuristic#5

Code

Open

polgreen wants to merge 10 commits intodiffblue:masterdiffblue/symex:masterfrom

polgreen:shortest_path_search_heuristicpolgreen/symex:shortest_path_search_heuristicCopy head branch name to clipboard

Commits

Commits on Feb 20, 2018

• Add eager infeasbility, dfs and bfs to symex help file

  polgreen

  committed
  8e3b347

  Copy full SHA for 8e3b347

• Introduce randomized DFS

  Show description for 117d6c0
  polgreen

  committed
  117d6c0

  Copy full SHA for 117d6c0

• Add distances to property as variable in locst

  Show description for 484e696
  polgreen

  committed
  484e696

  Copy full SHA for 484e696

• Shortest path grapht

  Show description for f904c23
  polgreen

  committed
  f904c23

  Copy full SHA for f904c23

• Per function shortest path graph

  Show description for 489e0c0
  polgreen

  committed
  489e0c0

  Copy full SHA for 489e0c0

• Output distances to property from every reachable program location

  polgreen

  committed
  fef1b6d

  Copy full SHA for fef1b6d

• access shortest path locst variable from path_symex_statet

  polgreen

  committed
  09e13a4

  Copy full SHA for 09e13a4

• Shortest path search heuristic

  Show description for d52227f
  polgreen

  committed
  d52227f

  Copy full SHA for d52227f

• Shortest path per function search heuristic

  Show description for e246a87
  polgreen

  committed
  e246a87

  Copy full SHA for e246a87

• Output search heuristic and initialisation time

  polgreen

  committed
  68e6eed

  Copy full SHA for 68e6eed