Searched refs:vc_offs (Results 1 - 6 of 6) sorted by relevance
/seL4-l4v-master/graph-refine/ |
H A D | check.py | 17 from rep_graph import (vc_num, vc_offs, vc_double_range, vc_upto, mk_vc_opts, namespace 370 visit = vc_offs (visit.n * step) 424 (l_visit, _) = split_visit_visits (tags, split, restrs, vc_offs (n - 1)) 425 (l_cont, _) = split_visit_visits (tags, split, restrs, vc_offs (n)) 434 return hyps + [hyp for offs in map (vc_offs, range (n)) 493 min_vc = vc_offs (max (0, x - 1)) 540 (cont, r_cont) = split_visit_visits (tags, split, restrs, vc_offs (n)) 550 restrs, vc_offs (n))] 613 cont = split_visit_one_visit (tag, details, restrs, vc_offs (n)) 617 eqs_assume + eqs, restrs, vc_offs ( [all...] |
H A D | loop_bounds.py | 8 from rep_graph import vc_num, vc_offs, pc_true_hyp, Hyp, eq_hyp namespace 128 (n, tuple (general + [(head, rep_graph.vc_offs (1))]))] 129 specific = [(head, rep_graph.vc_offs (1)) for _ in [1] if head] 237 restrs, vc_offs (0))] 525 visit = ((split, vc_offs (2)), ) + restrs
|
H A D | rep_graph.py | 115 return mk_vc_opts (map (vc_num, nums) + map (vc_offs, offsets)) 123 def vc_offs (n): function 127 return mk_vc_opts (map (vc_offs, range (n))) 130 return mk_vc_opts (map (vc_num, range (n)) + map (vc_offs, range (m))) 529 if split == n and count == vc_offs (0):
|
H A D | trace_refute.py | 176 restrs = tuple ([(l_id, rep_graph.vc_offs (0))]) 178 restrs = tuple ([(l_id, rep_graph.vc_offs (1))])
|
H A D | search.py | 11 from rep_graph import (mk_graph_slice, vc_num, vc_offs, vc_upto, namespace 758 vis1 = (n, ((head, vc_offs (1)), ) + restrs) 759 vis2 = (n, ((head, vc_offs (2)), ) + restrs) 1428 vc = vc_offs (i + 1) 1430 vc = vc_offs (i)
|
H A D | stack_logic.py | 29 specific = [(head, rep_graph.vc_offs (1)) for _ in [1] if head]
|
Completed in 51 milliseconds