US 11,656,869 B2
Using big code to construct code conditional truth tables
Andrew C. M. Hicks, Wappingers Falls, NY (US); Michael E. Gildein, Wappingers Falls, NY (US); and Daniel Nicolas Gisolfi, Hopewell Junction, NY (US)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Nov. 15, 2021, as Appl. No. 17/526,760.
Application 17/526,760 is a continuation of application No. 16/842,191, filed on Apr. 7, 2020, granted, now 11,226,815.
Prior Publication US 2022/0075619 A1, Mar. 10, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 8/75 (2018.01); G06F 9/445 (2018.01)
CPC G06F 8/75 (2013.01) [G06F 9/44589 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method of analyzing redundancies in code with multiple programmers responsible for generating the code, the method comprising:
receiving sections of the code from a first portion of each of the multiple programmers in parallel and from a second portion of each of the multiple programmers in series; and
executing a method of analyzing the code by:
generating an abstract representation of the code;
identifying conditional statements in the abstract representation;
populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement;
assessing the truth table for each conditional statement to identify instances in which unreachable code regions, defined as those regions of the code that will never run based on a logical construction of earlier and later conditional statements, are present in the code; and
issuing signals comprising proposed changes to the code to address and correct the instances separately to the first portion and the second portion of each of the multiple programmers.