Using the coq theorem prover to verify complex data structure invariants.
Kenneth RoeScott F. SmithPublished in: MEMOCODE (2017)
Keyphrases
- theorem prover
- data structure
- first order logic
- theorem proving
- inference rules
- automated reasoning
- computer algebra
- automated theorem proving
- term rewriting
- formal proof
- complex systems
- formal semantics
- computer algebra systems
- higher order logic
- boolean algebra
- decision trees
- natural deduction
- predicate calculus
- real world
- efficient data structures
- natural language
- feature selection
- data mining