Formal Proof of a Machine Closed Theorem in Coq-Reference-Cited by-同舟云学术

Formal Proof of a Machine Closed Theorem in Coq

Published:2014 Issue: Volume:2014 Page:1-9
ISSN:1110-757X
Container-title:Journal of Applied Mathematics
language:en
Short-container-title:Journal of Applied Mathematics

Author:

Wan Hai¹,He Anping²,You Zhiyang³,Zhao Xibin¹

Affiliation:

1. School of Software, Tsinghua University, NLIST, KLISS, Beijing 100084, China

2. Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi University for Nationalities, Nanning, Guangxi 530006, China

3. General office of the Guangxi Zhuang Autonomous Region People’s Government, Nanning, Guangxi 530003, China

Abstract

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.

Funder

National Basic Research Program of China

Publisher

Hindawi Limited

Subject

Applied Mathematics

Link

http://downloads.hindawi.com/journals/jam/2014/892832.pdf

Reference9 articles.

1. The Specification Language TLA+

2. The temporal logic of actions

3. An old-fashioned recipe for real time

4. The existence of refinement mappings

5. An Axiomatization of Linear Temporal Logic in the Calculus of Inductive Constructions

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Delay-induced instabilities of stationary solutions in a single species nonlocal hyperbolic-parabolic population model;Discrete & Continuous Dynamical Systems - S;2020

2. Verification by Way of Refinement: A Case Study in the Use of Coq and TLA in the Design of a Safety Critical System;Lecture Notes in Computer Science;2016