OptumSoft, Inc.
Held is read from USPTO's recorded assignments; a transfer never recorded there does not appear.
4
Ending by 2030
May 2028
Next term end
When these terms end
Held patents by the year their term ends
20262027202820292030203120322033203420352036203720382039204020412042204320442045
Fee deadlines
Maintenance fees fall due 3.5, 7.5 and 11.5 years after grant. A missed fee ends a patent at the end of the six month grace period that follows, not on the due date.
- 1 fee due Jan 4, 2027The maintenance fee for Approximate matching (US 11,693,860) comes due Jan 4, 2027. Unpaid by Jul 6, 2027, it lapses early.
- 2 fees due Feb 1 to 8, 2027 · next Feb 1
- 2 fees due Apr 8 to 13, 2027 · next Apr 8
- 1 fee due Jun 26, 2027The maintenance fee for Using a lane-structured dynamic environment for rule-based automated control (US 11,853,777) comes due Jun 26, 2027. Unpaid by Dec 27, 2027, it lapses early.
- 1 fee due Aug 16, 2027The maintenance fee for Interpreter-based program language translator using embedded interpreter types and variables (US 9,262,135) comes due Aug 16, 2027. Unpaid by Feb 16, 2028, it lapses early.
- 1 fee due Oct 19, 2027The maintenance fee for Constraint-based consistency with snapshot isolation (US 9,317,549) comes due Oct 19, 2027. Unpaid by Apr 19, 2028, it lapses early.
Recent changes
Nothing was recorded against this company's patents in the last 90 days.
Patents held now
Soonest term end first. Each date below is computed on that patent's own page, which shows the rule, the adjustments and the fee history it was derived from.
| Patent | Title | Status | Expires | Confidence |
|---|---|---|---|---|
| US 9,411,563 | Notification-based constraint set translation to imperative execution In force · From the USPTO record | In force | From the USPTO record | |
| US 8,972,950 | Efficient automated translation of procedures in an constraint-based programming language implemented with notification and callback In force · From the USPTO record | In force | From the USPTO record | |
| US 9,262,135 | Interpreter-based program language translator using embedded interpreter types and variables In force · From the USPTO record | In force | From the USPTO record | |
| US 10,025,572 | Dynamic collection attribute-based computer programming language methods In force · From the USPTO record | In force | From the USPTO record | |
| US 8,214,795 | Efficient automated translation of procedures in constraint-based language In force · From the USPTO record | In force | From the USPTO record | |
| US 8,850,409 | Notification-based constraint set translation to imperative execution In force · From the USPTO record | In force | From the USPTO record | |
| US 9,158,519 | Dynamic collection attribute-based computer programming language methods In force · From the USPTO record | In force | From the USPTO record | |
| US 8,799,877 | Interpreter-based program language translator using embedded interpreter types and variables In force · From the USPTO record | In force | From the USPTO record | |
| US 10,243,855 | Efficient reliable distributed flow-controlled event propagation In force · From the USPTO record | In force | From the USPTO record | |
| US 9,805,088 | Constraint-based consistency with snapshot isolation In force · From the USPTO record | In force | From the USPTO record |
Sources and methods
Compiled from the USPTO record, grants, published applications and recorded assignments, not yet reviewed by hand.
How this record was built
Computed patent terms end on the dates shown. Related patents and pending applications may cover overlapping subject matter.
Published applications
US patent applications published under this name that have not become patents. An application is published about eighteen months after its earliest filing; one that has not been published is in no public record.
6 pending · 1 abandoned · 1 no status recorded