Enhancing Formal Verification with Z-Eves: A Comprehensive Toolkit for Theorem Proving
40 likes | 183 Views
Z-Eves is a powerful theorem prover based on Z notation, designed to support formal verification in mathematics and computer science. Utilizing a model-based language grounded in mathematical logic and first-order predicate calculus, Z-Eves incorporates schemas, set theory, and various refinement calculus elements to address non-functional properties and concurrent behavior. Its extensible framework includes a rich mathematical toolkit with axioms, theorems, and logical inference rules, empowering users to animate proofs and streamline the design process with adaptive tool support.
Enhancing Formal Verification with Z-Eves: A Comprehensive Toolkit for Theorem Proving
E N D
Presentation Transcript
Z and Z-Eves Adalberto Cajueiro de Farias
Z Notation • Model-Based Language • Mathematical Logic • First-Order Predicate Calculus • Schemas • Set theory • Generators, operators, power sets. • Associated Refinement Calculus • Not intended to model • Non-functional properties • Timed or concurrent behaviour • Contemplates only one aspect of design
Tool Support • Theorem Proving • Z-Eves • Proof Power • Animation • ZANS • Possum • ZETA • ...
Z-Eves • Theorem prover based on Z • Underlying theory: • Set theory • Z constructions • Schemas, operators, ... • Mathematical toolkit: • Axioms (extensible) • Theorems (extensible) • Logical rules • Inference rules