# Patent

## Title
Software product licensing based on a content space

## Abstract

A computer-implemented method for generating software license types, includes collecting, by a processor, a plurality of software product functions, creating, by the processor, a plurality of content space specification files that includes the plurality of software product functions, processing, by the processor, the plurality of content space specification files to generate a plurality of software license types and outputting, by the processor, the plurality of software license types.

## Background
DOMESTIC PRIORITY
This application is a continuation application of the legally related U.S. Ser. No. 13/741,779 filed Jan. 15, 2013, the contents of which are incorporated by reference herein in their entirety.


BACKGROUND
The present invention relates to software licenses, and more specifically, to assigning software license levels implementing a content space.
Software products are often licensed in multiple ways for different markets and customer sets and ship with different license levels. “Higher” license levels correspond to increased function with increased cost to the customer. Three or four levels for a product are not uncommon. For example, some basic level of function may be included with a platform or device or down-loadable from the Internet. For an additional fee the next level of license may be purchased with give the customer more value-add. A typical license structure often relates to the size of the system or platform of number of users that will benefit, with larger systems or larger numbers of users having license fees that are higher. Another license structure relates to functions—some functions are available with a basic license at no additional charge, and stepped levels of function can be licensed for additional fees.
Over successive releases, the cost of maintaining the correct boundaries between license levels and product function tend to grow. There are various reasons for this such as product functional evolution, changes in license level definitions, defect fixes, and competitive pressures.
SUMMARY
Exemplary embodiments include a computer-implemented method for generating software license types, the method including collecting, by a processor, a plurality of software product functions, creating, by the processor, a plurality of content space specification files that includes the plurality of software product functions, processing, by the processor, the plurality of content space specification files to generate a plurality of software license types and outputting, by the processor, the plurality of software license types.
Additional exemplary embodiments include a computer program product for generating software license types, the computer program product including a non-transitory computer readable medium storing instructions for causing a computer to implement a method. The method includes collecting, by a processor, a plurality of software product functions, creating, by the processor, a plurality of content space specification files that includes the plurality of software product functions, processing, by the processor, the plurality of content space specification files to generate a plurality of software license types and outputting, by the processor, the plurality of software license types.
Further exemplary embodiments include a computer-implemented method for generating software license types, the method including collecting a plurality of software product functions, defining a content space including a plurality of cells, each cell defining an software license type, each cell having a plurality of dimensions, creating a plurality of content space specification files that includes the plurality of software product functions, traversing at least one dimension of each of the plurality of cells to generate an software license type, mapping the plurality of software license types to the content space and generating reports defining each of the software license types.
Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with the advantages and the features, refer to the description and to the drawings.



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The forgoing and other features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 illustrates a high level block diagram of a system for generating agile user stories, which then define the software licensing levels/types;
FIG. 2 illustrates a chart representation of the five exemplary dimensions described herein;
FIG. 3 illustrates the system for defining software licensing levels/types based on a content space in software of FIG. 1, further illustrating the content space tool process flow that defines the software licensing levels/types;
FIG. 4 illustrates an example chart illustrating a mapping of content space values to license levels; and
FIG. 5 illustrates an exemplary embodiment of a system in which software product licensing based on a content space can be implemented.



