Complexity of proving program correctness
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 459-474
- https://doi.org/10.1007/3-540-54415-1_59
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Reasoning about procedures as parameters in the language L4Information and Computation, 1989
- Some relationships between logics of programs and complexity theoryTheoretical Computer Science, 1988
- On static logics, dynamic logics, and complexity classesInformation and Control, 1984
- Languages which capture complexity classesPublished by Association for Computing Machinery (ACM) ,1983
- A characterization of Hoare's logic for programs with Pascal-like proceduresPublished by Association for Computing Machinery (ACM) ,1983
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom SystemsJournal of the ACM, 1979
- One-way log-tape reductionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- The Complexity of Finite Memory Programs with RecursionJournal of the ACM, 1978
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- Even Simple Programs Are Hard To AnalyzeJournal of the ACM, 1977