Formalization of Linear Space Theory in the Higher-Order Logic Proving System

@article{Zhang2013FormalizationOL,
  title={Formalization of Linear Space Theory in the Higher-Order Logic Proving System},
  author={Jie Zhang and Danwen Mao and Yong Guan},
  journal={J. Appl. Math.},
  year={2013},
  volume={2013},
  pages={218492:1-218492:6}
}
Theorem proving is an important approach in formal verification. Higher-order logic is a form of predicate logic that is distinguished from first-order logic by additional quantifiers and stronger semantics. Higher-order logic is more expressive. This paper presents the formalization of the linear space theory in HOL4. A set of properties is characterized in HOL4. This result is used to build the underpinnings for the application of higher-order logic in a wider spectrum of engineering… 
2 Citations

Figures from this paper

Formal analysis of the kinematic Jacobian in screw theory
TLDR
This work is the first to formally analyze the kinematic Jacobian using theorem proving, and the formal modeling and analysis of the Stanford manipulator demonstrate the effectiveness and applicability of the proposed approach to the formal verification of theKinematic properties of robotic manipulators.
Formal Kinematic Analysis of a General 6R Manipulator Using the Screw Theory
TLDR
Based on the screw theory in HOL4, which is newly developed by the research institute, the geometrical theory of HOL4 is utilized to develop formal reasoning support for the kinematic analysis of a robotic manipulator.

References

SHOWING 1-7 OF 7 REFERENCES
A Brief Overview of HOL4
TLDR
The HOLF proof assistant supports specification and proof in classical higher order logic and how it may be applied in formal verification is given.
Theorem Proving with the Real Numbers
TLDR
HOL extends Church's system by allowing also 'type variables' which give a form of polymorphism, and is capable not only of deciding whether it has a type, but inferring a most general type for it if it does.
Formal modelling of the ADSP-2100 processor using HOL
  • A. Habibi, S. Tahar, A. Ghazel
  • Computer Science
    IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373)
  • 2002
TLDR
This paper describes formal modelling of the digital signal processors of the family ADSP-2100 using the HOL (Higher Order Logic) theorem prover and solves the problem of complexity related to the large number of parameters by using a structured method based on knowledge about the processor architecture.
Formalization of Fixed-Point Arithmetic in HOL
TLDR
It is shown by an example how this formalization can be used to enable the verification of the transition from floating-point to fixed-point algorithmic level in the signal processing design flow.
The HOL System TUTORIAL (for HOL Kananaskis-7)
  • 2011, http://cdnetworks-kr-1.dl.sourceforge.net/project/hol/hol/kananaskis-7/kananaskis-7-tutorial.pdf.
  • 2011
Advanced Algebra, Higher Education Press, Beijing, China
  • 1996
A brief overview of HOL 4 , ” in
  • Formal Methods in System Design
  • 2005