### Table 6. Summary of results for the pi application

1995

"... In PAGE 11: ... The choice of time triggers was only driven by their characteristics which assure that faults are always activated. Table 3 to Table6 show the results provided by the statistical analysis of fault injection results for the pi calculation. Each table presents specific information concerning the behaviour of the system under fault injection.... In PAGE 11: ... On the other hand, faults in the Data Bus did not have such a dramatic impact, as they only lead to the crash of the system in 30,34% of the cases. However, a larger percentage (43,8%) of Undetected (fatal fault: see Table6 ) has been observed. This is due to the fact that some internal processor built-in error detection mechanisms that detect many address errors (e.... ..."

Cited by 53

### Table 1 The syntax of the pi-calculus.

2007

"... In PAGE 2: ... In this paper we use a standard variant of the monadic pi-calculus without recursion and replication. The syntax of the calculus is defined in Table1 . We let P, Q etc.... ..."

### Table 3: The encoding of V into the -calculus

1999

"... In PAGE 21: ... Remark 5.13 In Table3 , the inputs at location names (q and r) are not repli- cated because, in the step of translation from HO to -calculus, we take into account the linearity constraint on continuations (see Remark 5.7) and therefore adopt the optimisation of Section D.... In PAGE 21: ...dopt the optimisation of Section D.0.9. As discussed in Section D.0.9, linear types are however not needed in the -calculus. For the sake of readability the translation of Table3 is not annotated with types. Types are needed, however, to prove its correctness.... In PAGE 29: ... To represent thunks, we can introduce a constructor delay(M) and a destruc- tor force(M). Keeping in mind that they represent parameterless abstraction and application, it is straightforward to add them to V and to its -calculus encoding V ( Table3 ); the additional operational rules are: M ?!V M0 force(M) ?!V force(M0) force(delay(M)) ?!V M and the additional clauses for V are: V[[delay(M)]] def= (p). p(v).... In PAGE 66: ... 13.5 Local structure of the call-by-value encoding Proceeding as for the call-by-name encoding, one can show that also the call- by-value encoding of Table3 is sound, but not complete, w.... ..."

Cited by 2

### Table 2. The late-instantiation probabilistic transition system of the pa-calculus. In Par we assume that if the argument of i is bound then it does not occur free in Q.

"... In PAGE 6: ... We will also use the notation s f i ?! pi sigi: (i), where (i) is a logical formula depending on i, for the set s f i ?! pi si j i 2 I and (i)g. The operational semantics of a pa process P is defined as a probabilistic automa- ton whose states are the processes reachable from P and the T relation is defined by the rules in Table2 . In order to keep the presentation simple, we assume that all branches in Sum are different, namely, if i 6 = j, then i:Pi 6 j:Pj.... ..."

### Table 2 Syntax of messages, expressions and formulae for the pi-calculus

"... In PAGE 7: ... In order to unify the presentation of the pi-calculus and the spi-calculus, we have parametrised the syntax of processes Table 1 by messages, expressions and formulae. Table2 read in conjunction with Table 1 gives the syntax of the pi-calculus, whereas for the spi-calculus, Table 3 and Table 1 should be considered. The main difference between the pi-calculus and the spi-calculus is that it is possible in the latter to send and receive compound messages; in particular, a cyphertext of the form EN(M) denotes the message M encrypted with the shared key N (which might itself be a compound message).... ..."

### Table 1 Keynote statistics

2006

"... In PAGE 7: ... This should not prove a problem as the aim of the paper is to show what deep logging could offer and the comparison between the two libraries is of secondary interest only. Table1 provides a summary of the usage data collected for the two digital libraries. Nearly 3 million users, viewing over 34 million items, are represented in our analyses.... ..."

Cited by 1