Pre-Grant Publication Number: 20080301712
Verification of loadable objects
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application. Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.

Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Annotations(0)
#440Jacoby/Basic Computing Arts patent
Applies to Claims 1,10,11,12,13,14,15,16,17,18,19,2,20,3,4,5,6,7,8,9
Submitted by: Conrad HerrmannLast updated: almost 4 years ago
0 thumbs up 0 thumbs down
Summary / Description
Summary / DescriptionBasic Computing Arts was issued patent 3931504 in 1973 which describes computing the statistical base (or checksum) of problem steps loaded from a library device, comparing the resulting value with a value in a sum file, and taking appropriate action if a difference is found.
 
Basic Information
Type of Prior ArtIssued Patents - US
 
CountryUnited States of America
 
Patent/Application #3931504
 
Kind CodeUnited States (US) - United STATES Patent - A
 
Patentee NameEd Jacoby
 
Relevant Pages, Columns, or LinesColumn 8 line 41 through colum
 
URL
 
Filing DateDecember 12, 1973
 
Additional Information
 
Notes / To Do
Notes
 
Excerpt
Excerpt
Col 8, line 50: To perform the checksum technique, a questionable copy taken from the library device during initial program load (IPL) ... is resubjected to the same statistical analysis ... as was applied to the base copy. If differences are found, an illegitimate copy is assumed and a predetermined counteraction may be initiated.
 
Relevance
Claims
1
A method comprising:receiving a request from an application to load a first loadable object into memory;calculating a first signature value for the first loadable object; andloading the first loadable object into memory if the first signature value matches one of a plurality of signature values, each of the plurality of signature values being associated with a distinct loadable object.
Relevance
The Jacoby patent description includes all the steps of the method.
The Jacoby patent description includes all the steps of the method.
Claim Chart
All
2
The method of Claim 1, wherein the first signature value matches one of the plurality of signature values if the first loadable object is an unmodified one of the plurality of distinct loadable objects.
Relevance
The Jacoby patent describes keeping a collection of acceptable checksums in a file, called the sum file.
The Jacoby patent describes keeping a collection of acceptable checksums in a file, called the sum file.
Claim Chart
All
3
The method of Claim 1, further comprising:if the first signature value does not match one of the plurality of signature values, notifying a user that the first loadable object cannot be loaded.
Relevance
The Jacoby patent describes a mechanism for alerting the operator.
The Jacoby patent describes a mechanism for alerting the operator.
Claim Chart
All
4
The method of Claim 3, further comprising:generating a log of loadable objects that failed to load.
Relevance
The Jacoby patent describes recording the security alerts (on paper print out or on magnetic tape).
The Jacoby patent describes recording the security alerts (on paper print out or on magnetic tape).
Claim Chart
All
5
The method of Claim 1, wherein the first loadable object is at least one of a program, an application dynamic link library (dll), and a device driver.
Relevance
The Jacoby patent uses the term "problem steps" loaded from a "library device", which, while they are structurally different due to being from a different generation of software, can be functionally equivalent.
The Jacoby patent uses the term "problem steps" loaded from a "library device", which, while they are structurally different due to being from a different generation of software, can be functionally equivalent.
Claim Chart
All
6
The method of Claim 1, further comprising:calculating the plurality of signature values.
Relevance
The Jacoby patent describes the method of computing the checksum values from the "base copy" of the original unmodified files.
The Jacoby patent describes the method of computing the checksum values from the "base copy" of the original unmodified files.
Claim Chart
All
7
The method of Claim 1, further comprising:storing the plurality of signature values in a storage device.
Relevance
In the Jacoby patent, the check sum file is stored in a storage device.
In the Jacoby patent, the check sum file is stored in a storage device.
Claim Chart
All
8
The method of Claim 1, wherein each of the plurality of signature values is one of a cyclic redundancy check, a checksum, and a cryptographic hash of a loadable object.
Relevance
In the Jacoby patent, the statistical base of the file is equivalent to the term signature value in this patent, in that it allows use of different algorithms to compute the value, including a checksum function or other hash functions. It describes the characteristics of the expected function.
In the Jacoby patent, the statistical base of the file is equivalent to the term signature value in this patent, in that it allows use of different algorithms to compute the value, including a checksum function or other hash functions. It describes the characteristics of the expected function.
Claim Chart
All
9
A machine-accessible storage medium including instructions that, when executed by a machine, cause the machine to perform a method, comprising:receiving a request from an application to load a first loadable object into memory;calculating a first signature value for the first loadable object; andloading the first loadable object into memory if the first signature value matches one of a plurality of signature values, each of the plurality of signature values being associated with a distinct loadable object.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
10
The machine-accessible storage medium of Claim 9, wherein the first signature value matches one of the plurality of signature values if the first loadable object is an unmodified one of the plurality of distinct loadable objects.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
11
The machine-accessible storage medium of Claim 9, the method further comprising:if the first signature value does not match one of the plurality of signature values, notifying a user that the first loadable object cannot be loaded.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
12
The machine-accessible storage medium of Claim 11, the method further comprising:generating a log of loadable objects that failed to load.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
13
The machine-accessible storage medium of Claim 9, wherein the first loadable object is at least one of a program, an application dynamic link library (dll), and a device driver.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
14
The machine-accessible storage medium of Claim 9, the method further comprising:storing the plurality of signature values in a storage device.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
15
A computing apparatus comprising:a signature value generator to calculate a plurality of signature values, each of the plurality of signature values being calculated for one of a plurality of distinct loadable objects, and to store the plurality of signature values in a storage device;a comparator connected with the signature value generator, the comparator to compare a first signature value associated with a first loadable object to the plurality of signature values stored in the storage device; anda loader connected with a main memory and the comparator, the loader to receive a request to load the first loadable object into the main memory, and to load the first loadable object into the main memory if a first signature value associated with the first loadable object matches one of the plurality of signature values.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
16
The computing apparatus of Claim 15, wherein the first signature value matches one of the plurality of signature values if the first loadable object is an unmodified one of the plurality of distinct loadable objects.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
17
The computing apparatus of Claim 15, wherein the comparator is configured to notify a user that the first loadable object cannot be loaded if the first signature value does not match one of the plurality of signature values.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
18
The computing apparatus of Claim 15, wherein the comparator is configured to generate a log of loadable objects that failed to load.
Relevance
The Jacoby patent describes a computer with alert output that implements the method.
The Jacoby patent describes a computer with alert output that implements the method.
Claim Chart
All
19
The computing apparatus of Claim 15, wherein the first loadable object is at least one of a program, an application dynamic link library (dll), and a device driver.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
20
The computing apparatus of Claim 15, wherein the signature value generator to calculate the first signature value for the first loadable object.
Relevance
The Jacoby patent describes a computer that implements the method.
The Jacoby patent describes a computer that implements the method.
Claim Chart
All
0 days left
Activity
Application
Discussion (4)
Prior Art (4)
Research (0)
Subscribe to this Community
Invite a Reviewer
HOW TO USE PEER TO PATENT
Peer To Patent Videos