Searched refs:azip (Results 1 - 7 of 7) sorted by last modified time

/seL4-l4v-master/graph-refine/
H A Dtrace_refute.py21 from logic import azip namespace
228 xsub = dict ([(v, xv) for (v, (xv, _)) in azip (inps, seq)])
229 ysub = dict ([(v, yv) for (v, (_, yv)) in azip (inps, seq)])
H A Dstack_logic.py18 from logic import azip namespace
333 in azip (fun.outputs, p.outputs[tag])
1050 arg_input_map = dict (azip (fun.inputs, node.args))
1051 ret_output_map = dict (azip (fun.outputs,
1292 for ((nm, typ), const) in azip (node.rets, is_consts)
1313 for ((nm, typ), (nm2, _)) in azip (node.rets, f_outs)
H A Dsearch.py1735 for ((restrs, hyps, name), hints) in logic.azip (probs, restr_hints):
H A Drep_graph.py13 from logic import azip namespace
695 for ((x, typ), arg) in azip (fun.inputs, node.args)])
704 for ((x, typ), (y, typ2)) in azip (node.rets, fun.outputs):
714 for ((x, typ), (y, _)) in azip (node.rets, fun.outputs):
1250 eq_seq = logic.azip (p.nodes[call_site].args, args)
H A Dproblem.py14 from logic import azip namespace
134 azip (xs, ys)])
733 p.nodes[n] = Node ('Basic', en, azip (inp_lvs, node.args))
736 p.nodes[ex] = Node ('Basic', node.cont, azip (node.rets, out_vs))
H A Dlogic.py61 def azip (xs, ys): function
99 a_map = dict (azip (prunes[1], var_a_args))
101 in azip (prunes[0], var_c_args) if p in a_map]
104 in azip (var_a_rets, var_c_rets)]
243 for (pat_vs, vs) in azip (pat_params, params)
244 for (x, y) in azip (pat_vs, vs)]
272 for (a, b) in azip (var_exp.vals, conc_exp.vals)])
1223 arg_input_map = dict (azip (fun.inputs, node.args))
1260 for (x, y) in azip (xs, ys):
H A Dcheck.py224 subproofs = logic.azip (subproblems, self.subproofs)
722 for (subprob, subproof) in logic.azip (subproblems, proof.subproofs):
896 xs = logic.azip (subproblems, proof.subproofs)
897 xs = logic.azip (xs, cases)

Completed in 76 milliseconds