Patent Assignment Abstract of Title
NOTE:Results display only for issued patents and published applications.
For pending or abandoned applications please consult USPTO staff.
|
Total Assignments:
1
|
|
Patent #:
|
|
Issue Dt:
|
04/04/2006
|
Application #:
|
10173453
|
Filing Dt:
|
06/14/2002
|
|
Publication #:
|
|
Pub Dt:
|
12/18/2003
| | | | |
|
Inventors:
|
Alan Hartman, Andrei Kirshin, Sergey Olvovsky, Kenneth Nagin
|
|
Title:
|
REDUCING THE COMPLEXITY OF FINITE STATE MACHINE TEST GENERATION USING COMBINATORIAL DESIGNS
|
|
|
Assignment:
1
|
|
|
|
|
|
|
ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS).
|
|
|
|
|
|
|
|
|
| NEW ORCHARD ROAD |
| ARMONK, NEW YORK 10504 |
|
|
|
|
| IBM CORPORATION |
| STEPHEN C. KAUFMAN |
| INTELLECTUAL PROPERTY LAW |
| P.O. BOX 218 |
| YORKTOWN HEIGHTS, NY 10598 |
|
|
Search Results as of:
09/28/2024 08:05 AM
If you have any comments or questions concerning the data displayed,
contact
PRD / Assignments at 571-272-3350. v.2.6
Web interface last modified:
August 25, 2017 v.2.6
|
