The complexity of verifying functional programs
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 428-439
- https://doi.org/10.1007/3-540-56503-5_43
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the existence of effective Hoare logicsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Complexity of proving program correctnessPublished by Springer Nature ,1991
- Reasoning about procedures as parameters in the language L4Information and Computation, 1989
- A Hoare Calculus for functions defined by recursion on higher typesPublished by Springer Nature ,1985
- On static logics, dynamic logics, and complexity classesInformation and Control, 1984
- Effective Axiomatizations of Hoare LogicsJournal of the ACM, 1983
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom SystemsJournal of the ACM, 1979
- 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