Research on the Composite Arithmetic of Logic Compound Sentences in Decompilation

This article had a formalizing description to the structure of logic compound sentences (LCS) in the course of decompilation. It applied the Logic diagram to the recognition of LCS which belongs to graph theory. The recognition arithmetic overcame the shortcomings of some typical current approaches. Furthermore, this article introduced logical correlation matrices in the solution to the Logic diagrams, and a dynamic pruning policy was executed in this course by which the novel arithmetic was greatly predigested. In the end of the article, it offered a specific instance and had the complexity analyses, which proved the validity and sophistication of the new arithmetic separately.