/seL4-l4v-10.1.1/HOL4/examples/dev/sw/ |
H A D | UTuple.sml | 15 (** pairs **) 39 (** pairs **) 47 (** plain pairs *) 50 (** plain pairs *)
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/ |
H A D | UTuple.sml | 15 (** pairs **) 39 (** pairs **) 47 (** plain pairs *) 50 (** plain pairs *)
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.2/util/ |
H A D | UTuple.sml | 15 (** pairs **) 39 (** pairs **) 47 (** plain pairs *) 50 (** plain pairs *)
|
/seL4-l4v-10.1.1/graph-refine/ |
H A D | graph-refine.py | 124 pairs = list (set ([pair for f in pairings for pair in pairings[f] 127 if len (pairs) == 1: 128 return pairs[0] 129 word_pairs = [p for p in pairs if s in word_re.findall (str (p))] 132 print 'Possibilities for %r: %s' % (s, [str (p) for p in pairs]) 170 def check_pairs (pairs, loops = True, report_mode = False, 172 num_pairs = len (pairs) 173 printout ('Checking %d function pair problems' % len (pairs)) 177 for (i, pair) in enumerate (pairs)] 218 pairs [all...] |
H A D | debug.py | 238 pairs = [] 248 pairs.extend (zip (ls, rs)) 249 return pairs 267 pairs = [] 286 pairs.extend ((zip (ls[i - j:], rs))) 288 pairs.extend ((zip (ls, rs[j - i:]))) 289 return pairs 767 pairs = set ([pair for f in pairings for pair in pairings[f]]) 769 for pair in pairs: 831 pairs [all...] |
/seL4-l4v-10.1.1/HOL4/examples/muddy/muddyC/buddy/src/ |
H A D | pairs.c | 32 FILE: pairs.c 44 static bddPair* pairs; /* List of all replacement pairs in use */ variable 53 pairs = NULL; 59 bddPair *p = pairs; 82 for (p=pairs ; p!=NULL ; p=p->next) 93 p->next = pairs; 94 pairs = p; 102 for (p=pairs ; p!=NULL ; p=p->next) 121 for (p=pairs ; [all...] |
H A D | makefile | 8 pairs.o prime.o reorder.o tree.o 10 pairs.c prime.c reorder.c tree.c
|
/seL4-l4v-10.1.1/HOL4/examples/elliptic/c_output/ |
H A D | c_outputLib.sig | 15 the function main_func. The parameter tests is a list of pairs 17 contains pairs of arguments and expected results for these arguments. 24 It generates a random list of word32-pairs with pair_size elements in 26 specifies the number of pairs generated
|
/seL4-l4v-10.1.1/graph-refine/loop-example/O1/ |
H A D | target.py | 44 pairs = [(s, 'Loop.' + s) for s in afunctions] 48 new_pairings = stack_logic.mk_stack_pairings (pairs, stack_bounds)
|
/seL4-l4v-10.1.1/graph-refine/loop-example/O2/ |
H A D | target.py | 45 pairs = [(s, 'Loop.' + s) for s in afunctions] 49 new_pairings = stack_logic.mk_stack_pairings (pairs, stack_bounds)
|
/seL4-l4v-10.1.1/graph-refine/seL4-example/ |
H A D | target.py | 46 pairs = [(s, 'Kernel_C.' + s) for s in functions 51 new_pairings = stack_logic.mk_stack_pairings (pairs, stack_bounds)
|
/seL4-l4v-10.1.1/isabelle/src/Tools/Metis/src/ |
H A D | NameArity.sig | 10 (* A type of name/arity pairs. *)
|
H A D | NameArity.sml | 10 (* A type of name/arity pairs. *)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/Metis/src/ |
H A D | NameArity.sig | 10 (* A type of name/arity pairs. *)
|
/seL4-l4v-10.1.1/HOL4/src/portableML/ |
H A D | AList.sig | 4 Association lists -- lists of (key, value) pairs.
|
/seL4-l4v-10.1.1/isabelle/src/Doc/Tutorial/document/ |
H A D | root.tex | 17 \index{product type|see{pairs and tuples}} 20 \index{tuples|see{pairs and tuples}}
|
H A D | types0.tex | 24 \index{pairs and tuples|(} 26 \index{pairs and tuples|)}
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Doc/Tutorial/document/ |
H A D | root.tex | 17 \index{product type|see{pairs and tuples}} 20 \index{tuples|see{pairs and tuples}}
|
H A D | types0.tex | 24 \index{pairs and tuples|(} 26 \index{pairs and tuples|)}
|
/seL4-l4v-10.1.1/HOL4/examples/muddy/muddyC/buddy/examples/cmilner/ |
H A D | milner.c | 12 bddPair *pairs; variable 193 tmp1 = bdd_addref( bdd_replace(C, pairs) ); 269 pairs = bdd_newpair(); 270 bdd_setpairs(pairs, primvar, normvar, N*3);
|
/seL4-l4v-10.1.1/HOL4/examples/muddy/muddyC/ |
H A D | muddy.c | 543 bddPair *pairs; local 558 pairs = bdd_newpair(); 559 bdd_setpairs(pairs, o, n, size); 567 PairSet_val(result) = pairs; 577 bddPair *pairs; local 592 pairs = bdd_newpair(); 593 bdd_setbddpairs(pairs, o, n, size); 601 PairSet_val(result) = pairs; 814 bddPair *pairs; local 829 pairs [all...] |
/seL4-l4v-10.1.1/HOL4/src/coretypes/ |
H A D | pairLib.sml | 2 * Theory of pairs and associated support. * 18 depends on pairs. *) 111 (* given a varstruct (possibly nested pairs of variables) vs, return a list
|
/seL4-l4v-10.1.1/HOL4/examples/HolBdd/ |
H A D | PrintBdd.sml | 88 val pairs = Binarymap.listItems vm; value 96 varmap_to_sed_script(file^"_sed_edits")pairs;
|
/seL4-l4v-10.1.1/HOL4/src/hol88/ |
H A D | hol88Lib.sig | 27 substitution is a list of pairs
|
/seL4-l4v-10.1.1/HOL4/tools/mlyacc/src/ |
H A D | shrink.sml | 82 (* scan: merge pairs of lists on a list of lists. 111 Let the original entry list be E. We map E to a list of a pairs 113 are numbered 0 to n-1. Call this list of pairs EP. 116 pairs now specify a permutation that will return us to EP.
|