Searched refs:pc_true_hyp (Results 1 - 7 of 7) sorted by relevance

/seL4-l4v-master/graph-refine/
H A Dcheck.py9 from rep_graph import mk_graph_slice, Hyp, eq_hyp, pc_true_hyp, pc_false_hyp namespace
338 true_hyps = hyps + [pc_true_hyp (visit)]
428 l_enter = pc_true_hyp (l_visit)
499 init_check = [(hyps, pc_true_hyp (visit (min_vc)),
523 lpc_hyp = pc_true_hyp (l_visit)
543 hyps = ([err_hyp, pc_true_hyp (cont),
600 nhyps = [pc_true_hyp (reach)]
614 hyps = ([pc_true_hyp (cont)] + hyps
640 hyps = (hyps + [n_hyp, pc_true_hyp (cont), non_err]
657 hyps = (hyps + [pc_true_hyp (cur
[all...]
H A Dsearch.py806 vis_hyp = rep_graph.pc_true_hyp ((vis (n, l_start), l_tag))
819 path_hyps = [rep_graph.pc_true_hyp ((n_vc, l_tag)) for n_vc in n_vcs]
898 ex_hyps = [rep_graph.pc_true_hyp ((vis (n, 1), l_tag)),
899 rep_graph.pc_true_hyp ((vis (n, 2), l_tag))]
1244 hyps + [rep_graph.pc_true_hyp ((n_vc, tag)) for n_vc in n_vcs],
1322 mk_thyps = lambda n_vcs: [rep_graph.pc_true_hyp ((n_vc, tag))
H A Drep_graph.py285 def pc_true_hyp (vis): function
1249 pc = pc_true_hyp (call_vis)
H A Dtrace_refute.py195 return rep_graph.pc_true_hyp (get_vis (rep.p, n,
H A Dloop_bounds.py8 from rep_graph import vc_num, vc_offs, pc_true_hyp, Hyp, eq_hyp namespace
H A Ddebug.py848 hyp = rep_graph.pc_true_hyp (((n, restrs), tag))
H A Dstack_logic.py199 hyp = rep_graph.pc_true_hyp ((n_vc, p.node_tags[n][0]))

Completed in 57 milliseconds