DETAILED DESCRIPTION
In exemplary embodiments, the systems and methods described herein implement a content space to define license levels and boundaries, and utilize boundary definitions. The systems and methods described here in further align license boundaries with content space elements such as noun spaces, interfaces or in verbs (or verb sets). In exemplary embodiments, the license boundaries are aligned with the product content space boundaries at the noun level, such that all of function associated with any given noun (noun space) is in a single license category. However, if the boundary between license levels needs to distinguish verbs for a given noun, or platform, and the like, alignment with other content space elements is supported. Over time, the needs of the business might necessitate realignment or refactoring of license categories that do not align with noun spaces. In such cases the licensing can be aligned with function (‘verb’) boundaries, even if the content space must be adjusted. As such, it will be appreciated that the content space definition enables this type of flexibility. Conformance at run-time to the aligned boundaries can be readily locally checked in the code. The systems and methods described herein therefore lower the defect rate, decrease development and test cost of supporting license categories, and improve the run-time implementation of license checking by centralizing and standardizing the implementation approach, thereby greatly reducing the development and test costs, and at the same time increasing the reliability of product run-time adherence to any current license level.
In exemplary embodiments, the systems and methods described herein associate a given license level with each content space user story, including default as needed. The systems and methods described herein also embed the content space with license levels in the product for run-time use. Furthermore, the systems and methods described herein perform license checking at run-time using the embedded content space.
As described herein, a content space model is implemented for software licensing. A content space is a way of representing software content from an outside-in perspective via a set of dimensions. Each of the content space dimensions has values defined in terms of the software itself that concern a particular aspect, such as information abstraction, function, external interface and run-time environment. The dimension values can represent existing content and also new content for the software, based on requirements (via content space analysis) for a new release. The content space can be programmatically traversed, and as this traversal occurs, end-to-end testable units (termed user stories) are output, each corresponding to a particular region of the content space and having content space coordinates. The set of all output user stories partitions the software content and the set of all new and changed user stories partitions the release requirements. The set of all user stories and various subsets (e.g., all Power user stories) are used to compute the content coverage metric of various scopes.
An example of how a content space can be set up and implemented is now discussed. It will be appreciated that the following example is illustrative of a content space and not limiting.
In exemplary embodiments, the content space can be a five-dimensional space (termed either as a ‘software product content space’ or a ‘content space’), such that each cell within the content space is an end-to-end use case (i.e., agile user story). In exemplary embodiments, the systems and methods described herein can be implemented at various levels of scale, from individual software components to very large products comprising hundreds of components to define the software licensing levels. The five dimensions structure the work as needed by software development (i.e., design, test, project management), and the requirements serve to define the values used on the dimensions. As such, the exemplary content space servers to bridge the requirements domain and implementation domain.
FIG. 1 illustrates a high level block diagram of a system 100 for generating agile user stories, which then define the software licensing levels/types. The system 100 outlines and overviews the exemplary methods, the blocks for which are described further herein. It will be appreciated that each of the summary details described herein includes multiple users from each of the two domains, with multiple reviews. The order in which the individual steps are executed is not necessarily serial. Changes in requirements or additional insights happen during a later step can necessitate reworking the results from an earlier step.
In exemplary embodiments, content space specification files 105 are generated from the various sources in the requirements domain as described herein. As described further herein, the content space specification files are generated from various requirements 101. A content space tool 110 receives the content specification files 105 to automatically generate the agile user stories that can be stored in a user story storage medium 115. An additional storage medium 120 can be implemented to store changes to the specification files 105, or any other suitable output during the content space generation. Once generated, the agile user stories can be output to any suitable project management or test management tool 125 implemented by the users in the development domain.
The system 100 includes several functions, including, but not limited to: 1) articulating the content space; 2) classifying regions of the content space; 3) grouping the regions of the content space; 4) assigning priorities to use cases; and 5) loading the project management tool 125.
In articulating the content space, requirements are analyzed in terms of the five content space dimensions. This analysis results in (with iteration and consensus building) a definition of values for each of the five dimensions, which is represented in a form that can be programmatically processed. In articulating the content space, the systems and methods described herein address whether all the requirements are represented in the content space, whether each content space dimension value is properly defined and agreed upon, and whether all the dimension values are related to explicit, implicit or future requirements.
In classifying the regions of the content space, once the team is satisfied that the content space is defined (i.e., all dimension values known, understood, and reasonably well-defined) and that it does encompass all the requirements for a selected time-frame, the team next decides on how to classify regions of the content space. Through automated systems with team decisions, every cell in the content space is categorized in a variety of types, including, but not limited to: 1) does not apply to the product; 2) does apply to the product but for some future release; 3) is part of the product today (or from some prior release) and has no enhancements or changes; 4) is part of the product today and is enhanced or changed in some way; and 5) is a new or an enhanced function. The systems and methods described herein determine whether each content space dimension value is classified, and reviews of the results determine correctness.
Following agreement on the content space and categorization of regions, the content space regions are then grouped. Subsets of the content space are grouped together into a size which is desirable for project management and the scale of the product and teams. This step applies particularly to the content space regions classified as unchanged and new or enhanced (changed). The two extremes are: an entire content space can grouped into a single output project management work item, or at the other extreme every single content space cell can be output as a single project management line item. Essentially every possible grouping in between these extremes is also supported. Grouping is implemented for all new & changed user stories for a particular platform or for specific sub-variations of a verb.
In exemplary embodiments, there is flexibility in how these regions are selected and how they related to the content space cell classifications. The systems and methods described herein determine whether the grouping is correct and do the groupings properly reflect the tradeoff between project management needs and technical visibility based on classifications and complexity.
The grouping of content space cells into right sized project management work items mostly focused on a new function and an existing and unchanged function. The user (team) can programmatically select the grouping of content space cells based on many considerations such overall content space size, product size, degree of technical difficulty of new function, team size, number of team, and the like. In exemplary embodiments, individual content cells are use cases (with adjustable granularity) and the groupings are user functions or user stories.
Based on the relative priorities of requirements, regions of the content space (subsets of use cases) are assigned priority values. These can be used to help focus review sessions to ensure the right higher priority content is defined. When loaded into a project management application, the priorities can be used directly by development in agile sprint (iteration) planning The output project management work items are input (e.g., ‘import’) for example, from the user story storage medium 115, into an appropriate project management tool 125.
As described herein, a content space can be defined by five dimensions. In exemplary embodiments, the five dimensions of the content space are, in order: release (time); noun; verb; interface; and platform. The three dimensions, verb, interface and platform, are orthogonal and noun-specific. That is, an instance of these (e.g., a verb set, an interface set and a platform set) is defined for each noun of interest. Nouns are the fourth dimension. The combination of a noun and its associated 3D space is termed a ‘noun space’. A set of noun spaces at a given point in time (usually associated with product release) constitute the definition of the content space for a particular release of a product (when the point in time is chosen on a release calendar boundary). Instances a product content space for multiple releases represent the fifth dimension of content space: time.
For illustrative purposes, an example of a software product, a hypothetical browser-based email client is discussed for ease of discussion. It will be appreciated that other products are contemplated for which software licensing levels can be defined.
FIG. 2 illustrates a chart 200 representation of the five exemplary dimensions described herein. As described herein, the five dimensions of the content space are, from inner three to out-most: platform 201; interface 202; verb 203; noun 204; and release (time) 205. All of the values for the dimensions are derived from the product requirements, either explicit or implicit.
The platform dimension 201 is interpreted broadly to include the hardware, operating system, middle ware, hypervisor, and language runtime in which the product executes. Generally, meaningful platform elements are determined by each product. As such, the entire prerequisite software stack and hardware is considered. Values of the platform dimension 201 can include specific releases of each of these platform components as needed, or can be more generally specified. For example, a platform might be AIX 5.2 or just AIX. Alternatively, the platform might be Firefox 3.6 or better, or just Firefox. Values can include as needed ancillary hardware for storage, networking, hardware management controllers, firmware, etc. for the full functional system configuration.
The interface dimension 202 has values chosen to identify and separate the kinds of interfaces that the subject software presents to external entities; people, other software or hardware. The values can be specified by type such as Graphical User Interface (GUI), command line interface (CLI), and so on. The values can include programmable interfaces such as web services (e.g. REST) and APIs. Protocols can also be specified as values (e.g. IPv6 or MPI (Message Processing Interface) used in super-computing environments).
The verb dimension 203 includes values such as functions or operations that are supported by the subject software for a particular noun. The operations may be specified at varying levels of granularity, depending upon the needs of a given set of requirements. For example ‘copy’ or ‘create’ might be sufficient. More fine-grained values such ‘copy to like repository’ and ‘copy to new folder’ can also be used. The decision depends on considerations like how new the function is, or how critical the different forms of copy are to the product stake-holders (those that define requirements), or how technically difficult to implement.
The noun dimension 204 is an abstract entity presented to externals via the interface(s). Most software for direct use by people has a number of such abstractions that people manipulate via the functions (verbs) presented by the software. Example nouns for an email client can include, but are not limited to: inbox; inbox email; folder; and draft email. As with values on the above dimensions, there is flexibility in how coarse-grained or fine-grained the nouns are defined. The right level of noun dimension granularity for a given product and given release depends on the requirements.
The time dimension 205 values include natural values (i.e., discrete units) which are the releases planned for the product. The content space for release n+1 can be various additions and changes relative to the release n content space. These additions, enhancements and other changes affect the release n content space by changing the values defined on the various dimensions. New nouns, new verbs, new platforms, can all be added. Enhancements to exiting nouns and verbs are common are defined explicitly in the n+1 content space.
Because of the way the dimensions are defined, each generated user story is an end-to-end testable unit of function (sometimes termed ‘FVT-able’, where FVT=Function Verification Test). For example, for an “email” client each user story is a cell in the five-dimensional space with coordinates of release, noun, verb, interface and platform. For example, “send an email on Firefox via GUI release n” is represented by a 5-tuple {release n, email, send, GUI, Firefox}, as shown in FIG. 2.
FIG. 3 illustrates the system 100 for defining software licensing levels/types based on a content space in software of FIG. 1, further illustrating the content space tool 110 process flow that defines the software licensing levels. In exemplary embodiments, parameters are collected from the content space specification files 105 at block 305. In addition, any input files and content space symbols and filters are also read into the content space tool 110. As such, following invocation and initialization of the content space tool 110, the content space specification file(s) 105 are read. In addition, the content space specification files 105 are parsed for correctness and various checks are run to help ensure consistency across the possibly multiple files. This processing includes all the symbols and filters. At block 310, the content space is managed. In exemplary embodiments, grouping and folding are techniques to manage content space size. The size of a content space is naturally expressed as the number of user stories it contains, or will output if requested. For example, in software products, content space sizes in range of hundreds to over thirty million. Average sizes can be in the range of two thousand to twenty thousand. Both folding and grouping can manage content space size without eliminating detail from the content space specification files 105.
In grouping user stories, a set of user stories is represented in output as a single user story. For example all the user stories for platform ABC or for function XYZ might be represented by a single output user story. Grouping does not change the size of a content space. Grouping allows the number of output user stories to be directly managed without eliminating any details from the CS specification. There is no limit on the size of a user story group. In exemplary embodiments, grouping is controlled by the user by filters in the content space specification file 105.
As filtering occurs, when a filter matches a user story and the filter has any kind of grouping requested, save the user story is saved in a buffer associated with the filter. After all filtering and all non-grouped user stories are output. The content space tool 110 loops through all the filters that have any kind of grouping. For each filter, the content space tool performs several steps. First, if a simple ‘group’ is requested in the filter, the content space tool 110 generates the single grouping user story, summary field, description field, and the like, and writes to output. The content space tool 110 then continues to the next filter. If a type of ‘group by’ is requested, then for each group by element (e.g., noun, verb, ifc, platform), the content space tool 110 builds subsets of the respective values on the dimension from among the buffered user stories. The content space tool 110 then generates a single user story group for each cross-dimension subset, generates the description field that itemizes the subset of user stories for the group, and writes the user story group.
Folding also reduces the number of output user stories like grouping. But in contrast to grouping, folding reduces the size of the content space. Folding reduces the size of the content space by collecting some number of dimension element values into a single value. The resulting single value is then used as a dimension element value in place of the multiple collected values, thereby reducing the size of the content space. The single resulting value is termed a folding symbol (‘fold sym’).
As described herein, folding does not eliminate the details from the content space specification file. The values collected into a fold sym remain in the content space specification file 105, and the folding done by the fold sym can be toggled on or off. The value-folding can be switched on and off for each of the noun, verb, interface and platform dimensions independently or all four dimensions together. Hence not only are the values still in the spec file, but the content space can also be processed again and user stories generated without folding or different folding, to see the detail. Folding can include both dimension folding and value folding.
In exemplary embodiments, the content space tool 110 processes command line parameters to determine what kinds of folding are requested. If no fold parameter, the content space tool 110 implements the default setting for folding. As the content space specification files 105 are read, the content space tool 110 collects a list of all fold syms, and values for each. After all the noun spaces are read from input files, the content space tool 110 invokes a fold function. The content space tool implements dimension folding first if requested. For each dimension for which folding is requested, the dimension is folded to ‘*’ in each noun space. If value folding is requested for any dimensions that have not been folded, the following steps are implemented. If noun value folding, the content space tool 110 folds the noun values by removing nouns in value list of a fold sym and replace with single instance of the fold sym. For each (remaining) noun space, for each relevant dimension, the content space tool 110 check each dimension value to see if it is in the value list of a fold sym. If the noun is in the value list of the fold sym, then the content space tool 110 removes the value and adds the fold sym (once only) to the dimension list. If folding has been set off, the content space tool 110 takes no action. The content space by default is loaded in this mode. If fold request for the ‘all’ or similar, the interface and platform dimensions are folded (as above) and the verb dimension is value-folded for all noun spaces are folded, and the noun dimension is value-folded.
Referring still to FIG. 3, at block 315, each user story is enumerated in the content space and run through filters to classify and possibly add data. At block 320, the user story groups are generated and at block 325 the software licensing levels/types are mapped to associated permissions as further described herein. At block 330, show requests and a summary are generated. At block 335, the software licensing levels/types and associated content space defining the levels/types are embedded in the associated software product.
In exemplary embodiments, a content space is specified in a form that is processed (read) by the content space tool 110 (e.g., an Agile user story generation program). The specification can be split among multiple files (e.g., the content space specification files 105), which can be processed individually or together. As such, an overall product content space can be split among some number of individual architects for parallel concurrent activity, and then processed as a whole.
In exemplary embodiments, each content space specification file 105 includes some number of noun spaces, defined symbols, and filters. A content space specification file 105 is used to define a content space in a form that can be processed programmatically. In exemplary embodiments, the specification file 105 is implemented to generate user stories and provide various kinds of statistics about the content space, enables content coverage metric, automated comparisons of multiple content spaces (e.g. cross-release), and the like. In exemplary embodiments, the content space specification file 105 includes several statements, which define, among other things, a noun space, that can include noun, verb, interface (ifc) and platform. A content space is a set of noun spaces. As such, a basic content space specification file defines one or more noun spaces. Descriptive names are used for the values on all these dimensions. In exemplary embodiments, additional statements can be added to the content space specification file 105. On statement is symbol (SYM) to simplify maintenance of the content space specification file 105 by reducing redundancy across noun space definitions. Another statement is a filter statement that is used to classify user stories, and to add information to output user stories. In exemplary embodiments, each instance of statements as a group, defines a single noun space. For example, the noun statement gives the noun space a name, and the other verb, interface and platform statements provide the values for which each dimension is named.
As further described herein, a sym statement is a simple mechanism to create a short-hand for a list of values. The short-hand can then be used in defining noun spaces (e.g., in ‘noun’, ‘verb’, ‘ifc’, ‘platform’ statements), in other sym statements, and in filter statements. This implementation of sym statements therefore simplifies use and later changes to the content specification file since the list of related values can reliably changed throughout a set of specification files by changing it in only a single place. For example, assume a content space has 15 noun spaces and 12 of those all use the same platform list. Then that list can defined once as a sym and that sym name used in the 12 noun spaces. The example illustrates a group of related syms that aggregates various example platforms. The sym ‘all email env’ is then used to in the definition of various noun spaces, for example in the ‘draft email’ noun space.
The symbols that end in a trailing ‘_’ (underbar) are fold syms, as is the ‘send_’. The ‘_’ indicates a symbol that can be folded. If the relevant type of value folding is requested (e.g. verb value to fold verb dimension, or platform value to fold platform dimension) then the symbols marked with a trailing ‘_’ are folded. That is, the symbol itself is used in the content space when folded. If not folded the symbol's value list is used in the content space. When folded a symbol is shown in generated user stories with the trailing ‘_’ so that everyone seeing the user story will know it is folded (is an abstraction).
As further described herein, filter statements are used to classify user stories into one of five categories; n/a, future, nochange, changed or new. They also can add to a story a variety of information. A filter statement has the general structure: filter, <expression>, <classification>, <other requests>. The filter expression is a logical expression (i.e., evaluates to True or False) based on the language of the content the content space tool 110. For example, logical operators are supported (i.e., =, !=, >, <, in, not in, etc.) and the variables allowed are ‘noun’, ‘verb’, ‘ifc’, ‘platform’ and defined symbols (sym's). Other keyword-value pairs which may be included in a filter statement include but are not limited to: 1) Owner, owner name; 2) Group or Groupby request; 3) Priority, priority value; 3) Testid, testid value; and 4) Tag, list of tag values. By default, filtering is done after all the content space specification files 105 have been read and after folding is performed. The content space tool 110 has an option to turn off all filtering which is useful at time to check the results of content space changes.
In exemplary embodiments, the content space specification files 105 can implement additional statements, including, but not limited to: 1) comment_off—used to end commented-out block of lines; 2) comment_on—used to start a block of comment lines. Starts skipping; 3) createdby—used to set the field ‘Created By’; 4) csvfile—sets the name of the output .csv file; 5) eof—logically ends file early (rest of file skipped); 6) include—name a file to be included; 7) plannedfor—used to set the RTC field ‘Planned For’; 8) scope—used to set filter scope to file (default) or global; 9) set_filterid_in_summaryfield—true or false (default); 10) set_implicit_folding—true or false (default); 11) set_summary_prefix—Default is “User Story”; 12) set_summary_suffix—Default is category of the user story; 13) tag_exclusion_set—Define a mutually exclusive set of tags; and 14) title—title (label) of content space.
As described herein, the specification files 105 support the definition of symbols used in the defining the values and in the filters, that is, used within the content space specification file itself. This format helps maintain a content space specification by lessening duplication of constants (i.e., dimension values). This format also serves to help the specification file be self-documenting when description names are used for the symbols. For example, a list of platforms used in a prior release might be assigned to a symbol named ‘prior_platforms’. This symbol is then used in the noun spaces as a short-hand for the full list. This symbol can also be used in the filters.
Each use case in a content space is classified using filters into basic categories including, but not limited to: not applicable, future, regression and development. “Not applicable” are use cases judged to likely never be relevant for the product and future are use cases not in the n+1 release but inherent in the content space. In exemplary embodiments, the content space is identified to clearly encompass the requirements to help ensure nothing is missed. In doing so, some use cases are likely to be generated that are not planned for the current release.
In exemplary embodiments, filters are also implemented to add information to the generated use cases. Examples of information that can be added are priority, tags, references to requirements document and the like.
In exemplary embodiments, filters are also implemented to cause sets of use cases to be grouped into a single, broader output use case. Implementing filters in this manner can be helpful in the case regression use cases where fine-grained management and tracking of the individual use cases is not necessary (e.g., due to the existence of automated testing built during previous releases).
In generating the agile use cases, one or more content space specification files 105 are read by the content space tool 110. As described herein, a primary output is the user story storage medium 115. In exemplary embodiments, the user story storage medium can have a comma separated value (.csv) file format, which is a quasi-standard widely used by many software applications. A second type of output is the additional storage medium 120 for various summary and report like information or in progress changes.
As described herein at block 325 in FIG. 3, the systems and methods described herein map the license types to the content space. The content space tool 110 that process the definition of a content space support the addition of attributes to be associated with the generated user stories. Within the content space specification files 105, for example, filter statements may be written that map license type to content space elements such as specific nouns, nouns and verbs, or even sets of nouns, and the like. FIG. 4 illustrates an example chart 400 illustrating a mapping of content space values (i.e., noun, verb, interface and platform) to three license levels A, B, C.
As an example, a workload management software package can include three license levels: 1) Express Edition; 2) Standard Edition; and 3) Enterprise Edition. With the content space noun grouped into sets, four filter statements are implemented to correctly label all the workload management user stories, as follows:












