Programming interface for licensing

Information

  • Patent Grant
  • 10437964
  • Patent Number
    10,437,964
  • Date Filed
    Friday, October 24, 2003
    20 years ago
  • Date Issued
    Tuesday, October 8, 2019
    4 years ago
Abstract
A software licensing Application Programming Interface (API) that allows software products to use the license management functionality of a common service. A license specifies rights in a software product. The software product calls a consume method on the API in order to consume a right. If the right exists, the service binds the right to the license in which the right is found. The software product enforces the terms of the license by granting, or denying, access to some or all features depending on whether a valid instance of the right is found. Arbitrary data can be associated with a right. The API includes a method to retrieve data from a right that has been previously bound by the consume method.
Description
FIELD OF THE INVENTION

The present invention relates generally to the field of computer software, and, more particularly, to a programming interface that supports the enforcement of electronic licenses.


BACKGROUND OF THE INVENTION

Commercially-produced software has traditionally been made available under a license that defines the permissible terms of the software's use. When the practice of software licensing first began, the license generally took the form of a legal document that defined the user's rights with respect to the software. Such a document relied upon the legal system for enforcement. It has since become desirable for licenses to be enforced electronically—i.e., it is desirable that a computer program contain code that actively discourages or prevents use of the software in a manner that is contrary to the license.


Most software that provides for electronic license enforcement provides its own infrastructure to manage the licensing of the software and the use of the licenses. Thus, a typical commercial software product may include not only the code to perform the product's core function, but may also carry with it the code to obtain, evaluate, protect, and manage licenses for the software. For each software vendor to develop and incorporate this infrastructure into its software is often a wasteful duplication of effort. It is therefore desirable to provide a system that performs the basic functions related to software licensing, where the system can be used by a broad variety of software applications in a uniform and defined way.


In view of the foregoing, there is a need for a mechanism that overcomes the drawbacks of the prior art.


SUMMARY OF THE INVENTION

The present invention provides a software licensing Application Programming Interface (API) or callable interface that provides certain licensing functions for use by software products. A license service or licensing component performs functions relating to the use of licenses, and exposes these functions to software products through the API. The service performs functions such as obtaining licenses, storing and managing licenses, protecting licenses from tampering, evaluating a license's validity, and evaluating whether a license is correctly bound to the machine and/or software product on which it is used. The software is able to make use of this functionality by calling the methods of the API.


In a typical use of the API, a software product calls an “open” API method or handle-opening component in order to obtain a unique handle that is used by the license service to identify the application. The software product then calls a “consume right” API method or right-consumption component. “Consume,” in this context, means the exercise of a specified right. The call to the “consume right” method is parameterized by the software product's handle, and by the name of the right to be consumed. The license service then attempts to locate one or more valid, correctly bound licenses that contains the named right. If no such license exists, then the software product is notified of the failure. If such licenses exist, then the right is bound to one of the licenses, and the calling software product is notified of the binding. In such a case, the software product knows that the right exists, and can perform whatever functions are associated with this right.


In a preferred embodiment, the license service does not define what the software can or cannot do under the right, or enforce substantive constraints on the use of the software. Rather, the license service manages the licenses in such a way that a software product can determine by calling the API whether a right does, or does not, exist, so that the software can behave accordingly. For example, a right may be called “run,” indicating that the user has the right to run the software product. The software product can use the API to determine whether there is a valid (and correctly bound, and non-expired) right to run the software. However, if the API call returns with an indication that there is no right to run the software, it is up to the software to cease operation or take some other action based on the non-existence of this right.


A right may be associated with information, which becomes available after a successful call to the “consume right” method. For example, a given software product may have individual rules about when it is permissible to edit, print, save, etc., and these rules can be stored in the license that contains the right. The API provides a “get information” method or information-retrieval component that allows this information to be retrieved from the license.


Other features of the invention are described below.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing summary, as well as the following detailed description of preferred embodiments, is better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there is shown in the drawings exemplary constructions of the invention; however, the invention is not limited to the specific methods and instrumentalities disclosed. In the drawings:



FIG. 1 is a block diagram of an example computing environment in which aspects of the invention may be implemented;



FIG. 2 is a block diagram of an architecture in which a system performs licensing functions and exposes an API for use by software products;



FIG. 3 is a flow diagram of a method through which a software product uses a licensing API;



FIG. 4 is a flow diagram of a method by which a software product consumes a right; and



FIG. 5 is a flow diagram of a method by which a software product retrieves information relating to a consumed right.





DETAILED DESCRIPTION OF THE INVENTION

Overview


The use of commercial software is typically governed by a license, and it has become increasingly common for this license to be embodied in an electronic form that can be enforced by the software itself. One challenge in creating an electronic licensing system is that an infrastructure is needed to manage the use of the licenses. Replicating this infrastructure for every software product is cumbersome and wasteful. The present invention provides an API that allows different software products to use a common infrastructure that performs various licensing functions.


Exemplary Computing Arrangement



FIG. 1 shows an exemplary computing environment in which aspects of the invention may be implemented. The computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.


The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, embedded systems, distributed computing environments that include any of the above systems or devices, and the like.


The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Various terms, including component, method, service, interface, module, routine, and program, are used interchangeably to refer to a group of computer-executable instructions stored in a computer-readable medium. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network or other data transmission medium. In a distributed computing environment, program modules and other data may be located in both local and remote computer storage media including memory storage devices.


With reference to FIG. 1, an exemplary system for implementing the invention includes a general purpose computing device in the form of a computer 110. Components of computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120. The processing unit 120 may represent multiple logical processing units such as those supported on a multi-threaded processor. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus (also known as Mezzanine bus). The system bus 121 may also be implemented as a point-to-point connection, switching fabric, or the like, among the communicating devices.


Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removeable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CDROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.


The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.


The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 140 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156, such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.


The drives and their associated computer storage media discussed above and illustrated in FIG. 1, provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 1, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 20 through input devices such as a keyboard 162 and pointing device 161, commonly referred to as a mouse, trackball or touch pad. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195


The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.


When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on memory device 181. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.


Software Licensing Service



FIG. 2 shows an example system that provides a software licensing service 202. Software licensing service 202 operates inside of computer 110 (shown in FIG. 1). In one example, software licensing service 202 is part of an operating system that executes on computer 110. Software licensing service maintains a license store 204 in which license files for software are stored. License files may, for example, be extensible Rights Markup Language (XrML) files that specify rights to software, and that also may specify various types of conditions on the exercise of those rights. Software 204 also maintains a trust store 206. Trust store 206 stores un-authenticatable, dynamic data in a tamper-resistant manner; trust store 206 stores data that is used in the license validation process. For example, certain licenses may have expiration dates, and, in order to prevent the expiration data from being circumvented through clock rollback, the current time (and elapsed time) may be periodically stored in trust store 206 to ensure that the clock is always moving forward.


Software licensing service 202 manages license store 204 and trust store 206, and also performs various functions relating to the licensing of software. For example, software licensing service 202 may contain modules that parse license files, modules that enforce the binding of a license to a particular machine and/or to a particular instance of a software product, and a secure timer/counter (that uses trust store 206 in the manner described above).


Software licensing service 202 exposes an application programming interface (API) 208 that allows application software (such as application 135) to use software licensing service 202. Application 135 may invoke the features of software licensing service 208 by making local procedure call (LPC) to the methods of API 208. An example set of API methods that may be exposed by software licensing service 202 is described below.


The manner in which API 208 is used by an application is described with reference to FIG. 3. Initially, the application makes an API call (302). Service 202 then processes the API call (304), and returns the result of the API call to the application 306. For example, an API call may request to exercise (“consume”) a right granted in a license, or to retrieve information from a license. The application then receives the result of the API call, and determines, based on that result, what the application's behavior should be (308). In other words, software licensing service 202, in a preferred embodiment, does not enforce a license directly, but rather provides the infrastructure through which licenses can be managed and used. For example, if an application makes an API call to consume a right and service 202 determines that there is no valid license granting this right, service 202, in a preferred embodiment, does not prevent the application from running, but instead informs the application that the right is not available. Thus, the application can use its own mechanisms to determine what to do in response to the unavailability of the right. This facet of the API provides software vendors the flexibility to decide how the licensing infrastructure provided by service 202 should be used. In another implementation, application can be bound to licensing service functionality.


Example Software Licensing API


The following is an example set of API methods that may be exposed by a software licensing service:


SLOpen


The SLOpen function opens a SL client context handle that must be used for all subsequent SL API calls. (Throughout the example API descriptions, “SL” shall refer to the software licensing service. Thus, the SL client context handle is the handle used by a client in communicating with the software licensing service.)
















HRESULT



SLOpen(










CONST GUID*
pguidApp,










HSLC*
phSLC



);









Parameters


pguidApp


[in] Pointer to application GUID that uniquely identifies an application. If this argument is NULL, an E_INVALIDARG error is returned.


phSLC


[out] SL client context Handle or INVALID_HANDLE_VALUE if failed.


Remarks


Use the SLClose function to close an context handle returned by SLOpen.


Application GUID: Unique ID of application. For the WINDOWS version of the MICROSOFT OFFICE application suite, WinWord has an Application GUID which is different from Excel's Application GUID. For Windows, Windows itself is an application, although it is a composite of many programs.


In Office case, A user can install both Office Suite and WinWord standalone products on the machine. From SL point of view, the WinWord in both products has same Application GUID. WinWord's Application GUID associated to two Product GUID. In other words, WinWord can use either Office Suite's product license or WinWord's product license.


When SLOpen succeeds:


A RPC (remote procedure call) binding has been established.


A context memory is created on SL service. The context is used to keep the status information for the caller of the client.


The SLC handle is like a file handle. A process can open multiple SL context handles but handles are valid within the caller process.


Returns


Success or failure


SLClose


The SLClose function closes an opened SL client context handle. Any information in the context is released automatically.
















HRESULT



SLClose(










HSLC
hSLC









);









