Abstract: Features are disclosed for injection services that allow a development team to quickly and easily include functionality developed by other teams. The main application server injects functionality into responses. The injected service content may include executable content (e.g., scripts) which may be retrieved from a content distribution network. This provides a framework for integrating various, decoupled features into a single main application.

Abstract: Systems and techniques are disclosed for secure storage and searching of information on insecure search systems. One of the methods is implemented by a system of one or more computers being in communication with clients and search engines. A request associated with storage of client information in a search engine is obtained. First cryptographic information is generated based on a portion of the client information, such that the first cryptographic is to be utilized for indexing by the search engine. Second cryptographic information is generated based on performing an order-preserving encryption process on portion of the client information, such that the second cryptographic information is to be utilized to recover order associated with information included in the portion. The first cryptographic information and the second cryptographic information are provided for storage in the search system.

Abstract: A method, apparatus, and computer program product are disclosed to generate elementary string sets for unit testing regular expressions. In the context of a method, a regular expression is received. The method also creates a deterministic finite automaton based on the regular expression. In addition, the method generates an elementary string set using the deterministic finite automaton. The elementary string is generated to test software that uses the regular expression.

Abstract: A method, apparatus, and computer program product are disclosed to generate elementary string sets for unit testing regular expressions. In the context of a method, a regular expression is received. The method also creates a deterministic finite automaton based on the regular expression. In addition, the method generates an elementary string set using the deterministic finite automaton. The elementary string is generated to test software that uses the regular expression.

Abstract: A method, apparatus and computer program product are provided for testing software programs which use regular expressions. In one regard, a method for determining whether two or more regular expressions are disjoint is provided that includes receiving two or more regular expressions, determining whether at least one common regular expression exists between the two or more regular expressions, and in an instance in which one does not exist, causing an indication of disjointedness to be provided. A corresponding method for determining a common regular expression of two or more regular expressions is also provided that includes causing respective deterministic finite automaton (DFA) representations to be created for two or more regular expressions, causing a DFA representation of a candidate common regular expression to be created based on the DFA representations of the regular expressions and determining if the DFA representation of the candidate common regular expression includes a terminal state.