Abstract
The problems of convergence, correctness, and equivalence of computer programs can be formulated by means of the satisfiability or validity of certain first-order formulas. An algorithm is presented for constructing such formulas for functional programs, i.e. programs defined by LISP-like conditional recursive expressions. © 1970, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Manna, Z., & Pnueli, A. (1970). Formalization of Properties of Functional Programs. Journal of the ACM (JACM), 17(3), 555–569. https://doi.org/10.1145/321592.321606
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free