Abstract: Application programming interface (API) management is provided. The API management comprises defining a number of GraphQL policies and integrating the GraphQL policies into an API assembly, wherein the GraphQL policies number among other API policies at an API gateway. When a query is received from a client, the GraphQL policies are enforced on the query at the API gateway, and the query is modified if it does not comply with the GraphQL policies. The query is then sent to a GraphQL backend server. A response to the query is received from the GraphQL backend server, and the GraphQL policies are enforced on the response at the API gateway, and the response is modified if it does not comply with the GraphQL policies. The response is then sent to the client.

Abstract: Application programming interface (API) management is provided. The API management comprises defining a number of GraphQL policies and integrating the GraphQL policies into an API assembly, wherein the GraphQL policies number among other API policies at an API gateway. When a query is received from a client, the GraphQL policies are enforced on the query at the API gateway, and the query is modified if it does not comply with the GraphQL policies. The query is then sent to a GraphQL backend server. A response to the query is received from the GraphQL backend server, and the GraphQL policies are enforced on the response at the API gateway, and the response is modified if it does not comply with the GraphQL policies. The response is then sent to the client.

Abstract: Task scheduling in cooperative multi-tasking environments is accomplished by a task scheduler that evaluates the relative priority of an executing task and tasks in a queue waiting to be executed. The task scheduler may issue a suspend request to lower priority tasks so that high priority tasks can be executed. Tasks are written or compiled with checks located at opportune locations for suspending and resuming the given task. The tasks under a suspend request continue operation until they reach a check, at which point the task will suspend operation depending on specific criteria. By allowing both the task and the task scheduler to assist in determining the precise timing of the suspension, the multi-tasking environment becomes highly efficient and responsive.

Abstract: A system and method for describing and locating web services. The system may include a server and a proxy located at a front-end of the server. The server may have an associated Web Services Description Language (WSDL) that identifies web services on the server. The proxy may be structured to automatically construct a synthetic WSDL based on configuration metadata and the WSDL; and implement the synthetic WSDL to automatically mediate requests at the proxy to be appropriate for the WSDL at the server.

Abstract: A method, apparatus and computer program product for performing program optimization using Automaton Loop Construct (ALC) is presented. At least one ALC is defined and a program is constructed utilizing the at least one ALC. The program is optimized, the optimizing including pre-computing as much output as possible using the at least one ALC, the optimizing resulting in optimized program code.

Abstract: A computer-implemented method of creating a schema specific parser for processing Extensible Markup Language (XML) documents can include identifying a plurality of XML processing templates, wherein each of the plurality of XML processing templates performs a specific task of processing an XML document against an XML schema component. An XML schema including a plurality of components can be received. A hierarchy of the plurality of components of the XML schema can be determined. An execution plan specifying a hierarchy of XML processing instructions can be created, wherein each XML processing instruction is associated with an XML processing template from the plurality of XML processing templates. The hierarchy of the XML processing templates can be determined according to the hierarchy of components of the XML schema. The execution plan can be compiled to generate the schema specific parser. The schema specific parser can be output.

Abstract: A computer-implemented method of processing an Extensible Markup Language (XML) document can include loading an execution plan into a virtual machine, wherein the execution plan represents an XML schema, and loading an XML document into the virtual machine. XML processing functions available within the virtual machine can be selectively invoked according to the execution plan, wherein the XML processing functions operate upon the XML document. An indication of whether the XML document is valid according to the XML processing functions can be output.

Abstract: A program specializer employs input specialized data structures by generating an input specialized definition of a set of data elements, and parsing an application program to identify data element references to data elements in the generated input specialized definitions of data elements. The program specializer replaces or rewrites the identified data element references with the corresponding input specialized definition. The input specialized data elements from the input specialized program are employed in a particular view by generating a mapping of source data types to preferred data types, such that the preferred data types have access advantages over the source data types, and receiving a markup application program having source data types operable to be modified in the input specialized program. A view mapper maps, using the generated mapping, a source data type to a preferred data type, and applies the mapped preferred data type to occurrences of the corresponding source data type.

Abstract: A computer-implemented method of creating a schema specific parser for processing Extensible Markup Language (XML) documents can include receiving an XML schema comprising a plurality of components, determining a hierarchy of the plurality of components of the XML schema, and creating an execution plan specifying a hierarchy of XML processing instructions. Each XML processing instruction can be associated with an XML processing function of a virtual machine that performs an XML document processing task. The hierarchy of XML processing instructions can be determined according to the hierarchy of components of the XML schema. An instruction causing the virtual machine to invoke a de-serialization module that extracts at least one item of information from the XML document can be inserted into the execution plan. The execution plan can be compiled into a bytecode version of the execution plan that is interpretable by the virtual machine. The bytecode version of the execution plan can be output.

Abstract: A system and method for describing and locating web services. The system may include a server and a proxy located at a front-end of the server. The server may have an associated Web Services Description Language (WSDL) that identifies web services on the server. The proxy may be structured to automatically construct a synthetic WSDL based on configuration metadata and the WSDL; and implement the synthetic WSDL to automatically mediate requests at the proxy to be appropriate for the WSDL at the server.

