Fully lazy linking with module-by-module verification

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 9/40 (2006.01) G06F 9/445 (2006.01)

Patent

CA 2309772

A method, computer program, signal transmission and apparatus verify instructions in a module of a computer program during linking using pre-verification constraints with fully lazy loading. It is first determined whether a first module which is loaded has passed verification one-module-at-a-time before linking. If the first module has passed verification, a pre-verification constraint on a constrained module is read, if any. It is then determined if the constrained module is loaded, if any pre-verification constraint is read. If the constrained module is not already loaded, the pre-verification constraint is retained as a verification constraint.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Fully lazy linking with module-by-module verification does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fully lazy linking with module-by-module verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fully lazy linking with module-by-module verification will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1448869

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.