. . .


;


;


scope, global


;


sym, edition_nouns_express, guest OS, host, Platform manager,


Platform Manager VMware, virtual farm,


VS, virtualization capabilities, snapshot of VS


;


sym, edition_nouns_standard, candidate hosts, candidate storage,


capturable servers,


customizations, deploy targets, x86 image,


non-VMC x86 virtual server


;


sym, edition_nouns_enterprise, Server System Pool, server SP scalability,


Network System Pool, placement plan


;


filter, noun in edition_nouns_express, tag, Express


filter, noun.startswith(“VA”) or noun in edition_nouns_standard or


‘TPMfI’ in noun,


tag, Standard


filter, noun in edition_nouns_enterprise or noun.startswith(“workload”)


or ‘VirtualMultiDisk’


in noun,


tag, Enterprise


filter, noun.startswith(“Storage”) or ‘luster’ in noun, tag, Enterprise


. . .


;


;


scope, global


;


sym, edition_nouns_express, email, folder, attachment


sym, basic_verb, send, receive, draft


;


sym, edition_nouns_standard, calendar, filter, distribution list


;


sym, edition_nouns_enterprise, email, security logging, voice


;


filter, noun in edition_nouns_express and verb in basic_verb,


 tag, Express


filter, noun in edition_nouns_standard, tag, Standard


