Complexity of Proving Program Correctness
暂无分享,去创建一个
[1] Edmund M. Clarke,et al. Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems , 1979, JACM.
[2] Joseph Y. Halpern,et al. Reasoning about Procedures as Parameters in the Language L4 , 1989, Inf. Comput..
[3] Jerzy Tiuryn,et al. The Hierarchy of Finitely Typed Functional Programs (Short Version) , 1987, LICS.
[4] Andreas Goerdt. Characterizing Complexity Classes by General Recursive Definitions in Higher Types , 1992, Inf. Comput..
[5] Ernst-Rüdiger Olderog,et al. A characterization of Hoare's logic for programs with Pascal-like procedures , 1983, STOC.
[6] Neil Immerman,et al. One-way log-tape reductions , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[7] Neil D. Jones,et al. The Complexity of Finite Memory Programs with Recursion , 1978, JACM.
[8] Jerzy Tiuryn,et al. Some Relationships Between Logics of Programs and Complexity Theory , 1988, Theor. Comput. Sci..
[9] Neil D. Jones,et al. Even Simple Programs Are Hard To Analyze , 1975, JACM.
[10] David Peleg,et al. On Static Logics, Dynamic Logics, and Complexity Classes , 1984, Inf. Control..
[11] Edmund M. Clarke. The characterization problem for Hoare logics , 1984 .
[12] Andreas Goerdt,et al. A Hoare Calculus for Functions Defined by Recursion on Higher Types , 1985, Logic of Programs.
[13] Neil Immerman. Languages which capture complexity classes , 1983, STOC '83.
[14] Stephen A. Cook,et al. Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..