### Table 3. Experimental results of proving linearizability for an unbounded number of threads

### Table 3. Experimental results of proving linearizability for an unbounded number of threads

### Table 1. Results of the Dyn-BCP algorithm for the A and B instances.

2003

Cited by 18

### Table 1. Performance of partial order reduction algorithm

"... In PAGE 4: ...he independence checks of section 3.1. 4 Experiments and Results Our algorithms have been implemented in the POeM tool[2], which extends Murphi. We have run POeM on examples of varying sizes, and the results are shown in Table1 . Significant reduction is achieved in a number of the examples, the most dramatic of these being the dining philosophers problem, labeled DP in the table, where, for 10 philosophers, there is over 99% reduction.... ..."

### Table 1: Statistics for Partial Order in Figure 2

1994

"... In PAGE 13: ...3 Comparing Partial Order Services Using arbitrary precision arithmetic routines, programs were developed to compute ei values for an arbitrary series-parallel partial order. Table1 indicates ei values for 0 i lt; N for the Anatomy and Physiology Instructor example in Figure 2. Additionally, the corresponding number of linear extensions for an ordered and unordered service are tabulated.... ..."

Cited by 39

### Table 2: Local Reduction Steps of First-Order System

1998

"... In PAGE 2: ... Code for methods in method override and object extension is then coerced to expect such stripped objects. The relation in Table2 is extended to a one-step evaluation relation on programs by e ; e0 () 9e1;e2: e = E[e1] ^ e1 ; e2 ^ E[e2] = e0: We can prove Proposition 1 (Determinacy) The relation ; is a partial function. We use ; to denote the reflexive, transitive closure of ;.... ..."

Cited by 52

### Table 2: Local Reduction Steps of First-Order System

1998

"... In PAGE 2: ... Code for methods in method override and object extension is then coerced to expect such stripped objects. The relation in Table2 is extended to a one-step evaluation relation on programs by e ; e0 () 9e1;e2: e = E[e1] ^ e1 ; e2 ^ E[e2] = e0: We can prove Proposition 1 (Determinacy) The relation ; is a partial function. We use ; to denote the reflexive, transitive closure of ;.... ..."

Cited by 52

### Table 1. Experimental results for partial order reduction

1999

"... In PAGE 7: ...rties, e.g. checking separately for 3p and for 3q, rather than 3p^3q. In Table1 we present some experimental results of using partial order reduction. The experiments where performed on a SGI Challenge machine with 12 proces- sors and 1.... ..."

Cited by 13

### Table 1. Categorisation of Groupware Systems (extended version in Terzis and Nixon 1998).

in The Future of Enterprise Groupware Applications 1 THE FUTURE OF ENTERPRISE GROUPWARE APPLICATIONS

"... In PAGE 3: ... GROUPWARE SURVEY The term groupware, although it has a long history, still has different meanings for different people. In order to clarify the term and to provide a better understanding of groupware technology we present a categorisation of groupware research projects and commercial products (see Table1 ). The categorisation is based on characteristics they share and services Figure 1.... In PAGE 4: ... The purpose of the categorisation is not to provide a complete presentation of groupware technology, but to show the various aspects that available groupware applications and research cover. Examining Table1 we can identify some common aspects that characterise groupware applications in general. As it is expected in each of these aspects there is a whole range of approaches and each project or product covers a specific part of it.... ..."

### Table 1. Categorisation of Groupware Systems (extended version in Terzis and Nixon 1998).

"... In PAGE 2: ... GROUPWARE SURVEY The term groupware, although it has a long history, still has different meanings for different people. In order to clarify the term and to provide a better understanding of groupware technology we present a categorisation of groupware research projects and commercial products (see Table1 ). The categorisation is based on characteristics they share and services Figure 1.... In PAGE 3: ... The purpose of the categorisation is not to provide a complete presentation of groupware technology, but to show the various aspects that available groupware applications and research cover. Examining Table1 we can identify some common aspects that characterise groupware applications in general. As it is expected in each of these aspects there is a whole range of approaches and each project or product covers a specific part of it.... ..."