Indradeep T Ghosh, Age 5318870 Barnhart Ave, Cupertino, CA 95014

6823486, Nov 23, 2004

May 8, 2001

09/851708

Indradeep Ghosh - San Jose CA

Fujitsu Limited - Kawasaki

G01R 313183

714738

Test patterns are generated by generating assignment decision diagrams that represent a register transfer level digital circuit. A nine-valued symbolic algebra is used in which objectives are determined for portions identified in the assignment decision diagram. The objectives are justified and propagated by traversing the assignment decision diagram in which a test environment is found. Heuristics are used if a test environment is not initially found. Using the test environment found, predetermined test vectors are propagated to obtain a system-level test set. Each test set for each portion are concatenated to obtain a complete test set for the register transfer level digital circuit.

6877141, Apr 5, 2005

Apr 1, 2003

10/405767

Indradeep Ghosh - San Jose CA, US
Koichiro Takayama - Cupertino CA, US
Liang Zhang - Blacksburg VA, US

Fujitsu Limited - Kawasaki

G06F017/50

716 4, 716 5, 716 18

Evaluating a validation vector includes receiving a network having nodes and a target set that includes one or more nodes of the network. The following steps are repeated until the nodes of the target set have been selected. A node is selected from the target set, and a tag is assigned to the node, where the tag represents an error of a value of a variable corresponding to the node. A test environment specifying a propagation path from an input, through the node, and to an output is generated. The test environment is translated into a validation vector, and the tag is propagated to the output according to the validation vector. After repeating the steps, coverage for the validation vectors is determined in accordance with the propagation to evaluate the one or more validation vectors.

7139929, Nov 21, 2006

Apr 1, 2003

10/405768

Indradeep Ghosh - San Jose CA, US
Liang Zhang - Blacksburg VA, US

Fujitsu Limited - Kawasaki

G06F 11/00

714 4

Generating a test environment includes accessing initial test environments for a network of nodes, where a test environment specifies a propagation or justification path for a node. The following are repeated until satisfactory coverage is achieved or until a predetermined number of iterations is reached. A coverage for each test environment is calculated, and at least two of the test environments are mated to generate next test environments, where the coverage of the at least two test environments is greater than the coverage of the other test environments.

7168014, Jan 23, 2007

Apr 1, 2003

10/405766

Indradeep Ghosh - San Jose CA, US
Koichiro Takayama - Cupertino CA, US
Liang Zhang - Blacksburg VA, US

Fujitsu Limited - Kawasaki

G01R 31/28

714712, 716 4

Propagating an error through a network includes receiving a network having propagation paths and nodes, where a propagation path has one or more nodes and a node is associated with a variable operable to have a value during simulation. A tag of a tag set is assigned to the value. The tag set includes at least two signed tags, positive tag representing a positive error and a negative tag representing a negative error, and an unsigned tag representing an error having an unknown sign. The tag is propagated along the propagation path to yield intermediate tags, where at least one intermediate tag is an unsigned tag formed from at least two signed tags. A final tag is determined in accordance with the intermediate tags in order to propagate an error through the network.

7210128, Apr 24, 2007

Oct 14, 2002

10/270835

Farzan Fallah - San Jose CA, US
Indradeep Ghosh - San Jose CA, US

Fujitsu Limited - Kawasaki

G06F 9/44
G06F 9/45
G06F 17/00
G06F 7/00

717135, 717124, 717143, 717154, 707102, 7071041

A method for event-driven observability enhanced coverage analysis of a program parses a program into variables and data dependencies, wherein the data dependencies comprise assignments and operations. The method builds a data structure having multiple records, with each record having at least one data dependency, a parent node, and a child node. Each node is linked to a variable. The method computes the value of each variable using the data structure. The method performs tag propagation based, at least in part, on the data dependencies and computed values.

7458046, Nov 25, 2008

Jul 19, 2005

11/185231

Indradeep Ghosh - San Jose CA, US
Mukul R. Prasad - Sunnyvale CA, US

Fujitsu Limited - Kawasaki

G06F 17/50

716 5, 716 4, 716 6, 714738

Estimating the difficulty level of a verification problem includes receiving input comprising a design and properties that may be verified on the design. Verification processes are performed for each property on the design. A property verifiability metric value is established for each property in accordance with the verification processes, where a property verifiability metric value represents a difficulty level of verifying the property on the design. A design verifiability metric value is determined from the property verifiability metric values, where the design verifiability metric value represents a difficulty level of verifying the design.

7685471, Mar 23, 2010

Feb 1, 2007

11/670143

Sreeranga P. Rajan - Sunnyvale CA, US
Oksana Tkachuk - Palo Alto CA, US
Mukul R. Prasad - San Jose CA, US
Indradeep Ghosh - San Jose CA, US

Fujitsu Limited - Kawasaki

G06F 11/00

714 38, 717124, 717126

A method for detecting software defects includes selecting from a target program comprising a plurality of modules a first module for evaluation and isolating the first module. The method also includes iteratively performing the following steps until the first module has been reduced such that a validation program is able to determine whether the first module contains a defect: generating an environment surrounding the first module, the generated environment preserving at least one external constraint on the first module; reducing the size of the first module; and reducing the number of program states associated with the first module.

8271953, Sep 18, 2012

Mar 12, 2008

12/046736

Mukul R. Prasad - San Jose CA, US
Indradeep Ghosh - San Jose CA, US
Sreeranga P. Rajan - Sunnyvale CA, US

Fujitsu Limited - Kawasaki

G06F 9/44

717126, 717124, 717131

In accordance with a particular embodiment of the present invention, a method is offered that includes supporting requirement validation middleware and capturing global requirements or properties for one or more web applications. A template-based formalism is employed to capture the requirements or properties. A small set of relevant temporal patterns are provided from which to choose in capturing the global requirements or properties. In specific embodiments, the method uses a set of pre-coded semi-configurable checkers. A Java-like syntax is used to specify expressions. A library of atomic entities or events (to compose expressions) is automatically generated. In still other embodiments, a small set of light-weight automatically-customizable checkers are employed in capturing the global requirements or properties. The method can be used with both formal and semi-formal techniques.