Rule-based method for testing of programming segments
US5297150A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Jun 17, 1992 |
| Grant date | Mar 22, 1994 |
| Priority date | — |
| Expiry date | Jun 17, 2012 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S706/922
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for determining a set of f low paths in a code listing that are most likely to fail comprises the steps of: converting the code listing to a directed acyclic graph representation, the representation including nodes and directed edges, each node representing a basic block of unconditional code statements. The method loads, as facts into a knowledge base, representations of the nodes and edges, and unconditional statements from the basic blocks. The method also loads, as rules into the knowledge base, conditional statements and complexity indicator values for conditional and unconditional statements. Weights are assigned to each node based upon complexity indicator values for statements associated with the node. A determination is then made of a set of flow paths through the code listing, each path ranked in order of assigned weights, those flow paths with larger assigned weights being assumed as those paths most likely to fail.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.