Abstract: By a formalizing description to the construction of logic compound sentences in the process of decompilation，a novel algorithm is proposed in course of software reverse engineering.It applies the logic diagram to the recognition of LCS which belongs to graph theory.In this way，the algorithm overcomes the shortcomings of some typical current recognition approaches.Furthermore，this paper introduces logical correlation matrices in the solution to the logic diagrams，and a dynamic pruning policy is executed in this course，by which the novel algorithm is greatly predigested.In the end of the paper，it offers a specific instance and the complexity analyses，which proves the validity and sophistication of the new algorithm.

Key words: decompilation, recognition algorithm, composite algorithm, logic compound sentences, logic diagram, logical correlation matrices, software reverse engineering

摘要： 在进行软件逆向工程的过程中，对C反编译后的逻辑分支语句结构进行了形式化的描述，将图论领域中的与或图概念应用到逻辑分支语句的识别上来，克服了相关识别算法的局限性。求解与或图的过程中，提出了逻辑关联矩阵的概念，通过执行动态剪枝策略，大大简化了算法复杂度。最后给出算法实例和复杂度分析，验证了算法的正确性和有效性。

关键词: 反编译, 识别算法, 复合算法, 逻辑分支语句, 与或图, 逻辑关联矩阵, 软件逆向工程, ,