Dataflow algorithm for symbolic computation of lowest upper...

Details Dataflow algorithm for symbolic computation of lowest upper... Dataflow algorithm for symbolic computation of lowest upper...

G - Physics

06

F

G06F 9/44 (2006.01) G06F 9/445 (2006.01)

Patent

CA 2309768

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."

Affiliated with

Also associated with

Rating

Dataflow algorithm for symbolic computation of lowest upper... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dataflow algorithm for symbolic computation of lowest upper..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dataflow algorithm for symbolic computation of lowest upper... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1488468