Parameters


hSLC


[in] Handle to current SL client context handle


Remarks


When SLClose is done, the RPC binding is released, and the context is destroyed.


Returns


Success or failure.


SLInstall


The SLInstall function installs applications'licenses and registers applications'information.
















HRESULT SLInstall(










HSLC
hSLC,










CONST SL_PRODKEY*
 pAppPrdKey,



DWORD
dwNumOfApps,



CONST GUID*
pguidApps,



DWORD
 dwNumOfLicFiles,










PCWSTR
ppszLicFiles[ ],



BOOL
bVerify









);









Parameters


hSLC


[in] Handle to current SL client context handle


pAppPrdKey


[in] Application product key structure. The product key can be Microsoft product key format or Application's product key format.
















typedef struct_tagSL_PRODKEY



{










DWORD cbSize;
// Size of SL_PRODKEY







structure










DWORD dwVersion;
// Version of SL_PRODKEY structure









WCHAR szProdKey[MAX_PRODKEYSTR_SIZE+1];










SL_PRODKEY_TYPE eProdKeyType;
// Type of Product key










SL_CUSTOM_PRODKEY_INFO CustomPrdKeyInfo;
 // Customer product key info









} SL_PRODKEY;









The eProdKeyType can be one of following values:

    • SL_PRODKEY_CUSTOM
    • SL_PRODKEY_MS2002
    • SL_PRODKEY_MS2003


If the Product Key type is non-MS Product Key (i.e. eProdKeyType=SL_PRODKEY_CUSTOM), the caller has to fill in its custom product key information. If the product uses MS Product Key, then CustomPrdKeyInfo can be ignored.
















typedef struct _tagSL_CUSTOM_PRODKEY_INFO










DWORD dwSKUID;
// Unique ID for specific







SKU, for example Group ID in MS PID.










DWORD dwSerialNumber;
// unique serial number, e.g.







channel + sequence number in MS PID.









} SL_CUSTOM_PRODKEY_INFO;









Current version number of SL_PRODKEY is 1. The caller can use SL_CURRENT_PRODKEY_VERSION in dwVersion field.


dwNumOfApps


[in] The number of application GUID in pguidApps.


pguidApps


[in] A list of application of GUID. The application GUID represents the application that the license is being installed for. For example, Office Setup program can call this function to install the license(s) for Word, Excel by specifying each application GUID in pguidApps. pguidApp cannot be NULL here.


dwNumOfApps


[in] The number of license files.


ppszLicFile


[in] File names in array of strings.


Returns


Success or failure


SLUninstall


The SLUninstall function uninstalls a product's license from an application.
















HRESULT SLUninstall (










HSLC
hSLC,









CONST SL_PRODKEY* pAppPrdKey









);









Parameters


hSLC


[in] Handle to current SL client context handle


pAppPrdKey


[in] See above definition in connection with SLInstall.


Remarks


An application could have more than one product licenses. For example, when the user uninstalls Office suite, the association between Office Suite license and WinWord should be removed, but the license from WinWord Standalone product should not be removed.


When SLUninstall succeeds:


The information associated with this Product Key is removed. (see SLInstall, above, for the associated information)


The product keys associated with the Application GUID is removed.


The license files associated with the product GUID are preferably still kept.


Returns


Success or failure


SLConsumeRight


The SLConsumeRight function lets an application to examine or exercise the rights on a locally-stored license. Calling this function binds a license to the right mentioned in pszRightName. If this right cannot be exercised by the current caller, then the application fails. If the function succeeds, the action associated with the right can be executed (like decreasing usage count, decreasing time quota, or nothing)
















HRESULT SLConsumeRight(










HSLC
hSLC,










PCWSTR
pszRightName,










SL_ASYNC_CONTEXT*
pAsyncContext









};









Parameters


hSLC


[in] Handle to current SL client context handle


pszRightName


[in] The name of right needs to be evaluated. In current design, the right name is defined by applications. SL opens the license and evaluates the condition based on the right name.


pAsyncContext


[in/out] IfpAsyncContext is NULL, this function works in synchronous mode, otherwise, the function works in asynchronous mode. SL_ASYNC_CONTEXT is opaque to caller and managed by SLC.


Remarks


All licenses associated with the application GUID (specified in SLOpen) will be conceptually combined in one logic license.


If their are multiple consumable grants of the right, then the license with higher priority will be consumed first.


Returns


Success or failure


SLInitializeAsyncContext


The SLInitializeAsyncContext function or asynchronous-context-initiator component initializes the asynchronous context for SLC functions to make asynchronous call.














HRESULT SLInitializeAsyncContext(










SL_ASYNC_CONTEXT* pAsyncContext,
// asynchronous context



HANDLE hEvent,
// event handle










PVOID pvReserved
// reserved, NULL







};









Parameters


pAsyncContext


[in/out] pointer to asynchronous context that contains asynchronous call information.


hEvent


[in] The event object used for synchronization.


pvReserved


[in] reserved for extension.


Returns


Success or failure.


SLCancelAsyncCall


The SLCancelAsyncCall fiuction is used to cancel an asynchronous call.














HRESULT SLCancelAsyncCall(









 SL_ASYNC_CONTEXT*
pAsyncContext,
// asynchronous context









 BOOL
fAbortCall
// cancel immediately







};









Parameters


pAsyncContext


[in] asynchronous context for SL asynchronous call.


fAbortCall


[in] If TRUE, the call is cancelled immediately. If FALSE, wait for the SL to complete the call.


Remarks


There are two ways for the caller to request cancellation of an asynchronous call-abortive and nonabortive. In an abortive cancel (fAbortCall is TRUE), the SLCancelAsyncCall function sends a cancel notification to the SLC and the asynchronous call is canceled immediately, without waiting for a response from the SLC. In a nonabortive cancel (fAbortCall is FALSE) the SLCancelAsyncCall function notifies SLC of the cancel and the caller waits for SLC to complete the call.


Returns


Success or failure.


SLCompleteAsyncCall


The SLCompleteAsyncCall function is used to complete an SLC asynchronous call.
















HRESULT SLCompleteAsyncCall(











SL_ASYNC_CONTEXT*
pAsyncContext,
// asynchronous context











HRESULT*
phrAsyncCall
// error code of the submitted







asynchronous call









};









Parameters


pAsyncContext


[in] asynchronous context for SL asynchronous call.


phrAsyncCall


[out] the error code of the submitted asynchronous call.


Remarks


If the caller calls this function before the reply has arrived, the call returns E_SLC_ASYNC_CALL_PENDING. The buffer must be valid and it must be big enough to receive the return value. If the call does not return E_SLC_ASYNC_CALL_PENDING, this SLCompleteAsyncCall invocation is final for the asynchronous call. After this function call, regardless of success or failure, all resources allocated for this asynchronous call are freed. (Subsequent calls to the SLCompleteAsyncCall or SLCancelAsyncCall functions have undefined results until a new call on the SL_ASYNC_CONTEXT structure is initiated).


Returns













Value
Meaning







S_OK
The call was completed



successfully.


E_SLC_INVALID_ASYNC_CONTEXT
The asynchronous call



context is not valid.


E_SLC_ASYNC_CALL_PENDING
The call has not yet



completed.


E_SLC_CALL_CANCELLED
The call was cancelled.









SLGetInformation


The SLGetLicenseInfo function is used to get a variety of information.














HRESULT SLGetInfomation(











HSLC
hSLC,
// SL client context handle











DWORD
dwCategory,
// The category of information









to retrieve











PCWSTR
pszKeyName,
 // Name of the Key











DWORD*
pdwType,
// Type of value



SIZE_T*
pcbValue,
// Size of value



PBYTE*
ppbValue
// Pointer to buffer of value







);









Parameters


hSLC


[in] Handle to current SL client context handle


dwCategory


[in] The category of information.













Category
Meaning
















SL_CAT_RIGHTDATA
Get the information from bound right. The license has to



be consumed successfully before getting these right data.


SL_CAT_DYNAMICPROPERTY
Get the information that is not in the license but



calculating in the run-time. For example,



RemainingGracePeriodDays. The right has to be



consumed before calling.










Name
Meaning



RemainingGracePeriodDays: DWORD
The grace period is defined in




out-of-box license. Once the




application is installed, the time




is counting down. Applications




can check remaining grace




period after they have




consumed license.



ActivationStatus: DWORD
After applications consumed




license, it can get consumed




license type. The return value




could be:












SL_LIC_OOB
The





consumed





license is out-





of-box license.




SL_LIC_ACQUIRED
The





consumed





license is





acquired





license.




SL_LIC_NONE
No license is





available.








SL_CAT_SERVICEINFO
Get the information that is not dependent on license. The



caller can get this category of information without



consuming license.










Name
Meaning



SLVersion: DWORD
The version of SL. 1.2.3.4




format.



HWID: BINARY
Current HWID








SL_CAT_WINDOWSINFO
Get information that is bound right property in Windows



license. This is for Componentization. Windows License



has been consumed by SL service and SL service keeps the



bound right properties.


SL_CAT_ENUMLICINFO
When SLEnumLicenseis called and is succeed, the caller



can query the information of enumerated license by using



this category.









pszKeyName


[in] the name of the key. E.g. BuildNumber


pdwType


[out] type of data















Value
Meaning








SL_DATATYPE_SZ
Unicode string



SL_DATATYPE_DWORD
DWORD



SL_DATATYPE_BINARY
Binary









pcbValue


[out] Size of the buffer allocated (in bytes).


ppbValue


[out] If successful, the data is returned in the buffer allocated by SLC. The caller has to call SLFreeMemory to free the memory.


Returns


Success or failure


SLAcquireLicense


The SLAcquireLicense function is used to acquire on-line license for the user. SLC enumerates the product keys associated with the Application and picks up the product key with highest product priority (see SLInstall, registration information). Then SL gets the clearing house URL from out-of-box license and connects to clearing house to get a license.