filter, noun in edition_nouns_enterprise and verb not in basic_verb,


 tag, Enterprise









In the example, the nouns listed (e.g. for ‘edition nouns standard’) are the actual nouns used by the workload management software. The example presupposes a single license level per user story and that each ‘higher’ level completely encompasses the ‘lower’ level. For the workload management software, the Standard Edition includes all Express Edition, and Enterprise Edition includes all Standard Edition. In exemplary embodiments, the systems and methods described herein do not require that higher license levels include all features of the lower software levels.
The completeness of the license mapping is verified by inspection of one of the various forms of output (e.g., at block 330 in FIG. 3). The systems and methods described herein examine the output user stories for any that had a license value ‘unassigned’, and if the license value is found, the mapping is incomplete. In another example, a rational team concert (RTC) query can examine all the user stories and find any with multiple or unassigned license field. Reviews of license mapping for correctness is also facilitated by the spreadsheet, selecting all the user stories for a given edition, which can alternatively be done via RTC queries.
As further described herein at block 335 in FIG. 3, the systems and methods described herein embed the license assignments within the associated software product. In exemplary embodiments, the content space is generated with license categories mapped to user stories, and output as a file. In one example, the output file can be in a JavaScript Object Notation (JSON) format. It can be appreciated that other output file formats are also contemplated. In exemplary embodiments, a small set of interfaces and a class are defined to access the embedded content space and access license attributes for a given user story. A new jar file (for example, assuming a Java product) is shipped with the software product.
In exemplary embodiments, when embedding the content space in the software product, license categories that are mapped to the content space can be used during development and testing.
As described herein, the systems and methods described herein also enable run-time authorization checking based on embedded content space. The embedded content space has interfaces that support coordinate determination at run time. As a user interacts with the product through any interface (e.g., a graphical user interface (GUI), command line interface (CLI), representational state transfer (REST), application programming interface (API), and the like), content space coordinates are determined and maintained. License checks are typically performed in multiple places in the GUI so that context menus (for example) can show grayed-out menu items as appropriate for that product install license. The license checks are supported by the embedded content space interfaces.
At run-time, when an action is about to be taken, the current set of content space coordinates is passed to the license checking code. The content space coordinates have values for noun, verb, interface and platform (target of function). Logically, a table look up is performed based on coordinates for the user story license level (attribute) and is compared to the installed license level. If user story level is “less than or equal” to installed level (using for example, the workload management software type license structure described herein), execution of the story is allowed to continue. If not, execution is not permitted or (in GUI example) one or more menu items will be grayed out.
The software product licensing and other content space implementations described herein can be performed in any suitable computing system as now described. FIG. 5 illustrates an exemplary embodiment of a system 500 in which software product licensing based on a content space can be implemented. The methods described herein can be implemented in software (e.g., firmware), hardware, or a combination thereof. In exemplary embodiments, the methods described herein are implemented in software, as an executable program, and is executed by a special or general-purpose digital computer, such as a personal computer, workstation, minicomputer, or mainframe computer. The system 500 therefore includes general-purpose computer 501.
In exemplary embodiments, in terms of hardware architecture, as shown in FIG. 5, the computer 501 includes a processor 505, memory 510 coupled to a memory controller 515, and one or more input and/or output (I/O) devices 540, 545 (or peripherals) that are communicatively coupled via a local input/output controller 535. The input/output controller 535 can be, but is not limited to, one or more buses or other wired or wireless connections, as is known in the art. The input/output controller 535 may have additional elements, which are omitted for simplicity, such as controllers, buffers (caches), drivers, repeaters, and receivers, to enable communications. Further, the local interface may include address, control, and/or data connections to enable appropriate communications among the aforementioned components.
The processor 505 is a hardware device for executing software, particularly that stored in memory 510. The processor 505 can be any custom made or commercially available processor, a central processing unit (CPU), an auxiliary processor among several processors associated with the computer 501, a semiconductor based microprocessor (in the form of a microchip or chip set), a macroprocessor, or generally any device for executing software instructions.
The memory 510 can include any one or combination of volatile memory elements (e.g., random access memory (RAM, such as DRAM, SRAM, SDRAM, etc.)) and nonvolatile memory elements (e.g., ROM, erasable programmable read only memory (EPROM), electronically erasable programmable read only memory (EEPROM), programmable read only memory (PROM), tape, compact disc read only memory (CD-ROM), disk, diskette, cartridge, cassette or the like, etc.). Moreover, the memory 510 may incorporate electronic, magnetic, optical, and/or other types of storage media. Note that the memory 510 can have a distributed architecture, where various components are situated remote from one another, but can be accessed by the processor 505.
The software in memory 510 may include one or more separate programs, each of which comprises an ordered listing of executable instructions for implementing logical functions. In the example of FIG. 5, the software in the memory 510 includes the software product licensing methods described herein in accordance with exemplary embodiments and a suitable operating system (OS) 511. The OS 511 essentially controls the execution of other computer programs, such the software product licensing systems and methods as described herein, and provides scheduling, input-output control, file and data management, memory management, and communication control and related services.
The software product licensing methods described herein may be in the form of a source program, executable program (object code), script, or any other entity comprising a set of instructions to be performed. When a source program, then the program needs to be translated via a compiler, assembler, interpreter, or the like, which may or may not be included within the memory 510, so as to operate properly in connection with the OS 511. Furthermore, the software product licensing methods can be written as an object oriented programming language, which has classes of data and methods, or a procedure programming language, which has routines, subroutines, and/or functions.
In exemplary embodiments, a conventional keyboard 550 and mouse 555 can be coupled to the input/output controller 535. Other output devices such as the I/O devices 540, 545 may include input devices, for example but not limited to a printer, a scanner, microphone, and the like. Finally, the I/O devices 540, 545 may further include devices that communicate both inputs and outputs, for instance but not limited to, a network interface card (NIC) or modulator/demodulator (for accessing other files, devices, systems, or a network), a radio frequency (RF) or other transceiver, a telephonic interface, a bridge, a router, and the like. The system 500 can further include a display controller 525 coupled to a display 530. In exemplary embodiments, the system 500 can further include a network interface 560 for coupling to a network 565. The network 565 can be an IP-based network for communication between the computer 501 and any external server, client and the like via a broadband connection. The network 565 transmits and receives data between the computer 501 and external systems. In exemplary embodiments, network 565 can be a managed IP network administered by a service provider. The network 565 may be implemented in a wireless fashion, e.g., using wireless protocols and technologies, such as WiFi, WiMax, etc. The network 565 can also be a packet-switched network such as a local area network, wide area network, metropolitan area network, Internet network, or other similar type of network environment. The network 565 may be a fixed wireless network, a wireless local area network (LAN), a wireless wide area network (WAN) a personal area network (PAN), a virtual private network (VPN), intranet or other suitable network system and includes equipment for receiving and transmitting signals.
If the computer 501 is a PC, workstation, intelligent device or the like, the software in the memory 510 may further include a basic input output system (BIOS) (omitted for simplicity). The BIOS is a set of essential software routines that initialize and test hardware at startup, start the OS 511, and support the transfer of data among the hardware devices. The BIOS is stored in ROM so that the BIOS can be executed when the computer 501 is activated.
When the computer 501 is in operation, the processor 505 is configured to execute software stored within the memory 510, to communicate data to and from the memory 510, and to generally control operations of the computer 501 pursuant to the software. The software product licensing methods described herein and the OS 511, in whole or in part, but typically the latter, are read by the processor 505, perhaps buffered within the processor 505, and then executed.
When the systems and methods described herein are implemented in software, as is shown in FIG. 5, the methods can be stored on any computer readable medium, such as storage 520, for use by or in connection with any computer related system or method.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In exemplary embodiments, where the software product licensing methods are implemented in hardware, the software product licensing methods described herein can implemented with any or a combination of the following technologies, which are each well known in the art: a discrete logic circuit(s) having logic gates for implementing logic functions upon data signals, an application specific integrated circuit (ASIC) having appropriate combinational logic gates, a programmable gate array(s) (PGA), a field programmable gate array (FPGA), etc.
Technical effects include but are not limited to: 1) generating distinct license boundaries for customers, for test engineers and for development with a simple and localized implementation into the software product via the content space; 2) enabling review and test of the license decisions where checking for completeness is automated; 3) verifying that run-time behavior is in agreement with business decisions is made more transparent which reduces software product defects; and 4) enabling automation of the license assignments, automation of checking for correctness and automation of test case generation.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one more other features, integers, steps, operations, element components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated
The flow diagrams depicted herein are just one example. There may be many variations to this diagram or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention.
While the preferred embodiment to the invention had been described, it will be understood that those skilled in the art, both now and in the future, may make various improvements and enhancements which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the invention first described.

