[1] de BOER F, BONSANGUE M, ROT J. Automated Verification of Recursive Programs with Pointers [C]//Lecture Notes in Computer Science: 7364 LNAI. Heidelberg: Springer Verlag, 2012: 149-163.
[2] BERTOT Y, CASTRAN P. Interactive Theorem Proving and Program Development [M]. Berlin: Springer Verlag, 2004.
[3] OWRE S, SHANKAR N, RUSHBY J M, et al. PVS Language Reference [EB/OL]. [2014-09-10]. http://www.docin.com/p.454926227.html.
[4] NERON P. Square Root and Division Elimination in PVS [C]//Lecture Notes in Computer Science: 7998 LNCS. Heidelberg: Springer Verlag, 2013: 457-462.
[5] DUAN Z. Temporal Logic and Temporal Logic Programming [M]. Beijing: Science Press of China, 2006.
[6] TANG C S. A Temporal Logic Language Oriented toward Software Engineering-Introduction to XYZ System (I) [J]. Chinese Journal of Advanced Software Research, 1994, 1(1): 1-27.
[7] LAMPORT L. The Temporal Logic of Actions [J]. ACM Transactions on Programming Language and Systems, 1994, 16(3): 872-923.
[8] MOSZKOWSKI B. Executing Temporal Logic Programs [D]. Cambridge: Cambridge University, 1986.
[9] YANG X, DUAN Z, MA Q. Axiomatic Semantics of Projection Temporal Logic Programs [J]. Mathematical Structures in Computer Science, 2010, 20(5): 865-914.
[10] 张南, 段振华. 进位保留加法器的命题投影时序逻辑组合验证 [J]. 西安电子科技大学学报, 2012, 39(5): 192-196.
ZHANG Nan, DUAN Zhenhua. Compositional Verification of a Carry-save Adder with the Propositional Projection Temporal Logic [J]. Journal of Xidian University, 2012, 39(5): 192-196.
[11] 逄涛, 段振华, 刘晓芳. Verilog程序的命题投影时序逻辑符号模型检测[J]. 西安电子科技大学学报, 2014, 41(2): 79-84.
PANG Tao, DUAN Zhenhua, LIU Xiaofang. Symbolic Model Checking of Verilog Programs with The Propositional Projection Temporal Logic [J]. Journal of Xidian University, 2014, 41(2): 79-84.
[12] LAMPORT L. A New Solution of Dijkstra's Concurrent Programming Problem [J]. Communications of the ACM, 1974, 17(8): 453-455.
[13] DUAN Z H, TIAN C, YANG M F, et al. Bounded Model Checking for Propositional Projection Temporal Logic [C]//Lecture Notes in Computer Science: 7936 LNCS. Heidelberg: Springer Verlag, 2013: 591-602. |