|Publication number||US6981268 B2|
|Application number||US 10/010,694|
|Publication date||Dec 27, 2005|
|Filing date||Dec 5, 2001|
|Priority date||Dec 5, 2001|
|Also published as||US7703083, US20030105889, US20060037011|
|Publication number||010694, 10010694, US 6981268 B2, US 6981268B2, US-B2-6981268, US6981268 B2, US6981268B2|
|Inventors||Alan Shi, Srivatsan Parthasarathy|
|Original Assignee||Microsoft Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (18), Non-Patent Citations (2), Referenced by (5), Classifications (6), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present application relates generally to application assembly bind histories, and more particularly to systems and methods for resolving .dll versioning problems created by overwriting shared components with different versions of that shared component.
While modem application programs provide various specialized functions tailored to meet the needs of particular types of clients, these applications utilize, at their core, a number of common functions. While the code to execute these common functions may easily be incorporated into each application program, such would increase the size and complexity of these application programs, and would increase their cost due to the increased manpower needed to duplicate code for these common functions. Because so many common functions exist, it was recognized early on that the code for these functions could be stored in an accessible library, the components of which could simply be called by the application program when such a function were needed. This greatly simplifies the programming necessary within an application and reduces the cost associated with the initial coding and development of that program.
The various functions are contained in separately named files which are called by the application program when that function is to be performed. In a Windows environment, such shared functions are stored in dynamic link library (DLL) files ending with the extension .dll. All these .dll files are typically stored in a common directory, e.g. c:\WinNT\System32\*.dll. While many core .dll files are provided with the operating system, new application programs loaded on a computer are often shipped with the .dll files needed for its proper operation. During installation of the application program, the application and all of its components (.dll files) are installed. If one of the shared components already exists, most installation programs will simply overwrite the already installed .dll file with the component included with the application that is being installed. While some installation programs provide the user with a choice of whether or not to install the shared component that is provided with the application program, choosing not to install this .dll file may result in the application being installed not working properly. Therefore, most users typically install all the components provided with the application program to ensure its successful operation.
However, while installing the provided .dll file should guarantee successful operation of the application being installed, it is no guarantee that applications installed previously that use that same shared .dll file will continue to operate properly with the version that overwrote the shared component that was originally installed when the other program was installed. Unfortunately, since the code that loads the .dll files does not express any versioning information of the .dll that it wants to load, and hence loads any .dll that has the same name as that for which it was looking, a subsequent failure of an application program to operate properly due to a shared component being overwritten with a different version of that component was difficult to fix.
A feature provided in the Windows ME operating system called “System Restore” allows users to essentially choose which versions of the shared components to put in the shared location. This feature keeps track of every time a user installs or uninstalls an application, and records the state of things like the registry and the contents of the directory \winnt\system32 before and after the install or uninstall. When a user chooses to rollback, the feature simply installs or uninstalls applications to try to get back to the state that existed before the last install or uninstall. In this way, if the installation of a new application causes other applications to break due to the overwriting of the shared component with a new version of that component, System Restore allows the user to effectively reinstall the old version of the shared component so that all application programs will use that older version of that shared component. If the new application will not operate properly with the old version of the shared component, System Restore will allow the user to replace that older version with the newer version so that the new application can operate correctly, although the old applications may again break. This presents a significant advantage over prior system that did not have this ability. However, this system still allows only a single shared component that must be used by all applications that require that shared component to be stored in the shared location. As such, a user may have to access the system restore function multiple times to operate different application programs in the situation just discussed.
In view of the above, it is an object of the invention to provide a new and improved system and method for tracking application assembly bind information. Preferably, the system and method of the present invention provides a mechanism for storing and indexing this information for each application bind, and for subsequent application binds that result in a different version of an assembly when the application is run. The system and method of the present invention also allows more subtle operational characteristic flaws to be corrected if the operation does not conform to a desired mode of operation as determined by a user.
In one embodiment of the present invention a application restore tool is provided that includes a user interface that allows a user to reconfigure the assembly binds to a state when the application operated properly, according to the user. Initially, this embodiment of the application restore tool provides a default selection to the previous bind for all assemblies used by the application. This is based on the assumption that the application operated properly the previous time it was run, and that the recognition of the “improper” operation is detected at its first occurrence. However, recognizing that such may not be the case, the tool also provides advanced options that allow a user to reconfigure the assembly binds to previous date/time stamps (snapshots) to maximize the possibility of achieving a configuration that is satisfactory to the user. The tool also preferably provides a safe mode that enables the option to reconfigure the assembly binds for an application to its default settings or reference version. That is, the safe mode requires that the version with which the application was tested when the application developer/deployer released the application initially. It can be a per-assembly setting, or global for all assemblies used by the application.
As may now be apparent, the system and method of the present invention persists for later diagnosis and analysis all the information relevant in determining the final version (i.e. post policy reference) of an assembly that is returned by an application bind request. Such information includes a description of the original assembly referenced, as well as the version redirect information from each stage in the policy resolution process. The system and method of the present invention maintains the dates/time “snapshots” when applications were known to execute with a particular set of assemblies. Each “snapshot” reflects a time when a different version of an assembly is used by the application than it used in the most previous invocation. These “snapshots” are recorded in a bind history data structure that, at the top-most level, is organized by application name and by the user that executed the application. A directory is created in the non-roaming user-profile directory to record all the bind policy history file logs. One log file is created for each application that is run on the system. Within this history file, the entire set of assemblies that were used by that application, along with the bind policy history information, is stored and indexed by the date/time “snapshots” described above.
Through the system and method of the present invention, the persisted information can be analyzed to pinpoint exact differences between different invocation “snapshots”. Recommendations and/or repairs can then be performed to restore the application to the state where the assembly binding matched the desire behavior. This rollback/repair mechanism is accomplished through persisting and analyzing the bind policy information. The present invention performs dynamic, run-time analysis of assembly binds in the context of a running application. It categorizes information about the set of assemblies used by the application at a particular time, and only when there are detectable changes in the assemblies used by the application will new “snapshots” be recorded. That is, each date/time “snapshot” reflects dates when at least one assembly requested by the application resulted in the retrieval of a different version than used in the most recently recorded “snapshot.”
Additional features and advantages of the invention will be made apparent from the following detailed description of illustrative embodiments which proceeds with reference to the accompanying figures.
While the appended claims set forth the features of the present invention with particularity, the invention, together with its objects and advantages, may be best understood from the following detailed description taken in conjunction with the accompanying drawings of which:
Turning to the drawings, wherein like reference numerals refer to like elements, the invention is illustrated as being implemented in a suitable computing environment. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a personal computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multi-processor systems, microprocessor based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. 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. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
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, 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. 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. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
With reference to
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-removable 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, CD-ROM, 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 be 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 the 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,
The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media discussed above and illustrated in
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 another 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 personal computer 110, although only a memory storage device 181 has been illustrated in
When used in a LAN networking environment, the personal 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 personal computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
In the description that follows, the invention will be described with reference to acts and symbolic representations of operations that are performed by one or more computer, unless indicated otherwise. As such, it will be understood that such acts and operations, which are at times referred to as being computer-executed, include the manipulation by the processing unit of the computer of electrical signals representing data in a structured form. This manipulation transforms the data or maintains it at locations in the memory system of the computer, which reconfigures or otherwise alters the operation of the computer in a manner well understood by those skilled in the art. The data structures where data is maintained are physical locations of the memory that have particular properties defined by the format of the data. However, while the invention is being described in the foregoing context, it is not meant to be limiting as those of skill in the art will appreciate that various of the acts and operation described hereinafter may also be implemented in hardware.
As described in the background section above, when a user runs an application on a computer platform such as that just described, requests for binds for different assemblies are made by the application to retrieve objects that expose certain desired functionality. The computer operating system typically handles these requests by locating and returning the proper assembly requested by the application. Typically, when an application is compiled, references to the assemblies needed by that application are recorded within the application binary itself. However, recognizing that changes to these assemblies may be desired in the future, a preferred operating system provides a flexible policy mechanism whereby various parties can change these references without having to recompile the application. Specifically, these various parties can change an application's request for one version of an assembly to another version of the same assembly. While the format of such policy may vary depending upon the particular operating system utilized, in a Windows environment such policy is expressed in the form of XML files.
While the problem discussed in the background section above results from overwriting an older version of an assembly with a newer version upon installation of a different application program, the system and method of the present invention preferably operate with an operating system that allows multiple versions of an assembly to be stored in the shared store. To differentiate these different versions of the assemblies, they may be assigned a cryptographic signature called a strong name. This provides name uniqueness for the assembly and prevents another user or application from taking over the name of the assembly, either as a result of name spoofing for malicious purposes, or through mere inadvertence. When a new assembly is deployed that will be shared among many applications on the same computer, it must have a strong name or utilize another mechanism that allows for multiple versions to be stored to prevent the problem discussed above. These assemblies, which may be provided by third-party developers, are installed in a common location in the system. By default, the system looks for each program's components or assemblies in that common or shared location, which is known as the global assembly cache (GAC) in a Microsoft Windows environment. The location of such a shared store will vary based upon the particular operating system.
In prior COM+applications, this mechanism is heavily dependent of the registry, where information about each component is stored including information about its version and physical file location. Unfortunately, while this prior method allows multiple applications to share a single component, it also allows situations where installing a component with one application can overwrite the existing installed component, possibly causing other applications to break as discussed above. Also as discussed above, this situation is often difficult to detect since the offending application appears to work fine and, by the time the broken application is run, it might not be possible to recover the common files to a stable configuration.
As just indicated, the solution to this problem is to more strongly associate a distinct build of a component assembly with the client application. This distinct build may be indicated by the combination of four fields that uniquely identify the assembly: name, version, public key token, and culture. The system can then be sure to isolate these component assemblies so that different versions can be running at the same time for different client applications, something that was not possible in previous operating systems. This system of protection may be referred to as side-by-side execution (in contrast to backward compatible execution), since applications can run along side other versions of the same applications without affecting their respective execution environments.
To mark an assembly as sharable, it must be signed using a private key. This private key has a public key pair that may be used for verification. Once the private key has been generated, the assembly may be signed, specifying the key file to be assigned to that assembly. In the Windows environment, such assembly construction utilizes a strong name tool (SN.exe), a detailed description of which is beyond the scope of this application.
Once the shared assembly is stored in the common location, assembly binding (policy) redirections that change the reference version stored in the application binary itself may occur. As illustrated in
Each of the levels of bind policy illustrated in
The publisher policy 204 typically effectuates changes in assemblies directed by the operating system manufacturer or by anyone who publishes shared components that may be stored in the GAC. For example, such publisher policy bind redirections may be the result of testing that has revealed a security hole in the current version of a shared component assembly used by many different applications. In such a case, a “fix” (which includes new assembly+publisher policy with the redirect information) would be downloaded so that all applications that rely on that shared component may take advantage of the solution to a global problem with that assembly. However, since the publisher policy 204 typically addresses global type issues, it is envisioned that a majority of individual application malfunctions may occur as a result of this publisher policy redirection 204.
Finally, the processing of the administrator policy bind redirection 206 allows for corporate network administrators or other IT professionals to control operation within their networks to effectuate corporate security/policy directives. Indeed, such administrator policy bind redirections may require specific authorization or approval (e.g. admin access) before bind redirections directed thereby may be bypassed or countermanded. That is, a corporate IT professional may not wish to have a prior version of an assembly utilized by anyone within the corporate network, even if such results in erroneous operation for a minority of application programs run by a few of the corporate network users.
The system and method of the present invention may be thought of as containing two components or two main functional processes to provide the functionality described above. Specifically, one component of the present invention effectuates the persistence of the bind history information, while another component retrieves this persisted information so that a user may roll back the configuration of the application to a point when the application performed as expected. Preferably, the information to be stored on disk is recorded in an in-memory data structure, which is passed to the writer component to persistence to disk immediately before a successful bind completes. However, this process may be deferred until process shut-down as an optimization.
To illustrate the initial collection of the bind information as the bind policies are executed, attention is directed to the simplified flow diagram of
The component that is responsible for writing the bind history information to disk needs to assess whether the current bind information passed at step 228 should be appended to the most recent “snapshot” recorded, or if a new “snapshot” should be recorded for all assemblies of the current application. In flow diagrammatic form this process is illustrated in
If no previous bind history has been recorded to disk (such as is the case when an application is run for the first time), the information is stored in an in-memory data structure at step 246 until the application program is shut down as determined by step 248. In this situation, once the application program is shut down a new bind history “snapshot” is recorded as indicated by step 250. Similarly, if the application had been run before (and hence a previous snapshot had been created) and the binds in the current run did not change except that the application used an additional assembly not used in the previous run, the information is rolled into the current, most recent snapshot. In this recording process, the system of the present invention checks to determine if there is any information stored in memory for the current application at step 252. If there is such information, that information is written to the “snapshot” at step 254. If there is no such information, or once such information is written into the “snapshot”, the process ends 256.
If, at step 244, it is determined that a previous bind history record does exist, the system of the present invention compares the previous bind history information to the current bind history information at step 258 to determine if any difference exists between the previous bind history record and that information generated by the most recent assembly bind. If it is determined that there is no difference between the bind information previously recorded and currently generated at step 260, the current information is simply stored in an in-memory data structure at step 262 before this process ends 264. This information may be utilized to form a new assembly bind history record if any differences are found to exist in subsequent assembly binds for the current application. That is, once a difference is detected at step 260 between the previous bind information for an assembly and that which is currently bound for the current application, a new bind history “snapshot” is recorded as indicated by step 250. Once this process has begun, step 252 checks to determine it there is any information stored in an in-memory data structure. Such information could have come from step 246 or step 262 discussed above. If such information exists for other assemblies for the current application, step 254 writes this information from the in-memory data structure to the new “snapshot” before the process ends at step 256.
To gain a fuller understanding of the practical functioning of the previous flow diagrams of the system of the present invention, attention is directed to the two bind history data structures illustrated in
As illustrated in each of the two “snapshots” 266, 268 illustrated in
In the following example, it is assumed that the calculator application has never been run on the system and that there are no bind policy redirections at its first running for any of the assemblies to which the application program binds. It is further assumed that the order in which the binds are processed in this example is the system assembly, then the math assembly, etc., although the order is irrelevant.
When the calculator program is first executed, the code will request each of the assemblies that it requires. Since no bind policy history information has previously been recorded, the bind information for each of these separate binds to these separate assemblies is stored in an in-memory data structure at step 246 of the process illustrated in flow diagrammatic form in
Now assume that a publisher policy is installed that changes the version of the math assembly from version 126.96.36.199 to version 188.8.131.52. If the calculator program is run after this publisher policy has taken effect, the assembly bind to the system assembly (which takes place in this example before a bind to the math assembly) will not reveal any difference in the previous bind history stored in “snapshot” 266 with that of the current running of the calculator program. Therefore, at step 262 the system assembly bind information will be stored in an in-memory data structure. However, when the calculator program performs the bind to the math assembly, the information recorded will reveal a difference at step 260 of the process of
As the calculator program accomplishes additional binds to other assemblies step 238 will recognize that a new bind history “snapshot” is being recorded, and will therefore record the bind information for each of these additional assemblies in the new bind history “snapshot” at step 240. All further assemblies required by the calculator program will also be written to the new bind history “snapshot” in the same manner.
If, in this or subsequent uses of the calculator program, the user determines that this application program is functioning in a manner different than the prior functionality, or in a way that does not suit the user's preferences as a result of the bind redirection for one or more of the assemblies utilized by this application, the user may invoke the application restore tool that forms a part of the system and method of the present invention.
When this tool is invoked, a user interface window 270 such as that illustrated in
Once an application has been selected by the user, the application restore tool displays a user interface window 276 that informs the user that the selected application will be restored to the prior configuration identified by date. If this meets the user needs, the user need only select the ok button 278 to restore the application to that prior configuration.
If, however, this prior configuration does not meet the needs of the user, the user may select the advanced options button 280 for more options. When this button is selected, a user interface 282 such as that illustrated in
In addition to the above, the bind history information may be extracted to provide a variety of statistics about the assemblies used by an application. These include determining which assemblies are actually used by an application, determining what policies, if any, apply to assemblies being used by an application, determining which applications are using particular assemblies stored in the assembly cache, etc.
In view of the many possible embodiments to which the principles of this invention may be applied, it should be recognized that the embodiment described herein with respect to the drawing figures is meant to be illustrative only and should not be taken as limiting the scope of invention. For example, those of skill in the art will recognize that the elements of the illustrated embodiment shown in software may be implemented in hardware and vice versa or that the illustrated embodiment can be modified in arrangement and detail without departing from the spirit of the invention. Therefore, the invention as described herein contemplates all such embodiments as may come within the scope of the following claims and equivalents thereof.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5303379 *||Aug 28, 1992||Apr 12, 1994||Wang Laboratories, Inc.||Link mechanism for linking data between objects and for performing operations on the linked data in an object based system|
|US5408665 *||Apr 30, 1993||Apr 18, 1995||Borland International, Inc.||System and methods for linking compiled code with extended dictionary support|
|US5414846 *||Sep 30, 1992||May 9, 1995||International Business Machines Corporation||Method for facilitating the configuration of programs|
|US5615400 *||Jun 30, 1993||Mar 25, 1997||Apple Computer, Inc.||System for object oriented dynamic linking based upon a catalog of registered function set or class identifiers|
|US5619716 *||Jun 6, 1995||Apr 8, 1997||Hitachi, Ltd.||Information processing system having a configuration management system for managing the software of the information processing system|
|US5634114 *||Jul 3, 1995||May 27, 1997||Intel Corporation||Dynamic link library version negotiation|
|US5649200 *||Dec 2, 1996||Jul 15, 1997||Atria Software, Inc.||Dynamic rule-based version control system|
|US5758154 *||Jun 5, 1996||May 26, 1998||Microsoft Corporation||Method and system for storing configuration data into a common registry|
|US5878262 *||Jan 31, 1997||Mar 2, 1999||Hitachi Software Engineering Co., Ltd.||Program development support system|
|US6185734 *||Jul 21, 1998||Feb 6, 2001||Hewlett-Packard Company||Hierarchical registry structure for managing multiple versions of software components|
|US6202205 *||Jul 21, 1998||Mar 13, 2001||Hewlett-Packard Company||System and method for profile-based, on-the-fly optimization of library code|
|US6247175 *||Dec 22, 1998||Jun 12, 2001||Nortel Networks Limited||Method and apparatus for identifying and removing unused software procedures|
|US6301592 *||Nov 4, 1998||Oct 9, 2001||Hitachi, Ltd.||Method of and an apparatus for displaying version information and configuration information and a computer-readable recording medium on which a version and configuration information display program is recorded|
|US6449624 *||Oct 18, 1999||Sep 10, 2002||Fisher-Rosemount Systems, Inc.||Version control and audit trail in a process control system|
|US6505204 *||Mar 31, 1999||Jan 7, 2003||Internet Design Engineering Automation Center, Inc.||Engineering services coordinating system and method therefor|
|US6704797 *||Jun 10, 1999||Mar 9, 2004||International Business Machines Corporation||Method and system for distributing image-based content on the internet|
|US6871344 *||Apr 24, 2001||Mar 22, 2005||Microsoft Corporation||Configurations for binding software assemblies to application programs|
|US20020019972 *||Apr 24, 2001||Feb 14, 2002||Grier Michael J.||Isolating assembly versions for binding to application programs|
|1||*||(No name given) .NET Framework Tutorials: Assembly Binding Log Viewer, http://msdn.microsoft.com/library/default.asp?url=/library/en-us/cptutorials/html/assembly<SUB>-</SUB>binding<SUB>-</SUB>log<SUB>-</SUB>viewer<SUB>-</SUB>deployment.asp, 2005.|
|2||*||J. Richter, .NET Framework: Building, Packaging, Deploying, and Administering Applications and Types-Part 2, http://msdn.microsoft.com/msdnmag/issues/01/03/buildapps2/default.aspx, Mar., 2001.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7823146 *||Nov 5, 2004||Oct 26, 2010||Computer Associates Think, Inc.||Method and system for software installation|
|US8776097||Sep 14, 2011||Jul 8, 2014||Myspace, Llc||Dynamic native binding for managed assemblies|
|US8868495||Aug 30, 2007||Oct 21, 2014||Netapp, Inc.||System and method for indexing user data on storage systems|
|US20050114864 *||Nov 5, 2004||May 26, 2005||Surace Luke A.||Method and system for software installation|
|WO2012037270A1 *||Sep 14, 2011||Mar 22, 2012||Myspace, Inc.||Dynamic native binding for managed assemblies|
|International Classification||G06F9/00, G06F9/445|
|Cooperative Classification||G06F9/44536, G06F9/44521|
|Dec 5, 2001||AS||Assignment|
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHI, ALAN;PARTHASARATHY, SRIVATSAN;REEL/FRAME:012373/0198
Effective date: 20011130
|May 27, 2009||FPAY||Fee payment|
Year of fee payment: 4
|Mar 18, 2013||FPAY||Fee payment|
Year of fee payment: 8
|Dec 9, 2014||AS||Assignment|
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034541/0001
Effective date: 20141014