## Claims

1. A computer-implemented method for generating software license types, the method comprising:
collecting, by a processor, a plurality of software product functions;
creating, by the processor, a plurality of content space specification files that includes the plurality of software product functions;
processing, by the processor, the plurality of content space specification files to generate a plurality of software license types;
defining a content space comprising the plurality of content space specification files, wherein the content space includes a plurality of cells, each of the plurality of cells corresponding to one of the plurality of software license types, each of the plurality of cells having multiple dimensions, each of the multiple dimensions having one or more values;
traversing the content space to identify the plurality of software license types;
mapping the software license types to the content space; and
outputting, by the processor, the plurality of software license types.

2. The computer-implemented method as claimed in claim 1 wherein processing the plurality of content space specification files comprises identifying content space specification statements in each of the plurality of content space specification files.

3. The computer-implemented method as claimed in claim 1 wherein the multiple dimensions include a noun dimension.

4. The computer-implemented method as claimed in claim 3 wherein traversing the content space comprises:
for each of the noun dimensions, for each of the plurality of cells:
traversing, by the processor, other dimensions of the multiple dimensions of the cell, one value at a time, to generate an software license type of the plurality of software license types corresponding to the cell.

5. The computer-implemented method as claimed in claim 1 further comprising grouping, by the processor, the content space.

