20. In an appropriately programmed digital computer, a method for analyzing source code comprising the steps of: inputting a source code file into said computer, said source code file containing a plurality of source statements; translating said plurality of source statements into a plurality of intermediate-language (IL) statements disposed within an IL file, said IL file being held in memory in said computer; constructing a plurality of data structures from said plurality of IL statements, each data structure containing at least one of said IL statements and providing connectivity to neighboring IL statements; partitioning said plurality of IL statements into a plurality of segments, wherein each segment includes at least one IL statement; traversing said plurality of IL statements in reverse executable order pursuant to said connectivity; and generating a plurality of weakest preconditions for said plurality of segments, wherein said plurality of weakest preconditions may be logically combined to form a single weakest precondition representing multiple segments.
20. In an appropriately programmed digital computer, a method for analyzing source code comprising the steps of: inputting a source code file into said computer, said source code file containing a plurality of source statements; translating said plurality of source statements into a plurality of intermediate-language (IL) statements disposed within an IL file, said IL file being held in memory in said computer; constructing a plurality of data structures from said plurality of IL statements, each data structure containing at least one of said IL statements and providing connectivity to neighboring IL statements; partitioning said plurality of IL statements into a plurality of segments, wherein each segment includes at least one IL statement; traversing said plurality of IL statements in reverse executable order pursuant to said connectivity; and generating a plurality of weakest preconditions for said plurality of segments, wherein said plurality of weakest preconditions may be logically combined to form a single weakest precondition representing multiple segments. 22. The method of claim 20 further comprising the step of providing a defect predicate that represents an observed defect in said source code file; and wherein said step of generating a plurality of weakest preconditions is based upon an initial postcondition of said defect predicate, said generating step thereby providing information related to said observed defect.