13. A computer system comprising: a logical processor; a memory in operable communication with the logical processor; a call graph residing in the memory and having nodes which represent procedures in a program; intermediate language representations of at least some of the procedures; previous dataflow values of at least some of the procedures from at least one of the following dataflow analyses: a constant propagation analysis, a range propagation analysis, a memory alignment analysis, an exception throw analysis, a top-down analysis, a bottom-up analysis; a set BS of basis procedures which has been defined to include at least one of the following: a procedure having a source code which has been edited subsequent to a most recent compilation of the procedure, a procedure which has been previously presented through dataflow analysis as being impacted by one or more source code edits; and incremental inter-procedural dataflow analysis code residing in the memory which upon execution presents a set IS of procedures to be recompiled due to impact from one or more source code edits, based on at least some of the previous dataflow values, the set BS, at least some of the intermediate language representations, and at least a portion of the call graph; and wherein the incremental inter-procedural dataflow analysis code upon execution performs at least the following operations: loading a previous dataflow value for a source node of the call graph when the source node is unvisited and represents a non-recursive procedure; reading a current intermediate language representation of the source node's procedure; running a local dataflow analysis for the source node using (i) the source node's loaded dataflow value or dataflow value calculated when visiting the source node and (ii) current intermediate language representation, thereby producing a dataflow result of the source node; and merging the source node dataflow result into a dataflow value for a target node of the call graph and marking the source node as visited.
13. A computer system comprising: a logical processor; a memory in operable communication with the logical processor; a call graph residing in the memory and having nodes which represent procedures in a program; intermediate language representations of at least some of the procedures; previous dataflow values of at least some of the procedures from at least one of the following dataflow analyses: a constant propagation analysis, a range propagation analysis, a memory alignment analysis, an exception throw analysis, a top-down analysis, a bottom-up analysis; a set BS of basis procedures which has been defined to include at least one of the following: a procedure having a source code which has been edited subsequent to a most recent compilation of the procedure, a procedure which has been previously presented through dataflow analysis as being impacted by one or more source code edits; and incremental inter-procedural dataflow analysis code residing in the memory which upon execution presents a set IS of procedures to be recompiled due to impact from one or more source code edits, based on at least some of the previous dataflow values, the set BS, at least some of the intermediate language representations, and at least a portion of the call graph; and wherein the incremental inter-procedural dataflow analysis code upon execution performs at least the following operations: loading a previous dataflow value for a source node of the call graph when the source node is unvisited and represents a non-recursive procedure; reading a current intermediate language representation of the source node's procedure; running a local dataflow analysis for the source node using (i) the source node's loaded dataflow value or dataflow value calculated when visiting the source node and (ii) current intermediate language representation, thereby producing a dataflow result of the source node; and merging the source node dataflow result into a dataflow value for a target node of the call graph and marking the source node as visited. 16. The system of claim 13 , wherein the incremental inter-procedural dataflow analysis code analyzes less than five percent of the procedures in the program, dataflow results produced by the incremental inter-procedural dataflow analysis code are the same as dataflow results that would be produced by an exhaustive analysis of all procedures in the program, and recompilation of only the procedures in the set IS produces a program which has the same correctness and optimization characteristics as a version of the program produced by recompilation of all the procedures in the program.