### TABLE I SETS USED IN THE IZR CORRECTNESS PROOF

2004

Cited by 14

### Table 2: Comparison of the eij and small domains encodings on correct out-of-order superscalar microprocessors that do require transitivity of equality for their correctness proofs.

2001

Cited by 64

### Table 2: Comparison of the eij and small domains encodings on correct out-of-order superscalar microprocessors that do require transitivity of equality for their correctness proofs.

2001

Cited by 64

### Table 2: Comparison of the eij and small domains encodings on correct out-of-order superscalar microprocessors that do require transitivity of equality for their correctness proofs.

2001

Cited by 64

### Table I gives a summary of the sets used in the correctness proof of the IZR framework. Lemma 1: Each uncovered frontier node is a neighbor of a covered frontier node.

2004

Cited by 14

### Table 2: The Deductive Proof System Associated with the Corrected Version of Woo and Lam Protocol

### Table 3.1: Average no. of corrected errors at mark recovery for Lena (crop- proof method).

### Table 3.2: Average no. of corrected errors at mark recovery for Lena (scale- proof method).

### Table 1. Lines of Isar proof code for different parts of the proof

2006

"... In PAGE 12: ... In total, the proof of the correctness of the transformation from automata to a PLC language contains approximately 1500 lines of proof code. Table1 shows the distribution of lines of proof code for the different parts of the proof. 5 Here, the Isabelle/HOL operator llparenthesis.... ..."

Cited by 1