SLAcquireLicense could be a lengthy process. Applications can call this function in asynchronous mode by specifying pAsyncContext (NULL means synchronous mode).














HRESULT SLAcquireLicense(









 HSLC
hSLC,
// SL client context handle









 PCWSTR
pszProdKeyHash,
// hash of product key









 PCWSTR
pszPublishLicense,
// string of publishing license.








 SL_ASYNC_CONTEXT*
pAsyncContext







);









Parameters


hSLC


[in] Handle to current SL client context handle


pszProdKeyHash


[in] string of product key hash. The product key hash is created when SLInstall is called and is maintained by the licensing service.


pszPublishingLicense


[in] string of publishing license.


pAsyncContext


[in] asynchronous context for SL asynchronous call.


Remarks


The acquired license will be stored in license store accordingly and the license information will be registered, too. (see SLInstall)


Applications might need to add more client information to license. The application can put the information to pbAppData in the call and this data will be sent to clearing house.


When this function succeeds:


It sent necessary binding information to the specified license server.


It receives the license from license server.


It stored the license in license store. See description of SLInstall, above, for how the license file is stored.


Returns


Success or failure.


SLGenerateTextChallenge


Generates and installation challenge text to be routed to a license issuer in an out of band fashion (telephone, email, file share, etc).














HRESULT SLGenerateTextChallenge(









 HSLC
hSLC,
// SL client context handle









 PCWSTR
pszProdKeyHash,
// string of product key hash









 BOOL
fSingleSession,
// Single session only?









 PWSTR
*ppszChallenge
// Pointer to buffer to hold









challenge text







);









Parameters


hSLC


[in] Handle to current SL client context handle


pszProdKeyHash


[in] String of product key hash. The product key hash is created when SLInstall is called and maintained by the licensing service.


bSingleSession


[in] Specifies whether or not the corresponding text response from the license issue will be valid only for the lifetime of this SLC session handle.


ppszChallenge


[out] If successful, the text challenge is returned in the buffer allocated by SLC. The caller needs to call SLFreeMemory to free the allocated memory.


Returns


Success or failure.


SLDepositTextResponse


Deposits the response to an installation challenge text in the licensing system. Used to activate a license with a conditional access code. Only valid if there is an outstanding text challenge which has been issued for a license. If the original license specified that the challenge was only valid for a single session, this API must be called with the response before the SLC handle is closed or depositing the response will fail.














HRESULT SLDepositTextResponse(











HSLC
hSLC,
// SL client context handle










PCWSTR
pszProdKeyHash,











PWSTR
pszResponse
// Buffer containing response text







);









Parameters


hSLC


[in] Handle to current SL client context handle


pszProdKeyHash


string of the product key hash


pszChallenge


[in] Response text


Returns


Success or failure.


SLEnumLicense


The SLEnumLicensefunction is used to enumerate installed licenses and get information from the license.
















HRESULT SLEnumLicense(











HSLC
hSLC,
// SL client context handle











CONST GUID*
pguidApp,
// application GUID



DWORD
dwIndex
// index number









);









Parameters


hSLC


[in] Handle to current SL client context handle


pguidApp


[in] See SLInstall. IfpguidApp is not NULL, then licenses associated with this GUID are enumerated. If the GUID is NULL, then all licenses are enumerated.


dwindex


[in] The index number of the license to be retrieved. This value should be zero for the first call to the SLEnumLicense function and then incremented for subsequent calls.


The function may return licenses in any order.


Returns


E_SL_NO_MORE_DATA—No license at the specified index.


Remarks


If SLEnumLicenses succeeded, the selected license information can be accessed by calling SLGetInformation and the category is SL_CAT_ENUMLICINFO


Sample:














DWORD i=0;


PBYTE pbProductPriority = NULL;


PBYTE pbRemainingGracePeriodDays = NULL;


for (i=0; ; i++)


{









EXIT_ON_ERROR(SLEnumLicense(hSLC, NULL, dwIndex));



if (E_SL_NO_MORE_DATA == SCODE(hr))



{









hr = S_OK;



break;



}



EXIT_ON_ERROR(SLGetInformation(hSLC,







SL_CAT_ENUMLIC, “ProductPriority”, &dwType, &cbProductPriority,


&pbProductPriority));









EXIT_ON_ERROR(SLGetInformation(hSLC,







SL_CAT_ENUMLIC, “RemainingGracePeriodDays”, &dwType,


&cbRemainingGracePeriodDays, &pbRemainingGracePeriodDays));









Exit:









SLFreeMemory(pbProductPriority);



SLFreeMemory(pbRemainingGracePeriodDays);









}










SLFreeMemory


The SLFreeMemory function is used to free the memory allocated by SLC.
















VOID SLFreeMemory(











PVOID
pvMemblock,
// pointer to memory









);









Parameters


pvMemBlock


[in] Previously allocated memory block to be freed


Returns


None


Use of Software Licensing API to Control Use of Software


A software product uses the API of the present invention for various purposes related to licensing, including the consumption of rights in a license, and the retrieval of data from the license. As noted above, the API allows the software to determine what rights are present in the license, but, preferably, it is up to the software to determine what to do with that information—e.g., grant or deny access to a feature, cease operation altogether, etc. The following description of FIGS. 4 and 5 show how the API of the present invention is used by a software product.



FIG. 4 shows an example process by which an application “consumes” a right. The application calls the SLConsumeRight method (402). As discussed above, the arguments to the SLConsumeRight function include the client handle assigned by the licensing service, and the name of the right (which is assigned by the vendor of the software to which the right pertains). The licensing service (service 202, shown in FIG. 2) receives the call (404). The service then locates licenses that contains the right, and checks the licenses bindings and validity. As noted above, the license is located in the license store; if there is more than one license that pertains to the application software to which the SLConsumeRight call pertains, then a priority rule may be used to select one of the applicable licenses. Checking the binding means determining that: (1) the license is bound to the product key of the application identified by the client handle; and (2) the license is bound to the machine on which the software is running (or to the group or class of machines of which the current machine is a member). Checking validity may include determining that the right has not expired (in the case of licenses that specify an expiration date), and that the maximum number of uses of the right is not exceeded (in the case where the license specifies a maximum number of times that the right may be used (i.e., “consumed”)).


If the license and/or right are found to be correctly bound and valid (408), then the license is bound to the right requested in the API call (412). (It should be noted that “binding” a license to a machine, environment, and a product key means that the license specifies which machine(s) and product key it can be used with; “binding” a license to a right means that the consume function has been successful, and the right is being consumed from a particular license. Throughout this description, it will be clear from context which meaning of “binding” applies.) The API call then returns to the calling application and indicates that the call was successful (414). If the license and/or right has been found to be invalid, or not correctly bound to the machine, environment, or product ID, then the SLConsumeRight call returns to the calling application and indicates that the operation failed (410).


If the SLConsumeRight call returns with a failure, then the right specified in the call cannot be consumed from a license, and no information about that right will be available to the calling application. However, if the right is successfully consumed, then the application can use the binding of the right to the license to get information from the license about the right. For example, a license may contain a general right called “run,” which indicates that the application may be run. However, for the “run” right, the license may contain more specific parameters about the usage of the application—e.g., the license may specify whether particular features of an application (e.g., print, edit, save, etc.) should be turned on or off, and may give specific parameters for the use of these features (e.g., the document can be saved only on machines that are running in a particular domain, or the print feature can only be used for thirty days, etc.). The SL API does not require any particular type of information to be associated with a right, but rather provides a mechanism whereby an application vendor can associate any type of information with a right, which can then be retrieved and interpreted by the application.


Assuming that a right has been successfully consumed as described in FIG. 4, the application may then retrieve the information associated with the right. The process of retrieving this information is described in FIG. 5.


First, the application calls the SLGetInformation method on the bound right (502). The various types of information that can be retrieved are described above in connection with the description of the SLGetInformation method. The licensing service then receives the call (504). The service retrieves the requested information from the license file that contains the bound right (506). The licensing service then places this information in a buffer (508), and returns to the calling application (510). The calling application then reads the contents of the buffer, and performs whatever actions it deems necessary based on the retrieved information.


It should be noted that the licensing service may not be aware of the meaning of the information that it is handling as part of an SLGetInformation call. As discussed above, the licensing framework provides a mechanism whereby a software vendor can create rights, and can associate information with the rights. The invention is not limited either to any particular type of information that can be associated with the right. When the information is retrieved from the license, it is simply passed by the licensing service to the application in a buffer. The application then interprets the retrieved information, decides what actions to be taken based on that information, and uses its own security features to enforce the application's decision. (E.g., if, based on the retrieved information, the application decides to disable the print feature, the application contains the code that actually disables this features and, possibly, code that prevents a hacker from tampering with the disabling of the print feature.)


It is noted that the foregoing examples have been provided merely for the purpose of explanation and are in no way to be construed as limiting of the present invention. While the invention has been described with reference to various embodiments, it is understood that the words which have been used herein are words of description and illustration, rather than words of limitations. Further, although the invention has been described herein with reference to particular means, materials and embodiments, the invention is not intended to be limited to the particulars disclosed herein; rather, the invention extends to all functionally equivalent structures, methods and uses, such as are within the scope of the appended claims. Those skilled in the art, having the benefit of the teachings of this specification, may effect numerous modifications thereto and changes may be made without departing from the scope and spirit of the invention in its aspects.

Claims
  • 1. An apparatus comprising: at least one computer processor;a license store that stores license files for different software products, said license files including licenses to the different software products specifying rights and conditions on the exercise of said rights; andmemory coupled to the at least one computer processor, the memory comprising executable instructions that, based on execution by the at least one computer processor, cause the at least one computer processor to automatically: expose an application programming interface that provides access by application programs to license information associated with the different software products in said license files in said license store;receive from an application program via said application programming interface a request comprising an indication of a software product and a request to exercise a right granted in a license to the software product in said license files;check whether the license for the indicated software product is valid;based at least on the license for the indicated software product being valid, obtaining from said license store rights and conditions of the exercise of said rights granted in the license for the software product indicated in the request; andprovide, based at least on receiving the request via said application programming interface, the rights and conditions of the exercise of said rights granted in the license for the software product indicated in the request to the application program without implementing any mechanism for granting or denying the rights granted in the license for the software product, wherein the instructions for checking whether the license for the indicated software product is valid further comprises instructions for determining that the license for the indicated software product is bound to the software product by determining whether the rights granted in the license for the software product indicated in the request can be exercised based on whether the rights are bound to a machine executing the application program from which the request was received, wherein the instructions further comprise instructions for establishing a context for asynchronous processing and processing the request from the application program, asynchronously, in accordance with the established context, and wherein the executable instructions are executed by an operating system.
  • 2. The apparatus of claim 1, further comprising a trust store that stores data used in a license validation process in a tamper-resistant manner.
  • 3. The apparatus of claim 1, wherein the instructions for checking that the license for the indicated software product is valid includes instructions for determining, via a conflict rule, which license to obtain from a plurality of licenses indicated by said license files that are stored in the license store for the software product, the plurality of licenses including the license to the software product.
  • 4. The apparatus of claim 1, wherein the rights and conditions of the exercise of said rights granted in the license for the software product indicated in the request comprise an indication of a validity of the rights granted in the license for the software product.
  • 5. A method comprising: exposing an application programming interface that provides access by application programs to license information in a license store storing license files for different software products, said license files including licenses to the different software products specifying rights and conditions on the exercise of said rights;receiving from an application program via said application programming interface a request comprising an indication of a software product having a license file in the license store and a request to exercise a right granted in a license to the software product in said license files;checking whether the license for the indicated software product is valid;based at least on the license for the indicated software product being valid, obtaining from said license store rights and conditions of the exercise of said rights granted in the license for the software product indicated in the request;providing, based at least on receiving the request via said application programming interface, the rights and conditions of the exercise of said rights granted in the license for the software product indicated in the request to the application program without implementing any mechanism for granting or denying the rights granted in the license for the software product, wherein checking whether the license for the indicated software product is valid further comprises determining that the license for the indicated software product is bound to the software product by determining whether the rights granted in the license for the software product indicated in the request can be exercised based on whether the rights are bound to a machine executing the application program from which the request was received;establishing a context for asynchronous processing; andprocessing the request from the application program, asynchronously, in accordance with the established context, wherein the method is executed by an operating system.
  • 6. The method of claim 5, further comprising storing data used in a license validation process in a trust store in tamper-resistant manner.
  • 7. The method of claim 5, wherein checking that the license for the indicated software product is valid includes determining, via a conflict rule, which license to obtain from a plurality of licenses in said license files that are stored in the license store for the software product, the plurality of licenses including the license to the software product.
  • 8. The method of claim 5, wherein the rights and conditions of the exercise of said rights granted in the license for the software product indicated in the request comprise an indication of a validity of the rights granted in the license for the software product.
  • 9. A computer-readable memory device comprising executable instructions that, based on execution by at least one computer processor, cause the at least one computer processor to: expose an application programming interface that allows application programs to request license information contained in a license store storing license files for different software products, said license files including licenses to the different software products specifying at least one right;receive from an application program at least via said application programming interface a request comprising an indication of a software product having a license file in the license store and a request to exercise a right granted in a license to the software product in said license files;check whether the license for the indicated software product is valid;based at least on the license for the indicated software product being valid, obtain from said license store the at least one right granted in the license for the software product indicated in the request;provide, based at least on receiving the request via said application programming interface, the at least one right granted in the license for the software product indicated in the request to the application program without implementing any mechanism for granting or denying the rights granted in the license for the software product, wherein checking whether the license for the indicated software product is valid further comprises determining that the license for the indicated software product is bound to the software product by determining whether the rights granted in the license for the software product indicated in the request can be exercised based on whether the rights are bound to a machine executing the application program from which the request was received;establishing a context for asynchronous processing; andprocessing the request from the application program, asynchronously, in accordance with the established context, wherein the instructions are executed by an operating system.
  • 10. The memory device of claim 9, further comprising instructions for storing data used in a license validation process in a trust store in tamper-resistant manner.
  • 11. The memory device of claim 9, wherein instructions for checking that the license for the indicated software product is valid includes instructions for determining, via a conflict rule, which license to obtain from a plurality of licenses in said license files that are stored in the license store for the software product, the plurality of licenses including the license to the software product.
  • 12. The memory device of claim 9, wherein instructions to check whether the license for the indicated software product is valid comprises instructions that further cause the at least one processor to determine whether the rights granted in the license for the software product indicated in the request can be exercised based on whether rights are bound to a class of machines of which a machine executing the application program from which the request was received is a member.
  • 13. The memory device of claim 9, wherein the license files further specify at least one condition on the exercise of said at least one right.
  • 14. The memory device of claim 9, wherein the check further comprises checking whether the license for the indicated software product is bound to the software product.
  • 15. The memory device of claim 9, wherein the obtaining the at least one right further comprises determining whether the license for the indicated software product is valid and bound to the software product, and obtaining the at least one right and conditions of the exercise of said at least one right granted in the license for the software product indicated in the request when the at least one right and conditions of the exercise of said at least one right granted in the license for the software product indicated in the request is valid and bound to the software product.
  • 16. The memory device of claim 15, wherein providing the at least one right based at least on receiving the request, further comprises providing the at least one right and the conditions of the exercise of said at least one right granted in the license for the software product indicated in the request or the information from the license to the software product indicated in the request to the application software without implementing any mechanism for granting or denying the rights granted in the license for the software product.
US Referenced Citations (297)
Number Name Date Kind
5023907 Johnson et al. Jun 1991 A
5155806 Hoeber et al. Oct 1992 A
5204897 Wyman Apr 1993 A
5375206 Hunter et al. Dec 1994 A
5377354 Scannell et al. Dec 1994 A
5500936 Allen et al. Mar 1996 A
5519606 Frid-Nielsen et al. May 1996 A
5559944 Ono Sep 1996 A
5563946 Cooper et al. Oct 1996 A
5570109 Jenson Oct 1996 A
5588107 Bowden et al. Dec 1996 A
5596694 Capps Jan 1997 A
5625783 Ezekiel et al. Apr 1997 A
5629980 Stefik et al. May 1997 A
5634100 Capps May 1997 A
5634128 Messina May 1997 A
5638504 Scott et al. Jun 1997 A
5638513 Ananda Jun 1997 A
5659693 Hansen et al. Aug 1997 A
5664127 Anderson et al. Sep 1997 A
5664208 Pavley et al. Sep 1997 A
5671412 Christiano Sep 1997 A
5721847 Johnson Feb 1998 A
5734915 Roewer Mar 1998 A
5760768 Gram Jun 1998 A
5760773 Berman et al. Jun 1998 A
5761646 Frid-Nielsen et al. Jun 1998 A
5778402 Gipson Jul 1998 A
5778404 Capps et al. Jul 1998 A
5805167 van Cruyningen Sep 1998 A
5812132 Goldstein Sep 1998 A
5821936 Shaffer et al. Oct 1998 A
5828376 Solimene et al. Oct 1998 A
5838321 Wolf Nov 1998 A
5842009 Borovoy et al. Nov 1998 A
5844558 Kumar et al. Dec 1998 A
5844572 Schott Dec 1998 A
5855006 Huemoeller et al. Dec 1998 A
5885006 Sheedy Mar 1999 A
5893125 Shostak Apr 1999 A
5898436 Stewart et al. Apr 1999 A
5899979 Miller et al. May 1999 A
5905863 Knowles et al. May 1999 A
5926806 Marshall et al. Jul 1999 A
5936625 Kahl et al. Aug 1999 A
5940078 Nagarajayya et al. Aug 1999 A
5940847 Fein et al. Aug 1999 A
5943051 Onda et al. Aug 1999 A
5960406 Rasansky et al. Sep 1999 A
5970466 Detjen et al. Oct 1999 A
5999731 Yellin et al. Dec 1999 A
5999938 Bliss et al. Dec 1999 A
6008806 Nakajima et al. Dec 1999 A
6012075 Fein et al. Jan 2000 A
6018343 Wang et al. Jan 2000 A
6034683 Mansour et al. Mar 2000 A
6047242 Benson Apr 2000 A
6067087 Krauss et al. May 2000 A
6072492 Schagen et al. Jun 2000 A
6085206 Domini et al. Jul 2000 A
6101480 Conmy et al. Aug 2000 A
6115777 Zahir et al. Sep 2000 A
6133915 Arcuri et al. Oct 2000 A
6166738 Robertson et al. Dec 2000 A
6175363 Williams et al. Jan 2001 B1
6188403 Sacerdoti et al. Feb 2001 B1
6189146 Misra et al. Feb 2001 B1
6192381 Stiegemeier et al. Feb 2001 B1
6211879 Soohoo Apr 2001 B1
6216122 Elson Apr 2001 B1
6219670 Mocek et al. Apr 2001 B1
6222540 Sacerdoti Apr 2001 B1
6226747 Larsson et al. May 2001 B1
6232971 Haynes May 2001 B1
6236396 Jenson et al. May 2001 B1
6256628 Dobson et al. Jul 2001 B1
6260141 Park Jul 2001 B1
6278450 Arcuri et al. Aug 2001 B1
6289317 Peterson Sep 2001 B1
6289502 Garland et al. Sep 2001 B1
6289505 Goebel Sep 2001 B1
6301704 Chow et al. Oct 2001 B1
6305012 Beadle et al. Oct 2001 B1
6307544 Harding Oct 2001 B1
6308317 Wilkinson et al. Oct 2001 B1
6308322 Serocki et al. Oct 2001 B1
6323883 Minoura et al. Nov 2001 B1
6324686 Komatsu et al. Nov 2001 B1
6327665 Osanai Dec 2001 B1
6353451 Teibel et al. Mar 2002 B1
6359634 Cragun et al. Mar 2002 B1
6373507 Camara et al. Apr 2002 B1
6384849 Morcos et al. May 2002 B1
6385596 Wiser et al. May 2002 B1
6405216 Minnaert et al. Jun 2002 B1
6424829 Kraft Jul 2002 B1
6429882 Abdelnur et al. Aug 2002 B1
6433801 Moon et al. Aug 2002 B1
6456304 Angiulo et al. Sep 2002 B1
6459441 Perroux et al. Oct 2002 B1
6466236 Pivowar et al. Oct 2002 B1
6469722 Kinoe et al. Oct 2002 B1
6480865 Lee et al. Nov 2002 B1
6493006 Gourdol et al. Dec 2002 B1
6493731 Jones et al. Dec 2002 B1
6546417 Baker Apr 2003 B1
6570596 Frederiksen May 2003 B2
6578192 Boehme et al. Jun 2003 B1
6583798 Hoek et al. Jun 2003 B1
6587881 Agarwal Jul 2003 B1
6618732 White et al. Sep 2003 B1
6621504 Nadas et al. Sep 2003 B1
6621508 Shiraishi et al. Sep 2003 B1
6635089 Burkett et al. Oct 2003 B1
6664983 Ludolph Dec 2003 B2
6680749 Anderson et al. Jan 2004 B1
6686938 Jobs et al. Feb 2004 B1
6691281 Sorge et al. Feb 2004 B1
6697948 Rabin et al. Feb 2004 B1
6708205 Sheldon et al. Mar 2004 B2
6727919 Reder et al. Apr 2004 B1
6732330 Claussen et al. May 2004 B1
6734880 Chang et al. May 2004 B2
6750890 Sugimoto Jun 2004 B1
6785868 Raff Aug 2004 B1
6825859 Severenuk et al. Nov 2004 B1
6826729 Giesen et al. Nov 2004 B1
6850255 Muschetto Feb 2005 B2
6871195 Ryan et al. Mar 2005 B2
6882354 Nielsen Apr 2005 B1
6904449 Quinones Jun 2005 B1
6906717 Couckuyt et al. Jun 2005 B2
6915492 Kurtenbach et al. Jul 2005 B2
6924797 MacPhail Aug 2005 B1
6964025 Angiulo et al. Nov 2005 B2
6983889 Alles Jan 2006 B2
6988241 Guttman et al. Jan 2006 B1
6990637 Anthony et al. Jan 2006 B2
7027463 Mathew et al. Apr 2006 B2
7032210 Alloing et al. Apr 2006 B2
7039596 Lu May 2006 B1
7046848 Olcott May 2006 B1
7107544 Luke Sep 2006 B1
7110936 Hiew et al. Sep 2006 B2
7111238 Kuppusamy et al. Sep 2006 B1
7152207 Underwood et al. Dec 2006 B1
7188073 Tam et al. Mar 2007 B1
7212208 Khozai May 2007 B2
7216301 Moehrle May 2007 B2
7249325 Donaldson Jul 2007 B1
7325204 Rogers Jan 2008 B2
7328409 Awada et al. Feb 2008 B2
7337185 Ellis et al. Feb 2008 B2
7346705 Hullot et al. Mar 2008 B2
7346769 Forlenza et al. Mar 2008 B2
7360174 Grossman et al. Apr 2008 B2
7386535 Kalucha et al. Jun 2008 B1
7392249 Harris et al. Jun 2008 B1
7461249 Pearson et al. Dec 2008 B1
7469385 Harper et al. Dec 2008 B2
7484213 Mathew et al. Jan 2009 B2
7505954 Heidloff et al. Mar 2009 B2
7530029 Satterfield et al. May 2009 B2
7567964 Brice et al. Jul 2009 B2
7627561 Pell et al. Dec 2009 B2
7739259 Hartwell et al. Jun 2010 B2
8027925 Garst et al. Sep 2011 B1
20020007380 Bauchot et al. Jan 2002 A1
20020037754 Hama et al. Mar 2002 A1
20020052721 Ruff et al. May 2002 A1
20020070977 Morcos et al. Jun 2002 A1
20020075330 Rosenzweig et al. Jun 2002 A1
20020078143 De boor et al. Jun 2002 A1
20020091739 Ferlitsch et al. Jul 2002 A1
20020122071 Camara et al. Sep 2002 A1
20020133557 Winarski Sep 2002 A1
20020135621 Angiulo et al. Sep 2002 A1
20020140731 Subramaniam et al. Oct 2002 A1
20020140740 Chen Oct 2002 A1
20020149623 West et al. Oct 2002 A1
20020149629 Craycroft et al. Oct 2002 A1
20020154178 Barnett et al. Oct 2002 A1
20020161718 Coley et al. Oct 2002 A1
20020163538 Shteyn Nov 2002 A1
20020175955 Gourdol et al. Nov 2002 A1
20020196293 Suppan et al. Dec 2002 A1
20030011638 Chung Jan 2003 A1
20030011639 Webb Jan 2003 A1
20030014490 Bates et al. Jan 2003 A1
20030022700 Wang Jan 2003 A1
20030035917 Hyman Feb 2003 A1
20030038832 Sobol Feb 2003 A1
20030043211 Kremer et al. Mar 2003 A1
20030066025 Garner et al. Apr 2003 A1
20030070143 Maslov Apr 2003 A1
20030076957 Asokan et al. Apr 2003 A1
20030084286 Bader May 2003 A1
20030088516 Remer et al. May 2003 A1
20030093490 Yamamoto et al. May 2003 A1
20030097361 Huang et al. May 2003 A1
20030098891 Molander May 2003 A1
20030110191 Handsaker et al. Jun 2003 A1
20030112278 Driskell Jun 2003 A1
20030140009 Namba et al. Jul 2003 A1
20030163455 Dettinger et al. Aug 2003 A1
20030167310 Moody et al. Sep 2003 A1
20030169284 Dettinger et al. Sep 2003 A1
20030195937 Kircher et al. Oct 2003 A1
20030206646 Brackett Nov 2003 A1
20030218611 Ben-tovim et al. Nov 2003 A1
20030226106 Mckellar et al. Dec 2003 A1
20030227487 Hugh Dec 2003 A1
20030233419 Beringer Dec 2003 A1
20040003351 Sommerer et al. Jan 2004 A1
20040012633 Helt Jan 2004 A1
20040056894 Zaika et al. Mar 2004 A1
20040090315 Mackjust et al. May 2004 A1
20040100504 Sommer May 2004 A1
20040100505 Cazier May 2004 A1
20040107197 Shen et al. Jun 2004 A1
20040109025 Hullot et al. Jun 2004 A1
20040109033 Vienneau et al. Jun 2004 A1
20040117451 Chung Jun 2004 A1
20040119760 Grossman et al. Jun 2004 A1
20040128275 Moehrle Jul 2004 A1
20040133854 Black Jul 2004 A1
20040142720 Smethers Jul 2004 A1
20040164983 Khozai Aug 2004 A1
20040168153 Marvin Aug 2004 A1
20040186775 Margiloff et al. Sep 2004 A1
20040189694 Kurtz et al. Sep 2004 A1
20040221234 Imai Nov 2004 A1
20040230508 Minnis et al. Nov 2004 A1
20040230906 Pik et al. Nov 2004 A1
20040239700 Baschy Dec 2004 A1
20040243938 Weise et al. Dec 2004 A1
20040268231 Tunning Dec 2004 A1
20050004990 Durazo et al. Jan 2005 A1
20050005249 Hill et al. Jan 2005 A1
20050010871 Ruthfield et al. Jan 2005 A1
20050021504 Atchison Jan 2005 A1
20050022116 Bowman et al. Jan 2005 A1
20050039142 Jalon et al. Feb 2005 A1
20050043015 Muramatsu Feb 2005 A1
20050044500 Orimoto et al. Feb 2005 A1
20050050315 Burkhardt Mar 2005 A1
20050057584 Gruen et al. Mar 2005 A1
20050086135 Lu Apr 2005 A1
20050117179 Ito et al. Jun 2005 A1
20050138576 Baumert et al. Jun 2005 A1
20050144241 Stata et al. Jun 2005 A1
20050172262 Lalwani Aug 2005 A1
20050183008 Crider et al. Aug 2005 A1
20050216863 Schumacher et al. Sep 2005 A1
20050223329 Schwartz et al. Oct 2005 A1
20050256867 Walther et al. Nov 2005 A1
20050278656 Goldthwaite et al. Dec 2005 A1
20050289156 Maryka et al. Dec 2005 A1
20060020962 Stark et al. Jan 2006 A1
20060036580 Stata et al. Feb 2006 A1
20060036945 Radtke et al. Feb 2006 A1
20060036965 Harris et al. Feb 2006 A1
20060041545 Heidloff et al. Feb 2006 A1
20060047644 Bocking et al. Mar 2006 A1
20060080303 Sargent et al. Apr 2006 A1
20060095865 Rostom May 2006 A1
20060101051 Carr et al. May 2006 A1
20060101350 Scott May 2006 A1
20060111931 Johnson et al. May 2006 A1
20060117249 Hu et al. Jun 2006 A1
20060129937 Shafron Jun 2006 A1
20060173824 Bensky et al. Aug 2006 A1
20060218500 Sauve et al. Sep 2006 A1
20060242557 Nortis, III Oct 2006 A1
20060242575 Winser Oct 2006 A1
20060294452 Matsumoto Dec 2006 A1
20070050401 Young et al. Mar 2007 A1
20070061306 Pell et al. Mar 2007 A1
20070061307 Hartwell et al. Mar 2007 A1
20070061308 Hartwell et al. Mar 2007 A1
20070106951 Mccormack et al. May 2007 A1
20070143671 Paterson et al. Jun 2007 A1
20070185826 Brice et al. Aug 2007 A1
20070240057 Satterfield et al. Oct 2007 A1
20070260996 Jakobson Nov 2007 A1
20070279417 Garg et al. Dec 2007 A1
20070300168 Bosma et al. Dec 2007 A1
20080034304 Feuerbacher et al. Feb 2008 A1
20080040682 Sorenson et al. Feb 2008 A1
20080052670 Espinosa et al. Feb 2008 A1
20080077571 Harris et al. Mar 2008 A1
20080178110 Hill et al. Jul 2008 A1
20090007003 Dukhon et al. Jan 2009 A1
20090083656 Dukhon et al. Mar 2009 A1
20090100009 Karp Apr 2009 A1
20090217192 Dean et al. Aug 2009 A1
20090222763 Dukhon et al. Sep 2009 A1
Foreign Referenced Citations (20)
Number Date Country
1207530 Feb 1999 CN
0910007 Apr 1999 EP
1223503 Jul 2002 EP
1 243 998 Sep 2002 EP
0 715 247 Mar 2003 EP
1376337 Jan 2004 EP
1526427 Jul 2005 EP
1672518 Jun 2006 EP
1835434 Sep 2007 EP
2391148 Jan 2004 GB
5274275 Oct 1993 JP
2002-358136 Dec 2002 JP
WO 9220021 Nov 1992 WO
WO 9220022 Nov 1992 WO
9517732 Jun 1995 WO
9904353 Jan 1999 WO
9927495 Jun 1999 WO
WO 0177795 Oct 2001 WO
02091162 Nov 2002 WO
03098500 Nov 2003 WO
Non-Patent Literature Citations (202)
Entry
MSDN—License Service Application Programming Interface, API Specification v1.02, Microsoft, Jan. 28, 1993.
Agha, G.A. et al., “Modular Heterogeneous System Development: A Critical Analysis of Java”, Heterogeneous Computing Workshop, 1998, 144-155, XP 010274892.
Technical Standard, Systems Management: Software License Use Management (XSLM), The Open Group, Mar. 1999, 1-23, 41-70, XP-002326441.
Aura, T. et al., “Software License Management with Smart Cards”, Proceedings of the USENIX Workshop on Smartcard Technology, 1999, 75-85.
Grantham, I., “Centralize Software Monitoring with LicenseTrack 3.4”, UNIX Review, 1996, 14(7), 45-46, 48.
Robert J. Oberg, Petr Thorsteinsson, Dan L.Wyatt: “Application Development Usin Visual Basic and .Net” [Online] Jun. 24, 2002 (Jun. 24, 2002), Prentice Hall Retrieved from the Internet: URL:http://proquest.safaribooksonline.com> [retrieved on Jun. 27, 2007] Part.4 : Fundamentals of the .Net framework Chapter 10 :.NET framework Classes Asynchronous Programming.
Craig Tunstall, Gwyn Cole: “Developing WMI Solutions: A Guide to Windows Management Instrumentation” Nov. 12, 2002 (Nov. 12, 2002), Addison Wesley Professional Retrieved from the Internet: URL:http://proquest.safaribooksonline.com> [retrieved on Jun. 27, 2007] Chapter 7. Developing Management Applications Making Asynchronous calls.
Norwegian Patent Application No. 20044099: Norwegian Search Report, dated Jan. 29, 2011, 2 pages.
Taiwan Invention Patent Application No. 093126908: Taiwan Search Report, dated Jan. 5, 2011, 1 page.
Office Action Received for Canadian Patent Application No. 2,482,182, dated Jun. 27, 2014, 4 Pages.
India Patent Application No. 1921/DEL/2004; Hearing Notice; dated Apr. 18, 2017; 2 pages.
“Office Action Issued in Brazilian Patent Application No. PI0404376-6”, dated Mar. 6, 2017, 7 Pages.
“Office Action Issued in Korean Patent Application No. 10-2004-70500”, dated May 31, 2012, 2 Pages.
“Final Office Action Issued in U.S. Appl. No. 11/136,800”, dated Jul. 9, 2008, 21 Pages.
Boyce, Jim, “Microsoft Outlook Inside Out”, Published by Microsoft Press, Jan. 2001, pp. 133, 134, 721-728.
“Final Office Action Issued in U.S. Appl. No. 11/151,686”, dated Jul. 24, 2008, 17 Pages.
“Final Office Action Issued in U.S. Appl. No. 11/151,686”, dated Oct. 28, 2008, 17 Pages.
Bos, Bert, “Re: A proposal for addition to HTML 3.0: Frames”, Retrieved from http://www.nyct.net/aray/htmlwg/95q3/1141.html, Sep. 21, 1995, 5 Pages.
Billo, E. Joseph, “Creating Charts: An Introduction”, In Book of Excel for Chemists: A Comprehensive Guide, Second Edition, 2001, 9 Pages.
“Non- Final Office Action Issued in U.S. Appl. No. 11/151,686”, dated Sep. 26, 2007, 15 Pages.
Berliner, et al., “Microsoft Office 2003”, Binom-Express Publishing House, Feb. 24, 2004, pp. 173-178.
“Non-Final Office Action Issued in U.S. Appl. No. 11/154,278”, dated Nov. 25, 2008, 23 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 11/154,278”, dated Nov. 13, 2009, 32 Pages.
“Final Office Action Issued in U.S. Appl. No. 11/401,470”, dated Sep. 23, 2009, 14 Pages.
“Non- Final Office Action Issued in U.S. Appl. No. 11/401,470”, dated Mar. 18, 2009, 14 Pages.
“Office Action Issued in U.S. Appl. No. 11/430,416”, dated Jun. 27, 2008, 29 Pages.
“Final Office Action Issued in U.S. Appl. No. 11/430,561”, dated Aug. 17, 2009, 17 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 11/430,561”, dated Jan. 9, 2009, 16 Pages.
“Final Office Action Issued in U.S. Appl. No. 11/430,562”, dated Nov. 13, 2008, 32 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 11/430,562”, dated Jun. 19, 2009, 38 Pages.
“Office Action Issued in U.S. Appl. No. 11/430,562”, dated Jan. 7, 2010, 38 Pages.
“Office Action Issued in U.S. Appl. No. 11/430,562”, dated May 30, 2008, 30 Pages.
“Final Office Action Issued in U.S. Appl. No. 11/445,393”, dated Nov. 24, 2009, 8 Pages.
Berliner, et al., “Microsoft Office 2003”, Binom-Express Publishing House, Feb. 24, 2004, pp. 39-40, 120-124, 175-177, 233-234.
Becker, et al., “Virtual Folders: Database Support for Electronic Messages Classification”, In Book CODAS, Dec. 1996, pp. 163-170.
Ando, et al., “Visualization-enabled Multi-document Summarization by Iterative Residual Rescaling”, In Natural Language Engineering, vol. 11, Issue 1, Mar. 2005, pp. 67-86.
“Office Action Issued in U.S. Appl. No. 11/782,059”, dated Aug. 18, 2009, 28 Pages.
Agarwal, Vikash K., “Creating a Visually Arresting User-Interface: A3D Tab Control Example”, Retrieved from: http://web.archive.org/web/20080513093733/http://microsoft.apress.com/asptodayarchive/71723/creating-a-visually-arresting-user-interface-a-3d-tab-control-example, Jan. 3, 2008, 12 Pages.
“Office Action Issued in U.S. Appl. No. 12/028,797”, dated Apr. 28, 2009, 30 Pages.
“Office Action Issued in Phillipines Patent Application No. 1-2004-000416”, dated Mar. 31, 2010., 2 Pages.
“Office Action Issued in Phillipines Patent Application No. 1-2004-000416”, dated Sep. 4, 2008, 2 Pages.
“Office Action Issued in Phillipines Patent Application No. 1-2004-000416”, dated Mar. 16, 2005, 1 Page.
“Examiner's Action Issued in Philippines Patent Application No. 1-2005-000405”, dated Aug. 19, 2008, 1 Page.
“Examiner's Action Issued in Philippines Patent Application No. 1-2005-000405”, dated Apr. 21, 2008, 1 Page.
“Examiner's Action Issued in Philippines Patent Application No. 1-2005-000406”, dated Apr. 21, 2008, 1 Page.
“Examiner's Action Issued in Philippines Patent Application No. 1-2005-000495”, dated Jul. 31, 2008, 1 Page.
“Examiner's Action Issued in Philippines Application No. 1-2005-00406”, dated Sep. 12, 2008, 1 Page.
“Office Action Issued in Israel Patent Application No. 164074”, dated Mar. 10, 2009, 9 Pages.
“Office Action Issued in Israel Patent Application No. 169716”, dated Sep. 6, 2009, 2 Pages.
“Office Action Issued in Israel Patent Application No. 169718”, dated Sep. 7, 2009, 2 Pages.
“Office Action Issued in Israel Patent Application No. 170668”, dated Oct. 12, 2009, 2 Pages.
“Office Action Issued in Chilean Patent Application No. 1768-2005”, dated Nov. 27, 2008, 10 Pages.
“Second Office Action Issued in Chilean Patent Application No. 1768-2005”, dated Dec. 4, 2009, 12 Pages.
“Office Action Issued in Chilean Patent Application No. 1769-2005”, dated Nov. 27, 2008, 11 Pages.
“Second Office Action Issued in Chilean Patent Application No. 1769-2005”, dated Jan. 29, 2010, 14 Pages.
“Office Action Issued in Chilean Patent Application No. 1770-05”, dated Mar. 28, 2008, 5 Pages. (W/o English Translation).
“Office Action Issued in Chilean Patent Application No. 1770-2005”, dated Sep. 23, 2008, 10 pages.
“Second Office Action Issued in Chilean Patent Application No. 1770-2005”, dated Nov. 4, 2009, 14 Pages.
“Office Action Issued in Indian Patent Application No. 1921/DEL/2004”, dated Apr. 18, 2017, 2 Pages.
“Office Action Issued in India Patent Application No. 1921/DEL/2004”, dated Sep. 12, 2014, 2 Pages.
“Notice of Allowance Issued in Canadian Patent Application No. 2,482,182”, dated Jan. 4, 2017, 1 Page. (W/o English Translation).
“Office Action Issued in Canadian Patent Application No. 2,482,182”, dated Feb. 26, 2016, 8 Pages.
“Communication Issued in European Patent Application No. 09006972.5”, dated Sep. 28, 2009, 6 Pages.
“Search Report Issued in European Patent Application No. 09006972.5”, dated Sep. 7, 2009, 5 Pages.
“Notice of Allowance Issued in Taiwan Patent Application No. 93126908”, dated Aug. 25, 2014, 4 Pages.
“Office Action Issued in Taiwan Patent Application No. 093126908”, dated Nov. 22, 2012, 10 Pages.
“Office Action Issued in Taiwan Patent Application No. 093126908”dated May 6, 2013, 9 Pages.
“Office Action Issued in Mexican Patent Application No. PA/a/2005/007073”, dated Jun. 19, 2009, 6 Pages.
“Office Action Issued in Mexican Patent Application No. PA/a/2004/009395”, dated Nov. 11, 2009, 3 Pages.
“Office Action Issued in Indonesian Patent Application No. P00200400478”, dated Apr. 3, 2008, 5 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/741,407”, dated Jan. 23, 2007, 22 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 10/741,407”, dated Jul. 26, 2006, 22 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/800,056”, dated Oct. 19, 2006, 11 Pages.
Olsen, Stefanie, “Yahoo to Test Desktop Search”, Retrieved from: http://web.archive.org/web/20070211093209/http://news.com.com/Yahoo+to+test+desktop+search/2100-1032_3-5486381.html, Dec. 9, 2004, 6 Pages.
“Office Action Issued in U.S. Appl. No. 10/800,056”, dated Apr. 27, 2006, 8 Pages.
“Office Action Issued in U.S. Appl. No. 10/800,056”, dated Jul. 13, 2007, 11 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/836,154”, dated Jan. 28, 2008, 26 Pages.
Kurtenbach, et al., “The Hotbox: Efficient Access to a Large Number of Menu-items”, In Proceedings of the SIGCHI conference on Human Factors in Computing Systems, May 15, 1999, 7 Pages.
Kundaje, Kunal, “Windows Desktop Search”, Retrieved from: http://web.archive.org/web/20051026105719/http://kunal.kundaje.net/reviews/wds.html, Jul. 10, 2005, 7 Pages.
Wagner, Jim, “Microsoft Enters Desktop Search Fray”, Retrieved from: http:www.internetnews.com/ent-news/article.php/3447331, Dec. 13, 2004, 5 Pages.
Slovak, Ken, “Absolute Beginner's Guide to Microsoft Office Outlook 2003”, Que Publisher, 2003, pp. 237-241.
Halvorson, et al., “Microsoft Office XP Inside Out”, In Book—Microsoft Office XP Inside Out, 2001, pp. 1005-1009,1015,1023-1028,1036-1039,1093.
“Office Action Issued in U.S. Appl. No. 10/851,506”, dated Apr. 12, 2007, 20 Pages.
Habraken, Joe, “Microsoft Office XP 8 in 1”, Retrieved from http://proquest.safaribooksonline.com/0789725096/, Jun. 5, 2001, 12 Pages.
“Office Action Issued in U.S. Appl. No. 10/955,928”, dated Jan. 8, 2008, 34 Pages.
Group, Omni, “Omni Web Help”, Retrieved from: http://web.archive.org/web/20071118203423/http://www.omnigroup.com/documentation/OmniWeb/browser/tabs.html, Retrieved on: Dec. 5, 2008, 2 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/955,940”, dated Apr. 7, 2009, 16 Pages.
Goldberg, et al., “Using Collaborative Filtering to Weave an Information Tapestry”, In Communications of the ACM—Special Issue on Information Filtering, vol. 35, Issue 12, Dec. 1992, pp. 61-70.
“Non-Final Office Action Issued in U.S. Appl. No. 10/955,940”, dated Jul. 17, 2008, 18 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 10/955,940”, dated Jun. 4, 2007, 20 Pages.
Dyszel, Bill, “Microsoft Outlook 2000 for Windows for Dummies”, The Wiley Publication, 1999, 12 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/955,941”, dated Apr. 29, 2008, 22 Pages.
Dwelly, Andrew, “Functions and Dynamic User Interfaces”, In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, Sep. 11, 1989, 11 Pages.
“Non- Final Office Action Issued in U.S. Appl. No. 10/955,941”, dated Jul. 11, 2007, 15 Pages.
“Final Office Action Issued in U.S Appl. No. 10/955,942”, dated Aug. 4, 2009, 19 Pages.
Chen, et al., “NiagaraCQ: A Scalable Continuous Query System for Internet Databases”, In Proceedings of the ACM SIGMOD International Conference on Management of Data, vol. 29, Issue 2, Mar. 2000, pp. 379-390.
Camarda, Bill, “Using Microsoft Word 97”, Published by QUE Corporation, Jan. 1997, pp. 412, 869.
“Office Action Issued in U.S. Appl. No. 10/955,942”, dated Jul. 11, 2007, 23 Pages.
“Office Action Issued in U.S. Appl. No. 10/955,942”, dated Apr. 15, 2008, 25 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/955,967”, dated Aug. 4, 2009, 21 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/955,967”, dated Apr. 16, 2008, 18 Pages.
Burns, Simon, “Microsoft Reinvents its Own Wheel”, Retrieved from: http://web.archive.org/web/20070514034824/http://www.theinquirer.net/default.aspx?article=20214, Dec. 14, 2004, 5 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 10/955,967”, dated Jul. 11, 2007, 19 Pages.
Budinsky, et al., “WebSphere Studio Overview”, In IBM Systems Journal, vol. 43, Issue 2, May 6, 2004, 25 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/982,073”, dated Jun. 8, 2009, 11 Pages.
“Final Office Action Issued in U.S. Appl. No. 10/982,073”, dated May 28, 2008, 10 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 10/982,073”, dated Oct. 9, 2007, 10 Pages.
“Office Action Issued in U.S. Appl. No. 10/982,073”, dated Dec. 11, 2008, 12 Pages.
Boyce, Jim, “Microsoft Outlook Inside Out Version”, In Book Microsoft Outlook Version 2002 Inside Out, 2001, pp. 67, 68, 109, 110, 230, 231, 310, 316-318, 798.
“Notice of Allowance Issued in Korean Patent Application No. 10-2004-70500”, dated Jan. 5, 2013, 8 Pages.
“Office Action Issued in Korean Patent Application No. 10-2004-70500”, dated Jan. 7, 2011, 6 Pages.
“Office Action Issued in Korean Patent Application No. 10-2004-70500”, dated Sep. 22, 2011, 3 Pages.
“Office Action Issued in Canadian Patent Application No. 2,482,182”, dated May 7, 2012, 3 Pages.
“Office Action Issued in Canadian Patent Application No. 2,482,182”, dated Jan. 22, 2013, 4 Pages.
“Second Office Action Issued in Canadian Patent Application No. 2,482,182”, dated Feb. 20, 2015, 8 Pages.
“Office Action Issued in Chinese Patent Application No. 200410088294.4”, dated Aug. 10, 2007, 12 Pages.
“Office Action Issued in Chinese Patent Application No. 200410088294.4”, dated Feb. 1, 2008, 29 Pages.
“Office Action Issued in Chinese Patent Application No. 200410088294.4”, dated Jul. 4, 2008, 6 Pages.
“Office Action Issued in Russian Patent Application No. 2004131031”, dated Nov. 14, 2008, 7 Pages.
“Notice of Allowance Issued in Australian Patent Application No. 2004216596”, dated Feb. 24, 2010, 3 Pages.
“Office Action Issued in Australian Patent Application No. 2004216596”, dated Oct. 20, 2009, 2 Pages.
“Notice of Allowance Issued in Japanese Patent Application No. 2004-302186”, dated Oct. 18, 2011, 6 Pages.
“Office Action Issued in Japanese Patent Application No. 2004-302186”, dated Dec. 10, 2010, 7 Pages.
“Office Action Issued in Japanese Patent Application No. 2004-302186”, dated Jun. 10, 2011, 4 Pages.
“Search Report Issued in Singapore Patent Application No. 200504474-8”, dated Jan. 16, 2007, 8 Pages.
“Search Report Issued in Singapore Patent Application No. 200504475-5”, dated Sep. 19, 2006, 15 Pages.
“Search Report Issued in Singapore Patent Application No. 200504508-3”, dated Sep. 18, 2006, 6 Pages.
“Written Opinion Issued in Singapore Patent Application No. 200504508-3”, dated Sep. 18, 2006, 9 Pages.
“Search Report Issued in Singapore Patent Application No. 200505257-6”, dated Feb. 12, 2007, 6 Pages.
“First Office Action Issued in Chinese Patent Application No. 200510089514.X”, dated May 23, 2008, 16 Pages.
“Office Action Issued in Chinese Patent Application No. 200510089514.X”, dated Apr. 3, 2009, 12 Pages.
“Second Office Action Issued in Chinese Patent Application No. 200510089514.X”, dated Nov. 21, 2008, 14 Pages.
“First Office Action Issued in Chinese Patent Application No. 200510092139.4”, dated Mar. 21, 2008, 25 Pages.
“Second Office Action Issued in Chinese Patent Application No. 200510092139.4”, dated Oct. 17, 2008, 19 Pages.
“Third Office Action Issued in Chinese Patent Application No. 200510092139.4”, dated Jun. 19, 2009, 7 Pages.
“First Office Action Issued in Chinese Patent Application No. 200510092141.1”, dated Apr. 11, 2008, 22 Pages.
“Second Office Action Issued in Chinese Patent Application No. 200510092141.1”, dated Oct. 10, 2008, 22 Pages.
“First Office Action Issued in Chinese Patent Application No. 200510092142.6”, dated Apr. 18, 2008, 22 Pages.
“Second Office Action Issued in Chinese Patent Application No. 200510092142.6”, dated Oct. 16, 2009, 9 Pages.
“First Office Action Issued in Chinese Patent Application No. 200510092146.4”, dated Mar. 21, 2008, 21 Pages.
“Russian Office Action Issued in Application No. 2005120363/09”, dated Oct. 26, 2009, 12 Pages.
“Office Action Issued in Russian Patent Application No. 2005120363/28”, dated Jun. 24, 2009, 8 Pages.
Office Action received for Russian Patent Application No. 2005125831/09, dated Jul. 30, 2009, 17 Pages.
“Office Action Issued in Russian Patent Application No. 2005125837/09”, dated Jul. 21, 2009, 10 Pages.
“Office Action Issued in Russian Patent Application No. 2005125839/09”, dated Sep. 10, 2009, 16 Pages.
“First Office Action Issued in Chinese Patent Application No. 200680018095.3”, dated Jul. 3, 2009, 14 Pages.
“Second Office Action Issued in Chilean Patent Application No. 2512-2005”, dated Mar. 4, 2009, 12 Pages.
“Examination Report Issued in New Zealand Patent Application No. 541299”, dated Jul. 25, 2005, 2 Pages.
“Examination Report Issued in New Zealand Patent Application No. 541300”, dated Jul. 25, 2005, 2 Pages.
“Examination Report Issued in New Zealand Patent Application No. 541301”, dated Jul. 25, 2005, 2 Pages.
Schumaker, Dennis, “User Interface Standards”, Retrieved from: https://msdn.microsoft.com/en-us/library/aa217660(office.11.d=printer).aspx, Sep. 2001, 5 Pages.
“About Google Desktop Search”, Retrieved from: http://web.archive.org/web/20041015131838/http://desktop.google.com/about.html, Oct. 15, 2004, 8 Pages.
Riggsby, et al., “Mastering Lotus Notes and Domino 6”, In the Complete Guide to Using and Developing for Lotus Notes and Domino 6, 2003, pp. 18, 22, 33-35, 47, 122, 123, 215-241, 378.
“Convert to Word 2007”, Retrieved from: http://www.regencytraining.com/word-2007-conversion.html, Retrieved on: Apr. 21, 2008, 2 Pages.
“Customer Story: SourceXtreme”, Retrieved from: http://web.archive.org/web/20071028070032/http://trolltech.com/customers/casestories/stories/sourcextreme/, Apr. 22, 2008, 2 Pages.
“Find Any File or Email on Your PC as Fast as You can Type”, Retrieved from: http://www.x1.com, Jan. 1, 2003, 1 Page.
“Inter-Widget Communication”, Retrieved from: http://web.archive.org/web/20071204004440/http://web.mit.edu/6.115/www/miscfiles/amulet/amulet-help/IWC.htm, Retrieved on: Apr. 22, 2008, 6 Pages.
“Lookout”, Retrieved from: http://web.archive.org/web/20040402233643/http://www.lookoutsoft.com/, Apr. 22, 2005, 20 Pages.
“Managing the Code Editor and View”, Retrieved from: https://web.archive.org/web/20090714151035/http://msdn.microsoft.com/en-us/library/z01zks9a(VS.71).aspx, Jan. 2008, 3 Pages.
Riggsby, et al., “Mastering Lotus Notes and Domino 6”, In The Complete Guide to Using and Developing for Lotus Notes and Domino 6, 2003, pp. 135-139.
Riggsby, et al., “Mastering Lotus Notes and Domino 6”, In The Complete Guide to Using and Developing for Lotus Notes and Domino 6, 2003, pp. 135-138, 607-612.
Rich, et al., “Adding a Collaborative Agent to Graphical User Interfaces”, In Proceedings of the 9th Annual ACM Symposium on User Interface Software and Technology, Jan. 1996, 10 Pages.
Pogue, David, “Windows XP Home Edition: The Missing Manual”, In Publication of O'Reilly, 1st Edition, May 1, 2002, pp. 37, 38 and 41.
Piperoglou, Stephanos, “What's Hot in Internet Services?”, Retrieved from: https://web.archive.org/web/19990508222358/http://www.webreference.com/html/tutorial5/3.html, Aug. 20, 1998, 3 Pages.
Piperoglou, Stephanos, “The Style Element & CSS Selectors”, Retrieved from: http://www.webreference.com/html/tutorial5/4.html, Aug. 20, 1998, 3 Pages.
Piperoglou, Stephanos, “The Style Attribute and CSS Declarations”, Retrieved from: https://web.archive.org/web/20150922213836/http://www.webreference.com/html/tutorial5/2.html, Aug. 20, 1998, 3 Pages.
Piperoglou, Stephanos, “Separate Structure and Presentation”, Retrieved from: https://web.archive.org/web/20161012144134/http://www.webreference.com/html/tutorial5/1.html, Aug. 20, 1998, 4 Pages.
“Microsoft Outlook 2000: Introduction to Calendar”, Retrieved from: http://web.archive.org/web/20041102044718/http://www.uakron.edu/its/learning/training/docs/Calendar032502.pdf, Mar. 25, 2002, pp. 1-52.
“Microsoft Publisher 11 Beta Layperson's Specification”, Microsoft Corporation, 2002, 13 Pages.
Piperoglou, Stephanos, “ID & Class Selectors, Pseudoclasses”, Retrieved from: http://www.webreference.com/html/tutorial5/6.html, Aug. 20, 1998, 3 Pages.
Piperoglou, Stephanos, “External Style Sheets”, Retrieved from: https://web.archive.org/web/20150923022741/http://www.webreference.com/html/tutorial5/10.html, Aug. 20, 1998, 3 Pages.
“MSN Desktop Search (beta)”, Retrieved From: http://www.pcmag.com/article2/0,1759,1771841,00.asp, Mar. 2, 2005, 2 Pages.
“Office Action Issued in Malaysian Patent Application No. PI20043832”, dated Dec. 31, 2009, 3 Pages.
“Primary Windows”, Retrieved from: http://web.archive.org/web/20070716034907/http://www-03.ibm.com/servers/eserver/iseries/navigator/guidelines/primary.html, Retrieved on: Feb. 23, 2007, 23 Pages.
“Rainy's Rainlendar”, Retrieved from: http://web.archive.org/web/20040812092939/www.ipi.fi/rainy/index.php?on=projects&project=rainlendar, Retrieved on: Aug. 12, 2004, 18 Pages.
“Office Action Issued in Brazilian Patent Application No. PI0404376-6”, dated Jul. 15, 2016, 4 Pages.
Venolia, et al., “Understanding Sequence and Reply Relationships within Email Conversations: A Mixed-Model Visualization”, In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, vol. 5, Issue 1, Apr. 5, 2003, pp. 361-368.
“Notice of Allowance Issued in Malaysia Patent Application No. PI 20043832”, dated Nov. 14, 2014, 2 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2009/046344”, dated Dec. 29, 2009, 11 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2009/046341”, dated Nov. 30, 2009, 11 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2007/012573”, dated Nov. 27, 2007, 9 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2006/035467”, dated Feb. 6, 2007, 10 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2006/034993”, dated Feb. 26, 2007, 11 Pages.
“Software License Use Management (XSLM)”, Retrieved From: http://pubs.opengroup.org/onlinepubs/9691999399/toc.pdf, Mar. 1999, 286 Pages.
“TeeChart for NET Charting Control”, Retrieved from: http://web.archive.org/web/20030127080821/http://www.teechart.net:80/, Retrieved on: Jan. 27, 2003, 4 Pages.
“The Technology in Document and Check Security”, Retrieved from: http://www.securedoc.in/thetechnology.htm, Retrieved on: Apr. 21, 2008, 7 Pages.
“To-do List—Effective Task Management Software”, Retrieved from: https://web.archive.org/web/20070521185648/http://www.programurl.com:80/to-do-list.htm, Retrieved on: Jan. 2, 2007, 6 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2006/012724”, dated Oct. 17, 2007, 11 Pages.
Padwick, Gordon, “Using Microsoft Outlook 2000”, In Book—Using Microsoft Outlook 2000, Que Publishers, Special Edition, May 1999, pp. 530-533.
“Office Action Issued in Mexican Patent Application No. PA/a/2005/008351”, dated Mar. 3, 2009, 4 Pages.
“Notice of Allowance Issued in Thailand Patent Application No. 0401003526”, dated Mar. 7, 2018, 1 Page.
“Office Action Issued in Thailand Patent Application No. 0401003526”, dated Aug. 31, 2016, 2 Pages.
“Search Report Issued in European Patent Application No. 04021618.6”, dated May 24, 2005, 5 Pages.
“Search Report Issued in European Patent Application No. 04021618.6”, dated Jul. 11, 2005, 3 Pages.
“Office Action Issued in Colombian Patent Application No. 04-094.972”, dated Aug. 21, 2007, 3 Pages.
“Office Action Issued in Colombian Patent Application No. 04-094.972”, dated Oct. 17, 2008, 9 Pages.
“Communicated Action Received for European Patent Office Application No. 04102463.02211”, dated Oct. 20, 2005, 4 Pages.
“Summons to Attend Oral Proceedings Received for European Patent Application No. 04102463.9”, Mailed Date: Jun. 23, 2008, 76 Pages.
“Office Action Issued in Mexican Patent Application No. PA/a/2005/008349”, dated Feb. 5, 2009, 10 Pages.
“European Communication cited in Application No. 07795391.7”, dated Sep. 14, 2009, 5 Pages.
“Office Action Received in Canada Patent Application No. 2482182”, dated Nov. 26, 2013, Filed Date: Sep. 20, 2004, 6 Pages.
“Refusal Letter in Indian Patent Application No. 1921/DEL/2004”, dated Jun. 19, 2019, 3 Pages.
Related Publications (1)
Number Date Country
20050091168 A1 Apr 2005 US