Method for finding all valid interprocedural execution paths on COBOL in polynomial time
US9280446B2 · kind B2 · utility
1Cited by
2References
11Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 3, 2014 |
| Grant date | Mar 8, 2016 |
| Priority date | — |
| Expiry date | May 10, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F11/3612
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Disclosed are methods for finding all valid paths in a COBOL program. These methods are performed in polynomial time, allowing them to be scaled to accommodate large COBOL programs. As the methods find all valid paths in COBOL program code, by traversing and marking the nodes of the program upon being traversed. Accordingly, all usable and reachable code is indicated and marked. This increases safety when working with the code, as removal or alteration of such valid code is indicated, and thus, made unlikely.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.