Open Access
2014 Formal Proof of a Machine Closed Theorem in Coq
Hai Wan, Anping He, Zhiyang You, Xibin Zhao
J. Appl. Math. 2014(SI11): 1-9 (2014). DOI: 10.1155/2014/892832


The paper presents a formal proof of a machine closed theorem of TLA+ in the theorem proving system Coq. A shallow embedding scheme is employed for the proof which is independent of concrete syntax. Fundamental concepts need to state that the machine closed theorems are addressed in the proof platform. A useful proof pattern of constructing a trace with desired properties is devised. A number of Coq reusable libraries are established.


Download Citation

Hai Wan. Anping He. Zhiyang You. Xibin Zhao. "Formal Proof of a Machine Closed Theorem in Coq." J. Appl. Math. 2014 (SI11) 1 - 9, 2014.


Published: 2014
First available in Project Euclid: 1 October 2014

zbMATH: 1405.68316
MathSciNet: MR3193638
Digital Object Identifier: 10.1155/2014/892832

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI11 • 2014
Back to Top