Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
69,072
Table 1: Explicit substitutions
"... In PAGE 32: ...p sat? a0 a ` a0 p sat? a (Skip?) skip sat? (Assignment?) X := e sat? [e=X] (Sequential?) p1 sat? a1 p2 sat? a2 p1; p2 sat? a1[a2= ] (Precondition?) p sat? a b!p sat? a _ :b (Choice?) gc1 sat? a1 gc2 sat? a2 gc1 [] gc2 sat? a1 ^ a2 (Alternative?) gc sat? a if gc sat? a (Repetitive?) gc sat? a0 X 2= loc(a0) G(gc) ^ a ` a0[a= ] G(gc) ^ a ^ e = X ` a0[e lt; X= ] :G(gc) ^ a ` a ` e 0 do gc od sat? a Table1 0: Inference system for total correctness (termination) of the nonde- terministic choice language... In PAGE 33: ...assertions is the same as in table 3 CF[[X := e]] 4 = [X7!E[[e]]] [ fhF; Fig CF[[skip]] 4 = 1State [ fhF; Fig CF[[p1; p2]] 4 = CF[[p2]] CF[[p1]] CF[[if gc ]] 4 = CF[[gc]] [ (State fFg) (B[[:G(gc)]]) CF[[do gc od]] 4 = `fp ( f) (f CF[[gc]] (B[[G(gc)]]) [ (B[[:G(gc)]]) [ fhF; Fig) with respect to the standard set-theoretic order on relations CF[[b!p]] 4 = CF[[p]] (B[[b]]) [ fhF; Fig CF[[gc1 [] gc2]] 4 = CF[[gc1]] [ CF[[gc2]] [[a ` a0]] 4 = (8 ) A[[a]] A[[a0]] [[p satF a]] 4 = (8 ) CF[[p]]R(A[[a]] ) Table1 1: Semantics of the nondeterministic choice language|total correct- ness for lack of failures... In PAGE 34: ...p satF a0 a ` a0 p satF a (SkipF ) skip satF (AssignmentF ) X := e satF [e=X] (SequentialF ) p1 satF a1 p2 satF a2 p1; p2 satF a1[a2= ] (PreconditionF) p satF a b!p satF a _ :b (ChoiceF ) gc1 satF a1 gc2 satF a2 gc1 [] gc2 satF a1 ^ a2 (AlternativeF ) gc satF a a ` G(gc) if gc satF a (RepetitiveF ) gc satF a0 G(gc) ^ a ` a0[a= ] :G(gc) ^ a ` do gc od satF a Table1 2: Inference system for total correctness (lack of failures) of the nondeterministic choice language... ..."
Table 5. Calculi for Network-Aware Programming: An Assessment
"... In PAGE 5: ... The implementation consists of a translation of ambi- ents in JoCaml. Table5 summarizes our evaluation (we refer to the full paper for more details). References [1] L.... ..."
Table 2.1: Theoretical properties As explained in the introduction, all these calculi are \a priori quot; good candidates for e cient implementations of a functional language for instance. But as far as we know, no work has been done concerning this practical aspect ([Bor95] implements for a higher-order uni cation algorithm described in [DHK95], but he does not deal with the e ciency of the system). So we want to compare some calculi with regard to their time e ciency when considered as reduction machineries. Our aim is then to add new columns to the previous table instead of new lines.
Table 4: Time for PDB Construction and Explicit Search in Blocks World.
"... In PAGE 6: ... We also observe that the peak node count for the is also established earlier then the peak state count. Explicit Search Table4 compares the CPU times1 of explicit and sym- bolic PDB construction with the exploration time in explicit 1Most of the experiments were run on a Sun UltraSparc Work- station with 248 MHz. Since exact running-times reflect too many issues of the current implementation, for the interpretation of re- sults we are mainly interested in comparing performance growth.... ..."
Table 1: Performance compared to explicit method
1997
"... In PAGE 30: ... Table1 is to be interpreted as follows. The column marked Cases gives the number of clauses in the DNF representation of the claim; Formulae gives the maximum number of relational formulae in each clause.... ..."
Cited by 2
Table 1: Performance compared to explicit method
1997
"... In PAGE 30: ... Table1 is to be interpreted as follows. The column marked Cases gives the number of clauses in the DNF representation of the claim; Formulae gives the maximum number of relational formulae in each clause.... ..."
Cited by 2
Table 1: Performance compared to explicit method
1997
"... In PAGE 30: ... Table1 is to be interpreted as follows. The column marked Cases gives the number of clauses in the DNF representation of the claim; Formulae gives the maximum number of relational formulae in each clause.... ..."
Cited by 2
Table 3: Performance of Migration by Substitution
"... In PAGE 14: ...3.1 Performance Table3 shows an experiment with migration by substitution. The experiment was conducted to compare the transfer times of various data structures with and without the substitution a orded by the new version of Napier/RPC.... ..."
Results 1 - 10
of
69,072
