### Table 3: Summary of Propositional Logic Theorem Provers

1996

"... In PAGE 30: ....1.1.5 Summary of Propositional logic theorem proving The following Table3 is a summary of the theorem provers just described. The information is based on readings from [17, 19, 16, 5, 12]... ..."

### Table 3: Axioms for hiding and encapsulation actions. Using the above mentioned axioms, we shall prove Lemma B.3. This lemma is used in the main theorem and is essential for having Milner apos;s proof formalised in CRL; it allows to distribute the encapsulation and hiding operators over the merge operator. (It is an open question whether or not the scheduler can be veri ed without the use of alphabet axioms in an elegant way, if it is possible at all.) For proving Lemma B.3 we use two auxiliary propositions which are listed below.

### Table 4. Results of theorem proving on testbed systems

1999

"... In PAGE 42: ...4 Theorem Proving Results Overall, 21 strategies were developed to assist in the analysis of ASTRAL specifications. Table4 shows the results of using PVS and the developed strategies to prove the proof obligations of the testbed systems. The results of the theorem prover proofs and earlier proofs by hand are the basis for a systematic analysis methodology described in [Kol 99b] in which tool-supported guidance is given for constructing proof sketches by hand, which are then carried out in a similar fashion within PVS.... ..."

Cited by 3