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

/seL4-l4v-10.1.1/graph-refine/
H A Dcheck.py11 from rep_graph import mk_graph_slice, Hyp, eq_hyp, pc_true_hyp, pc_false_hyp namespace
340 true_hyps = hyps + [pc_true_hyp (visit)]
430 l_enter = pc_true_hyp (l_visit)
501 init_check = [(hyps, pc_true_hyp (visit (min_vc)),
525 lpc_hyp = pc_true_hyp (l_visit)
545 hyps = ([err_hyp, pc_true_hyp (cont),
602 nhyps = [pc_true_hyp (reach)]
616 hyps = ([pc_true_hyp (cont)] + hyps
642 hyps = (hyps + [n_hyp, pc_true_hyp (cont), non_err]
659 hyps = (hyps + [pc_true_hyp (cur
[all...]
H A Ddebug.py850 hyp = rep_graph.pc_true_hyp (((n, restrs), tag))
H A Dloop_bounds.py2 from rep_graph import vc_num, vc_offs, pc_true_hyp, Hyp, eq_hyp namespace
H A Drep_graph.py287 def pc_true_hyp (vis): function
1251 pc = pc_true_hyp (call_vis)
H A Dsearch.py808 vis_hyp = rep_graph.pc_true_hyp ((vis (n, l_start), l_tag))
821 path_hyps = [rep_graph.pc_true_hyp ((n_vc, l_tag)) for n_vc in n_vcs]
900 ex_hyps = [rep_graph.pc_true_hyp ((vis (n, 1), l_tag)),
901 rep_graph.pc_true_hyp ((vis (n, 2), l_tag))]
1246 hyps + [rep_graph.pc_true_hyp ((n_vc, tag)) for n_vc in n_vcs],
1324 mk_thyps = lambda n_vcs: [rep_graph.pc_true_hyp ((n_vc, tag))
H A Dstack_logic.py201 hyp = rep_graph.pc_true_hyp ((n_vc, p.node_tags[n][0]))
H A Dtrace_refute.py197 return rep_graph.pc_true_hyp (get_vis (rep.p, n,

Completed in 62 milliseconds