Abstract: A method in one embodiment includes receiving an XSLT transformation; analyzing the transformation for determining which information about the input is required to generate code that is streaming with respect to the rest of the input; calculating an algorithm which when given the required input information will then execute the entire XSLT transform in a streaming fashion; and generating code for computing the information about the input that is required for the calculated streaming algorithm while simultaneously buffering all incoming input data; storing the generated code; receiving incoming input data; running the generated code for computing the information that is required for the calculated streaming algorithm while simultaneously buffering incoming data; and once the required information has been computed: replaying the buffered data through the calculated streaming algorithm in a streaming manner; and finishing any remaining input through the calculated streaming version of the input algorithm in a st

Abstract: Task scheduling in cooperative multi-tasking environments is accomplished by a task scheduler that evaluates the relative priority of an executing task and tasks in a queue waiting to be executed. The task scheduler may issue a suspend request to lower priority tasks so that high priority tasks can be executed. Tasks are written or compiled with checks located at opportune locations for suspending and resuming the given task. The tasks under a suspend request continue operation until they reach a check, at which point the task will suspend operation depending on specific criteria. By allowing both the task and the task scheduler to assist in determining the precise timing of the suspension, the multi-tasking environment becomes highly efficient and responsive.

Abstract: A computer-implemented method of creating a schema specific parser for processing Extensible Markup Language (XML) documents can include receiving an XML schema comprising a plurality of components, determining a hierarchy of the plurality of components of the XML schema, and creating an execution plan specifying a hierarchy of XML processing instructions. Each XML processing instruction can be associated with an XML processing function of a virtual machine that performs an XML document processing task. The hierarchy of XML processing instructions can be determined according to the hierarchy of components of the XML schema. An instruction causing the virtual machine to invoke a de-serialization module that extracts at least one item of information from the XML document can be inserted into the execution plan. The execution plan can be compiled into a bytecode version of the execution plan that is interpretable by the virtual machine. The bytecode version of the execution plan can be output.

Abstract: A computer-implemented method of processing an Extensible Markup Language (XML) document can include loading an execution plan into a virtual machine, wherein the execution plan represents an XML schema, and loading an XML document into the virtual machine. XML processing functions available within the virtual machine can be selectively invoked according to the execution plan, wherein the XML processing functions operate upon the XML document. An indication of whether the XML document is valid according to the XML processing functions can be output.

Abstract: A computer-implemented method of creating a schema specific parser for processing Extensible Markup Language (XML) documents can include identifying a plurality of XML processing templates, wherein each of the plurality of XML processing templates performs a specific task of processing an XML document against an XML schema component. An XML schema including a plurality of components can be received. A hierarchy of the plurality of components of the XML schema can be determined. An execution plan specifying a hierarchy of XML processing instructions can be created, wherein each XML processing instruction is associated with an XML processing template from the plurality of XML processing templates. The hierarchy of the XML processing templates can be determined according to the hierarchy of components of the XML schema. The execution plan can be compiled to generate the schema specific parser. The schema specific parser can be output.

Abstract: A program specializer employs input specialized data structures by generating an input specialized definition of a set of data elements, and parsing an application program to identify data element references to data elements in the generated input specialized definitions of data elements. The program specializer replaces or rewrites the identified data element references with the corresponding input specialized definition. The input specialized data elements from the input specialized program are employed in a particular view by generating a mapping of source data types to preferred data types, such that the preferred data types have access advantages over the source data types, and receiving a markup application program having source data types operable to be modified in the input specialized program. A view mapper maps, using the generated mapping, a source data type to a preferred data type, and applies the mapped preferred data type to occurrences of the corresponding source data type.

Abstract: A method, apparatus and computer program product for performing program optimization using Automaton Loop Construct (ALC) is presented. At least one ALC is defined and a program is constructed utilizing the at least one ALC. The program is optimized, the optimizing including pre-computing as much output as possible using the at least one ALC, the optimizing resulting in optimized program code.

Abstract: A program specializer employs input specialized data structures by generating an input specialized definition of a set of data elements, and parsing an application program to identify data element references to data elements in the generated input specialized definitions of data elements. A data structure generator responsive to the program specializer computes an input specialized definition corresponding to each of the identified references data element references, and a parser in the program specializer replaces or rewrites the identified data element references with the corresponding input specialized definition. Computing the input specialized definition includes determining an index for offset indirection, therefore having offset references to members of the data element, such that the data element members are operable for indexed references by the resulting input specialized application program.

Abstract: An extensible file access method for accessing a first foreign file system from a data processing system with a first native file system, said first foreign file system and said first native file system implementing different file system protocols. The foreign file system is accessed by issuing a request according to the native file system protocol for data stored in the foreign file system; translating the native file system request to an intermediate programming interface, wherein the intermediate programming interface is different from both the native file system protocol and the foreign file system protocol; translating the intermediate file system request to the foreign file system protocol; and returning to the client a response from the foreign file system responsive to the translated request.

Abstract: A software system is provided to allow a computer to install and process web applications according to the invention. Such web applications are written as web pages that have access to the full range of operating system resources, including those not accessible through a web browser. Preferably, a web application is built using three types of languages used for constructing web pages, namely: (a) a visual presentation language; (2) a data modeling language; and (3) a scripting language for embedding logic. The software system preferably comprises a web application manager, an operating system interface module, a scripting language interpreter, and optionally a web browser and/or a data modeling language processor. Various other features such as data caching and security filtering are provided in accordance with such a system.