Result 1 to 20 from 31 total
The tail-recursive SECD machine. (English)
J. Autom. Reasoning 23, No. 1, 43-62 (1999).
1
Nonconstructive computational mathematics. (English)
J. Autom. Reasoning 21, No.1, 69-97 (1998).
2
Reasoning theories. Towards an architecture for open mechanized reasoning systems. (English)
Baader, Franz (ed.) et al., Frontiers of combining systems. First international workshop, Munich, Germany, March 26‒29, 1996. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 3, 157-174 (1996).
3
An interactive solution to the $n\times n$ mutilated checkerboard problem. (English)
J. Log. Comput. 6, No.4, 573-598 (1996).
4
Automated mathematical induction. \newl Reprinted from Journal of Automated Reasoning 16, Nos. 1-2 (1996). (English)
Dordrecht: Kluwer Academic Publishers. 222 p. Dfl. 125.00; \$ 84.00; \sterling 56.00 (1996).
5
Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem. (English)
J. Autom. Reasoning 16, No.1-2, 181-222 (1996).
6
A Ramsey theorem in Boyer-Moore logic. (English)
J. Autom. Reasoning 15, No.2, 217-235 (1995).
7
A mechanically verified incremental garbage collector. (English)
Formal Asp. Comput. 6, No. 4, 359-390 (1994).
8
Using Term Rewriting to Verify Software. (English)
IEEE Transactions on Software Engineering 20, No.04, 259-274 (1994).
9
Metamathematics, machines, and Gödel’s proof. (English)
Cambridge Tracts in Theoretical Computer Science. 38. Cambridge: Univ. Press. xv, 202 p. \sterling 25.00; \$ 39.95 /hc (1994).
10
Proof movie ‒ a proof with the Boyer-Moore prover. (English)
Formal Asp. Comput. 5, No.2, 121-151 (1993).
11
An extension of the Boyer-Moore theorem prover to support first-order quantification. (English)
J. Autom. Reasoning 9, No.3, 355-372 (1992).
12
Machine checked proofs of the design of a fault-tolerant circuit. (English)
Formal Asp. Comput. 4, No.6A, 755-775 (1992).
13
A verification system for concurrent programs based on the Boyer-Moore prover. (English)
Formal Asp. Comput. 4, No.6A, 597-611 (1992).
14
A mechanical proof of quadratic reciprocity. (English)
J. Autom. Reasoning 8, No.1, 3-21 (1992).
15
Proving Matijasevich’s lemma with a default arithmetic strategy. (English)
J. Autom. Reasoning 7, No.3, 439-446 (1991).
16
Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm. (English)
J. Autom. Reasoning 7, No.1, 109-158 (1991).
17
The Boyer-Moore prover and Nuprl: An experimental comparison. (English)
Logical frameworks, Proc. 1st Annu. Workshop, Sophia-Antipolis/Fr. 1990, 89-119 (1991).
18
Mechanically Verifying Concurrent Programs with the Boyer-Moore Prove. (English)
IEEE Transactions on Software Engineering 16, No.09, 1005-1023 (1990).
19
A theorem prover for a computational logic. (English)
Automated deduction, Proc. 10th Int. Conf., Kaiserslautern/FRG 1990, Lect. Notes Comput. Sci. 449, 1-15 (1990).
20
Result 1 to 20 from 31 total
Start
Contact
Print
General Help
