arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0707.0926cs.LOcs.PL
收藏

程序设计语言语义中的定理证明支持

Theorem proving support in programming language semantics

Yves Bertot

摘要:

我们描述了几种观点的语义的一个简单的程序设计语言的正式文件中的演算的归纳结构,可以验证的Coq证明系统。涵盖的方面是自然语义、指称语义、公理语义和抽象解释。递归函数的描述也在适当的时候提供,从而产生一个验证条件生成器和一个静态分析器,可以在定理证明器内运行,用于反射证明。还描述了从指称语义提取解释器。所有不同的方面都被正式证明是合理的自然语义规范。

英文摘要:

We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verification condition generator and a static analyser that can be run inside the theorem prover for use in reflective proofs. Extraction of an interpreter from the denotational semantics is also described. All different aspects are formally proved sound with respect to the natural semantics specification.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