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.
No takes yet. Share an insight, caveat, or question.
Manna et al. (1970) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: