N.D. Jones and S.S. Muchnick, "Complexity of Flow Analysis, Inductive Assertion Synthesis, and a Language due to Dijkstra", in Proceedings 20 th Conference on Foundations of Computer Science, pp 185 - 190, also in, Program Flow Analysis: Theory and Applications, N.D. Jones and S.S. Muchnick (eds), Prentice-Hall, 1981.  Home/Search   Document Not in Database   Summary   Related Articles

.... For example, the operator augments the two unifiers [X=a; Y=b] X=c;Y=d] with [X=a; Y=d] X=c; Y=b] Intuitively, using cartesian closure corresponds to reasoning about a program using its variables 1 This approximation is also important, for efficiency reasons, in imperative languages [6]. as ranging over sets as opposed to individual values. It is for this reason, in fact, that the induced approximation is used to formalize types in logic programs. This is despite the fact that there are no known algorithms for inferring such types. That is, the approximate meanings of programs ....

N.D. Jones and S.S. Muchnick, "Complexity of Flow Analysis, Inductive Assertion Synthesis, and a Language due to Dijkstra", in Proceedings 20 th Conference on Foundations of Computer Science, pp 185 - 190, also in, Program Flow Analysis: Theory and Applications, N.D. Jones and S.S. Muchnick (eds), Prentice-Hall, 1981.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC