发明名称 |
Dataflow algorithm for symbolic computation of lowest upper bound type |
摘要 |
<p>A method, computer program, signal transmission, apparatus and system verify instructions in a module of a computer program to be dynamically linked with at least one other module. First it is determined whether checking an instruction in a first module which is loaded requires a lowest upper bound (LUB) class of at least two referenced classes in one or more referenced modules different than the first module. If such information is required, a constraint for the referenced module is written without loading the referenced module. The constraint is of the form "the set of at least two classes inherits from a specified class."</p> |
申请公布号 |
EP1056005(B1) |
申请公布日期 |
2013.05.01 |
申请号 |
EP20000304321 |
申请日期 |
2000.05.22 |
申请人 |
ORACLE AMERICA, INC. |
发明人 |
BRACHA, GILAD;LIANG, SHENG;LINDHOLM, TIMOTHY G. |
分类号 |
G06F9/445;G06F9/54;G06F11/00 |
主分类号 |
G06F9/445 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|