首页| English| 中国科学院

Automation in interactive theorem proving

副标题:

时间:2017-06-16  来源:数学机械化重点实验室

题目:           Automation in interactive theorem proving

报告人:      Bohua Zhan (MIT, USA)

时间地点:   2017.06.19  14:00pm  N202

摘要:          Interactive theorem proving involves using proof assistants to verify, with human guidance, proofs of either mathematical theorems or correctness of computer programs. In this talk, I will give a brief overview of the history of this field, with an emphasis on automation techniques. I will then discuss my own work on a new heuristic theorem prover called auto2 for the proof assistant Isabelle.

相关附件
相关文档