Titlebook: Higher Order Logic Theorem Proving and Its Applications; 6th International Wo Jeffrey J. Joyce,Carl-Johan H. Seger Conference proceedings 1

HPA533

A proof development system for the HOL theorem prover,In this paper, we present a system to improve the interaction between HOL and the user when doing proofs.

Mobile

解冻

Some theorems we should prove,Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed; oversights and other errors arc quite common. To detect the “early” errors in a document, one must attempt to prove certain simple theorems. This paper gives some examples of such theorems.

obsolete

Using PVS to prove some theorems of David Parnas,David Parnas [13] describes some theorems representative of those encountered in support of certification of software for the Darlington nuclear reactor. We describe the verification of these theorems using PVS.

圣歌

Extending the HOL theorem prover with a computer algebra system to reason about the reals,In this paper we describe an environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system.

CROW

止痛药

种族被根除

戏服

Reasoning with the formal definition of standard ML in HOL,. HOL theories of the Core syntax and dynamic semantics are presented, including a purely definitional representation of the semantic inference rules. The correctness of the representation is demonstrated by the derivation of several important language properties, including determinacy. A symbolic e

不安