6. The computer-implemented method as claimed in claim 1 further comprising folding, by the processor, the content space.

7. A computer program product for generating software license types, the computer program product including a non-transitory computer readable medium storing instructions for causing a computer to implement a method, the method comprising:
collecting, by a processor, a plurality of software product functions;
creating, by the processor, a plurality of content space specification files that includes the plurality of software product functions;
processing, by the processor, the plurality of content space specification files to generate a plurality of software license types;
defining a content space comprising the plurality of content space specification files, wherein the content space includes a plurality of cells, each of the plurality of cells corresponding to one of the plurality of software license types, each of the plurality of cells having multiple dimensions, each of the multiple dimensions having one or more values;
traversing the content space to identify the plurality of software license types;
mapping the software license types to the content space; and
outputting, by the processor, the plurality of software license types.

8. The computer program product as claimed in claim 7 wherein processing the plurality of content space specification files comprises identifying content space specification statements in each of the plurality of content space specification files.

9. The computer program product as claimed in claim 7 wherein the multiple dimensions include a noun dimension.

10. The computer program product as claimed in claim 9 wherein traversing the content space comprises for each of the noun dimensions, for each of the plurality of cells:
traversing, by the processor, other dimensions of the multiple dimensions of the cell, one value at a time, to generate a software license type of the plurality of software license types corresponding to the cell.

11. The computer program product as claimed in claim 10, wherein the method further comprises grouping the content space.

12. The computer program product as claimed in claim 10, wherein the method further comprises folding the content space.