25.11.2014 Aufrufe

Verifikation reaktiver Systeme - Universität Kaiserslautern

Verifikation reaktiver Systeme - Universität Kaiserslautern

Verifikation reaktiver Systeme - Universität Kaiserslautern

MEHR ANZEIGEN
WENIGER ANZEIGEN

Sie wollen auch ein ePaper? Erhöhen Sie die Reichweite Ihrer Titel.

YUMPU macht aus Druck-PDFs automatisch weboptimierte ePaper, die Google liebt.

220<br />

properties, there is e.g. a theory of bit vector machine arithmetic. It defines a lot<br />

of the integer operations found in computer architectures, including addition,<br />

multiplication, two’s complement and rotation. Moreover, the HOL system allows<br />

the user to access external programs within the HOL system by an oracle<br />

mechanism. In this way, SAT (e.g. SATO, GRASP and ZCHAFF) and BDD<br />

engines can be used in proofs.<br />

The HOL system is well documented[4, 6, 3]. After having learned some HOL<br />

basics and got used to the system (which takes some weeks), the documentation<br />

provides a lot of useful information for further work. A lot of material in this<br />

article has been borrowed from there.<br />

2.2 Foundations<br />

The following paragraphs present the logic supported by the HOL system. Introducing<br />

only the some basic concepts, they are a summary of the HOL description<br />

which presents the logic extensively.<br />

Types The HOL logic is based on Church’s simple theory of types[2]. It contains<br />

syntactic categories of types and terms whose elements denote respectively certain<br />

sets and elements of sets. These are taken from a fixed set of sets U, the<br />

universe, that has the following properties.<br />

– Inhab: Each element of U is a non-empty set<br />

– Sub: IfX ∈U and ¬Y ⊆ X, thenY ∈ U<br />

– Prod: IfX ∈Uand Y ∈U,thenX × Y ∈U. X × Y is the cartesian product,<br />

a set that consists of ordered pairs (x, y) withx ∈ X and y ∈ Y<br />

– Pow: IfX ∈U,thenthepowersetP(X) ={Y : Y ⊆ X} is also in U<br />

– Infty: U contains a distinguished infinite set I.<br />

– Choice Thereisadistinguishedelementch ∈ Π X∈U X. The elements of the<br />

product Π X∈U X are (dependently) typed functions: thus, for all X ∈ U, X<br />

is non-empty by Inhab and ch(X) ∈ X witnesses this.<br />

From these properties, it follows:<br />

– Fun: The universe contains the set of functions X → Y ∈U (if X ∈U and<br />

Y ∈U.<br />

– Bool: There is a distinguished two-element set B = {0, 1}.<br />

The types of the HOL logic represent sets in the universe U. Therearefourkinds<br />

of types:<br />

– Atomic types: These denote fixed sets in the universe. Each theory determines<br />

a particular collection of atomic types for example, the standard<br />

atomic types B and I denote, respectively the distinguished two-element<br />

set 2 and the distinguished infinite set I.

Hurra! Ihre Datei wurde hochgeladen und ist bereit für die Veröffentlichung.

Erfolgreich gespeichert!

Leider ist etwas schief gelaufen!