首页>
外国专利>
Dataflow algorithm for symbolic computation of lowest upper bound type
Dataflow algorithm for symbolic computation of lowest upper bound type
展开▼
机译:最低上限类型符号计算的数据流算法
展开▼
页面导航
摘要
著录项
相似文献
摘要
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."
展开▼