### Table 3. Time and memory needed for verification

"... In PAGE 13: ... The headings are live for the original model using standard liveness checking, l2s for the translated, unoptimized model, and var, halt, and var + halt for the translated model with variable, halt, and both op- timizations applied. Table3 shows time and space require- ments. Table 4 states the number of iterations performed to check the property, that is, excluding iterations to construct a counterexample.... ..."

### Table 2. Proof verification

2003

"... In PAGE 5: ... Table 2. Proof verification Table2 gives data about proof verification. The Verification time column shows the time taken by Proof_verification2.... In PAGE 6: ... (For the rest of the conflict clauses we computed the number of resolutions exactly. So we believe the lower bounds shown in Table2 are close to the real sizes.) The Confl.... In PAGE 6: ... It is not hard to see that with the exception of a few instances conflict clause proofs are smaller than resolution graph ones. (In Table2 we estimate only the initial size of a resolution graph. That is we do not take into account that, as it was mentioned in Section 5, the size of the resolution proof grows during proof verification.... In PAGE 6: ...onfl. cl. proof size (in thou- sands of literals) Ra- tio % bounded model checking, SAT-2002 [18] fifo8_200 379,992 71,971 18 fifo8_300 987,840 118,132 11 fifo8_400 4,581,450 335,752 7 Table 3. Growth of resolution proof size The size of the largest proof of Table2 (formula 7pipe) was 257 Mbyte and so we were able to verify the proof on the computer with 640 Mbytes of memory. On the other hand, the corresponding resolution graph proof contained 435 million nodes and so the resolution graph would take more than 2 Gbytes of memory (assuming that on average one needs 5 digits to label a node of the resolution graph).... ..."

Cited by 22

### Table 2. Proof verification

"... In PAGE 5: ...44 103,556 41.5 Table2 gives data about proof verification. The Verification time column shows the time taken by Proof_verification2.... In PAGE 5: ... (For the rest of the conflict clauses we computed the number of resolutions exactly. So we believe the lower bounds shown in Table2 are close to the real sizes.) The Confl.... In PAGE 5: ...It is not hard to see that with the exception of a few instances conflict clause proofs are smaller than resolution graph ones. (In Table2... In PAGE 6: ... cl. proof size (in thou- sands of literals) Ra- tio % bounded model checking, SAT-2002 [18] fifo8_200 379,992 71,971 18 fifo8_300 987,840 118,132 11 fifo8_400 4,581,450 335,752 7 The size of the largest proof of Table2 (formula 7pipe) was 257 Mbyte and so we were able to verify the proof on the computer with 640 Mbytes of memory. On the other hand, the corresponding resolution graph proof contained 435 million nodes and so the resolution graph would take more than 2 Gbytes of memory (assuming that on average one needs 5 digits to label a node of the resolution graph).... ..."

### Table 2: Structural model parameters as estimated by GAUSUM-STM for the

"... In PAGE 14: ... and the prior probabilities es and ~1. The type of convergence achieved by the optimizer is also given in Table2 . Five types of convergence are possible: (R)elative function convergence, (X)-convergence, (B)oth X- d 1 t an re a ive function convergence, and (F) 1 a se convergence (see appendix A for details).... ..."

### Table 2. Complexity of TBS-TM and STM Implementations

2005

"... In PAGE 9: ... Though, for purposes of exposition and comparison, we describe the pro- tocol as a shared memory software protocol, it may bene t from being implemented on the more e cient messaging hardware level [1]. Table2 compares a TBS based software transactional memory implementation to the software transactional memory implementations of both Herlihy et al. [17] (denoted HLMS in the table) and Harris and Fraser [11] (denoted as HF in the table).... ..."

### Table 7.1 Time and memory requirements of verification of one-clock and n-clock approach model

2005

Cited by 1

### Table 2 Example verification results. Property Network Size CPU Time (Sec) Memory (MB)

"... In PAGE 17: ... The model checker can handle networks with 5 up to 16 nodes depending on the properties to be checked, that are reasonable numbers for BSN applications in medical scenarios. The verification results are summarized in Table2 , and a more detailed list of checked example requirements is given in Table B.1 in the Appendix.... ..."

### Table 4: Memory Integrity Verification Techniques.

"... In PAGE 11: ... At this point, it is not clear about what should be the duty-cycle for log-hash trees to perform efficiently. Table4 tabulates the advantages and disadvantages of all the schemes that we have discussed above. Table 4: Memory Integrity Verification Techniques.... ..."

### Table 7 Sets of sources and offered traffic loads per idle source, for the 2nd numerical example (f-STM, STM) Number of sources Model used

2004