Z and HOL

Z and HOL (1994)

by Jonathan P. Bowen , Michael J. C. Gordon , Mike Gordon

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Z and HOL	SVM HeaderParse 0.1
AUTHOR NAME	Jonathan P. Bowen	user correction - Legacy Corrections
AUTHOR AFFIL	; Oxford University Computing Laboratory; Programming Research Group; UK	user correction - Legacy Corrections
AUTHOR ADDR	; Wolfson Building; Parks Road; Oxford OX1 3QD	user correction - Legacy Corrections
AUTHOR NAME	Michael J. C. Gordon	user correction - Legacy Corrections
AUTHOR NAME	Mike Gordon	user correction - Legacy Corrections
AUTHOR AFFIL	; University of Cambridge; Computer Laboratory; New Museums Site; UK	user correction - Legacy Corrections
AUTHOR ADDR	; Pembroke Street; Cambridge CB2 3QG	user correction - Legacy Corrections
ABSTRACT	A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for human-readable formal specification. The HOL theorem proving system supports higher order logic and is used for machine-checked verification. A well-known case study is used as a running example. The presentation is intended to show people with some knowledge of Z how a tool such as HOL can be used to provide mechanical support for the notation, including mechanization of proofs. No specialized knowledge of HOL is assumed.	user correction - Legacy Corrections
YEAR	1994	user correction - Legacy Corrections
CITATIONS	31 found	ParsCit 1.0