论文信息 - The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods - 字舞流文

The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods

Ildikó Sain | I. Sain

[1] Ildikó Sain. A Simple Proof for the Completeness of Floyd's Method , 1985, Theor. Comput. Sci..

[2] L. Csirmaz,et al. On the Strength of "Sometimes" and "Always" in Program Verification , 1984, Inf. Control..

[3] Ildikó Sain,et al. A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I , 1982, Theor. Comput. Sci..

[4] István Németi,et al. Nonstandard Dynamic Logic , 1981, Logic of Programs.

[5] László Csirmaz. On the completeness of proving partial correctness , 1981, Acta Cybern..

[6] L. Csirmaz. Programs and Program Verifications in a General Setting , 1981, Theor. Comput. Sci..

[7] Zohar Manna,et al. The Modal Logic of Programs , 1979, ICALP.

[8] Kenneth A Bowen,et al. Model Theory for Modal Logic: Kripke Models for Modal Predicate Calculi , 1979 .

[9] Kenneth A. Bowen,et al. Model theory of modal logic , 2007, Handbook of Modal Logic.

[10] Tamás Gergely,et al. On the incompleteness of proving partial correctness , 1978, Acta Cybern..

[11] Amir Pnueli,et al. The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12] Rod M. Burstall,et al. Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.