Abstract: A system and methods for versioning software components in connection with a computer programming language are provided. In exemplary aspects, the versioning system makes use of intelligent defaults, provides a vehicle for unambiguous specification of developer intent and implements conflict resolution rules in connection with the versioning of software components. In another aspect, the versioning system bounds names at run-time, but does not bound offsets at compile-time.

Abstract: An automated software class specification validation tool automatically determines, for functions defined in a function definition section of a class specification, whether the function is properly declared throughout one or more other sections of the same class specification. Further, it can be determined whether variables, i.e., attributes, parameters, and local variables, associated with respective functions in the function definition section are properly specified throughout one or more other sections of the same class specification. The functions and variables that are validated include attributes and functions that are specified for structures and nested classes defined in a defined type section of the class specification. The validation tool is accessible over a network via a web page, and results of the validation process are also displayed on a web page.

Abstract: A method, system and computer program product are provided for creating software that can be used when processing insurance claims. In particular, the software generated is capable of recognizing and flagging certain situations or sets of conditions when they arise in an insurance claim that is being processed. These situations or sets of conditions, as well as the type of flag, or “edit,” that should be posted when each occurs, are defined in a decision table from which the software is automatically generated. A method of processing an insurance claim using the automatically generated software is also provided.

Abstract: One embodiment is directed to a method that may be practiced in a declarative application with composites organized hierarchically, including composites in the same hierarchy, but not directly related by direct intervening child/parent relationships. The method includes acts for providing a link between composites unrelated by direct intervening child/parent relationships. The method includes rendering data at a user interface. The data is associated with a first composite in a declarative application. The method further includes detecting, at the user interface, user interaction with the rendered data. As a result of detecting user interaction with the rendered data, the method further includes defining a composite path to the first composite. The method further includes providing the name of the path as a local variable to a second composite such that the second composite can interact with the data.

Abstract: A system for diagnosing and testing computers includes a graphical user interface tier, an invoking logic tier, and a test logic tier. The graphical user interface tier offers users a graphical user interface to show the progress and results of testing hardware components and generating diagnosis configuration files in accordance with a selected computer hardware component as needed; the invoking logic tier invokes the test logic tier in accordance with the diagnosis configuration files; and the test logic tier includes a test items module, the test items module includes a plurality of sub-modules which run to test different computer hardware components after invoked by the invoking logic tier.

Abstract: A method and system for model-driven transformation are provided. The method and system in one aspect allows selecting of one or more model elements in a model. Transformation definitions are evaluated to identify one or more transformations that may be applicable to the selected one or more model elements. In one aspect, transformations may be identified that are applicable in an entire model, those that take the selected one or more model elements as input parameters, those that affect one or more model element, or any combination thereof. In one aspect, a list of applicable transformations is presented. In another aspect, the method and system automatically apply the one or more applicable transformations to the model.

Abstract: Rules are provided to address the interplay of annotations and inheritance in the JAVA programming language. Class-level annotations affect the class they annotate and members of the class they annotate. Class-level annotations do not affect a class member declared by a superclass. If a class member carries a specific member-level annotation, an annotation of the same type implied by a class-level annotation is ignored. An interface implemented by a class does not contribute annotations to the implementing class or members of the implementing class. Class members inherited from a superclass, that are neither hidden nor overridden, maintain the annotations they had in the class that declared them. Member-level annotations on class members inherited from a superclass, that are either hidden or overridden, are ignored. Interface-level annotations affect the interface they annotate and all members of the interface they annotate, including inherited members.

Abstract: A method and system for instructing a computer in a system of a declarative computer programming language. Unlike traditional declarative languages, the programming language may be neither relational nor functional, neither procedural nor imperative. The declarative elements may be defined as a meta-description of logic and data. The basic morphology of this meta-description may be a data construct known as a Lattice. Lattices derive declarative power from their inclusion of “Attributes” and “Sites”. Attributes are declarative properties that determine the internal behavior of a Lattice; while Sites are declarative data access points that establish the external relationship a Lattice may have with other Lattices, Lattice Containers, and Lattice Elements. Each of these data constructs are highly adaptable, recursive, and expandable, providing the entire language with a degree of flexibility that facilitates a very high level of abstraction.

Abstract: A system, method and user interface facilitating hierarchical (e.g., tree-based) rule composition with natural language inline editing. For example, the system can combine a familiar hierarchical structure, such as a computer tree, and inline editing of natural language based logical expression(s) to provide a general purpose logical expression builder. In one example, the system facilitates construction and/or editing of business rule(s) based, at least in part, upon parameterized format string definition(s) and composable vocabulary definition(s). The system includes a rule composer and a display component. The rule composer facilitates creation, modification and/or viewing of a rule, for example, based upon a user input. The display component displays hierarchical information associated with the rule.

Abstract: The present subject mater relates to configuration of software applications and, more particularly, a configuration transformation layer. The various embodiments described herein provide systems, methods, and software to instantiate a multilayer application, wherein each application layer includes configuration settings and executing a transformation engine to transform configuration settings between application layers as a function of one or more transformation schemas.

Abstract: The auditing of authorization decisions is facilitated by integrating or coupling an audit policy to access control decisions. In an example implementation, an audit policy of an auditing scheme is coupled to a semantic framework of an access control scheme such that the audit policy is specified using at least a portion of the semantic framework. In another example implementation, audit policy rules include audit content rules that specify what audit information from any of the inputs, the outputs, or the internal data of authorization decisions is to be included in an audit record. In yet another example implementation, a semantic of an audit trigger rule comports with a semantic framework of an access request and of a logical evaluation for an authorization decision.

Abstract: A system and method that allows developers to debug a component while it is restricted by any arbitrary set of specific permissions, or restricted by an existing permission set associated with a security “zone.” A security sandbox is mimicked within the development environment so that developers can study how applications perform inside the sandbox. Developers are able create any sandbox and debug inside it, where violating any bound of the artificial sandbox will throw a security exception and drop the user out on the exact line of code which generated the error, as well as provide helpful information about how to correct the error.

Abstract: Systems, methods, and computer program products are provided for adapting service entities using a declarative approach in a service framework. In accordance with one implementation, a method is provided for adapting service entities. The method includes the steps of retrieving at least one software entity from a first repository in response to a first input and receiving a declaration from a user for adapting the software entity. The method further includes the steps of adapting the software entity to an adapted software entity based on the declaration and storing the adapted software entity in a second repository.

Abstract: An embodiment of the present invention is a technique for translating a business rule. An operation for a rule to authorize a provision of information is created. A current container is established. A propositional expression in the rule describing the provision of the information is processed. If the current container is null, a context for the propositional expression is recorded as null, else an object type in the current container is recorded as a resulting context from the propositional expression.

Abstract: Described herein is an implementation of a technology for the construction, identification, and/or optimization of operating-system processes. At least one implementation, described herein, constructs an operating-system process having the contents as defined by a process manifest. Once constructed, the operating-system process is unalterable.

Abstract: A system and methods are provided that make compile-time declarative modeling available for SOAP-based data transmission(s). The declarative modeling minimizes the amount of coding required of a developer. The underlying details regarding the SOAP protocol, dispatching to the appropriate object and function, marshaling and un-marshaling of XML and generating the SOAP response are hidden from the developer when implementing SOAP-based Web services. The task of creating a SOAP-based web service is thus greatly simplified by reducing the number and complexity of considerations required of the developer when generating SOAP-based Web services. In one embodiment, attributes for Visual C++ are utilized as a framework for a declarative syntax for SOAP-based Web services, which Visual C++ attributes have access to type and marshaling information.

Abstract: A template creator creates a template class that stores at least one template parameter. The template creator also specifies at least one additional object to be created when an instance of the template class is created. A template user initiates the creation of a new instance of the template class. If an error occurs during the creation of the new instance of the template class, the template user receives a report identifying the error.

Abstract: In one embodiment, a method is provided for use in a system in which a user may edit an artifact and a diagram representing the artifact. The method includes acts of temporarily removing, in response to a request by the user, an artifact portion which corresponds to a diagram element on a diagram (e.g., a class diagram); removing the diagram element from the diagram; replacing, in response to a request by the user, the artifact portion in the artifact; and replacing the diagram element in the diagram, wherein the diagram element retains at least a portion of customization performed by the user previous to its removal from the diagram.

Abstract: The invention relates to a computer-implemented method, computer program, computer program product, data structure, and computer for providing automated process flow in product development. A structured data object may be defined comprising at least one recipe and at least one defined formula. Trial stages within said product development are also defined as are object types within said data object referring to said trial stages. An instance of said data object is instantiated from said data object definition. A type of said instance is specified from one of said object types. A user may then be provided said recipe and/or said formula according to the specified type.

Abstract: Systems, methods and apparatus are provided through which in some embodiments, domain knowledge is translated into a knowledge-based system. In some embodiments, a formal specification is derived from rules of a knowledge-based system, the formal specification is analyzed, and flaws in the formal specification are used to identify and correct errors in the domain knowledge, from which a knowledge-based system is translated.

Abstract: Namespace for continuation-based runtime. Some embodiments described herein are directed to a framework using continuation based runtime namespaces that pertain to an infrastructure for enabling the creation of a wide variety of continuation-based programs that perform a wide-array of tasks. The infrastructure provides a foundation for building continuation-based, declarative applications of various scale and complexity. In some embodiments, the associated application programming interfaces (APIs) are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility, and versionability.

Abstract: A computer implemented method, data processing system, and computer program product for nominating rules or policies for promotion through a policy hierarchy. An administrator at any level in a policy hierarchy may create a rule or policy. The administrator may then nominate the rule or policy for inclusion in a next higher level in the policy hierarchy. The rule or policy is evaluated at the next higher level. Responsive to an approval of the next higher level to include the rule or policy in the jurisdiction of the next higher level, the rule of policy is provided to all users under the jurisdiction. The nominating, evaluating, and providing steps may then be repeated for each higher level in the policy hierarchy.

Abstract: Various technologies and techniques are disclosed for creating and executing extensible processes across multiple application components. A declarative feature is provided to allow partially ordered steps in an extensible process spanning multiple application components to be defined in a declarative format. A developer can define the minimum base steps in a first application component. Other application components can then provide additional partially ordered steps and/or actions to the extensible process. The declarative feature allows the partially ordered steps to have an associated step action. A sequencer is provided that assembles the partially ordered steps together from the multiple application components into a computational sequence having a total ordering. The sequencer executes the computational sequence in that total ordering upon receiving an execution request.

Abstract: A system and method for declarative network access control are provided. The system includes an interpreter, a rules engine, a storage device, and a processor. The interpreter transforms sentences in a declarative network access control language to rules. The rules engine evaluates the rules to produce actions for providing access control to a network at a point of access. The storage device stores instructions for the interpreter, the rules and the rules engine and the processor executes those instructions.

Abstract: Systems, methods and apparatus are provided through which in some embodiments an informal specification is translated without human intervention into a formal specification. In some embodiments the formal specification is a process-based specification. In some embodiments, the formal specification is translated into a high-level computer programming language which is further compiled into a set of executable computer instructions.

Abstract: A developer can express the logic offered by a Web service, or other network accessible service, using a standard programming language augmented with declarative annotations specifying preferences for exposing that logic as a Web service. At compile time, an enhanced compiler can analyze the annotated source file and automatically generate the mechanisms required to expose its functionality as a Web service or network accessible service.

Abstract: A data set may be managed by a host that provides access to clients through a protocol, such as a RESTful HTTP interface. A resource script may be expressed according to a script language featuring two types of instructions: data set instructions that correspond to the verbs of the protocol, and flow control instructions that alter the flow of execution of the resource script. At runtime, an execution context for the resource script may be selected as a local execution context (through a local script processor that issues protocol verbs to the host based on the data set operations) or a remote execution context (by sending the resource script to a script processor located on the host.) The runtime selection of data context may be executed without having to reconfigure the resource script, and with an equivalent effect on the data set.

Abstract: The present disclosure provides a system and method for allocating bandwidth in remote equipment on a passive optical network (PON), wherein the system includes an optical line terminal (OLT), which monitors the acceptance of traffic requesting the PON remote equipment for service and configures through signaling control the parameters for the operation of classifying, shaping, and scheduling the traffic in the remote equipment, and a remote equipment which classifies, shapes, and schedules the accepted traffic based on the parameters configured by the OLT and allocates a proper bandwidth to the accepted traffic, and outputs the traffic in the scheduled order. The present disclosure helps ensure the bandwidth and delay requirements of individual traffic flows in the PON remote equipment are met and interaction between traffic of the same or different service class groups is eliminated.

Abstract: A method and system for mapping between constructs in a domain modeling language and a relational storage language is provided. A source code authored in a source language is received and a set of constructs in the source code are identified. The set of constructs in the source code are mapped to a set of constructs in a target language. The source code is then compiled into a target code authored in the target language such that one of the source code or target code include a declarative constraint-based and/or order-independent execution model.

Abstract: A representation of types, type-checker, method and compiler are provided for checking consistency in various forms of an intermediate language. Specifically, the typed intermediate language is suitable for use in representing programs written in multiple (heterogeneous) source languages including typed and untyped languages, loosely and strongly typed languages, and languages with and without garbage collection. An unknown type representation indicates that an element of the intermediate language is associated with an unknown type. A method of type-checking a code segment written in a programming language is provided using a rule set that contains rules for type-checking an unknown type. The unknown type allows for selectively retaining type information as the compilation process continues and allows multiple programming languages to be type-checked by the same type system.

Abstract: A method, system, and computer program product for providing an application include representing a plurality of hierarchical rules as a plurality of objects in a prototype pointer chain, and providing a function to search the rules for a desired style by traversing the prototype pointer chain. An exemplary method provides a user interface or application with one or more visual objects. The visual appearances of the visual objects is affected by style information retrieved by traversing a prototype pointer chain to search for style-related rules. A compiled file can include code that describes rules as objects and creates class inheritance relationships between those objects and code that describes a style-finding function. A displaying program instantiates the objects arranged in a prototype pointer chain and uses its own inheritance logic to traverse the chain according to the style-finding function.

Abstract: A system and method for modifying the output of a computer program without source code modification. A computer program reads in two files, an input data file and a recipe text file. The data input file contains name/value pairs to be rendered to an output device and the recipe text file contains the formatting descriptions. The name/value pairs of the data input file need not be arranged according to a required structure. During the execution of the program, the formatting descriptions of the recipe text file are converted into a sequence of executable objects and the name/value pairs from the data input file are rendered in a format according to these formatting descriptions. A coordinated alteration of the input text file and the recipe text file will result in a modification to the output format.

Abstract: The present invention relates to systems and methods for defining, implementing, deploying and/or executing Web services. A Web service is defined using a graphical interface that allows the application developer to specify the operation of the Web service through inclusion and configuration of graphical nodes representing particular operations and/or functions. The environment for definition typically includes a user input device, a graphical display device, a system data store and a system processor. The system processor is in communication with the other elements. A graphical definition of the Web service is stored in the system data store. Once defined, the graphical definition is convened into a programmatic implementation executable by a Web services server. This programmatic implementation can then be transmitted to an appropriate Web services server accessible by an intended user community.

Abstract: A template creator creates a template class that stores at least one template parameter. The template creator also specifies at least one additional object to be created when an instance of the template class is created. A template user initiates the creation of a new instance of the template class. If an error occurs during the creation of the new instance of the template class, the template user receives a report identifying the error.

Abstract: There are methods and apparatus, including computer program products, for a flexible generation framework. The generation framework encapsulates a variety of different code generation technologies within a common interface. This allows various types of generator cores operating in various development environments to be integrated into the framework, and enables the generation of code using various generating technologies.

Abstract: Under the present invention, when a request for a certificate is made, a set of (mapping) rules are used to identify an appropriate directory and any other information sources, and to retrieve information for the certificate therefrom. The directory name is then transformed using the set of rules for use in the certificate. Thereafter, a template for the certificate is developed using the set of rules. The template and the request are then communicated to the PKI, which will generate and return the certificate. Upon receipt, the present invention can verify that the certificate actually includes the transformed name.

Abstract: A mobile care engine system is provided for delivering customer care to mobile devices, comprising. The mobile care engine system compares profile data from a mobile device with reference data and highlights any inconsistencies between the data, so that the device can be optimized. The inconsistencies are preferably determined using rule-based processing, and are automatically highlighted on the device display itself, or on a display of a customer service representative interface. Optionally, the system allows for corrective patches or settings to be sent to the device.

Abstract: Representing a componentized workflow model via a declarative markup language. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities.

Abstract: A rules-based software architecture that provides the infrastructure for the definition and execution of end-user rules logic. This enables end-user automation of data in a unified storage platform using simple IF-THEN rules. The architecture includes a monitoring component that tracks items associated with the data, and a rules component interfaces to the rules component, and employs metadata associated with the tracked items to provide for automated handling of a subset of the items. The system further provides for defining virtual collections and items in the system using content based logic. The system further comprises one or more trigger components that sets items and collections of items dynamically active as a function of trigger logic. Additional components can include a constraint component for imposing constraint logic on items, and a decision component that supports enabling application customization logic at decision points.

Abstract: The reuse of one or more shared components of graphical modeling tools amongst multiple graphical modeling tools. Graphical designers, or graphical modeling tools, allow for the construction of graphical representations of models in which objects, object properties, and object interrelationships may be visualized. Thus, a variety of graphical modeling tools may be supported and populated with portions of other graphical modeling tools.

Abstract: Techniques are disclosed to support the resolution of an operator which has been called with inconsistent typing and at least one operand of a user-defined type. In order to allow the compilation of such an operation, first all possible widening conversions for each operand are examined to determine if any widening conversions of any operands would result in types over which the operator is defined. If not, both the narrowing and the widening conversions of each operand are considered, to determine if any conversions of either or both operands would result in types for which the operator is defined. If only widening conversions are used, the most encompassed possible result type is selected as the target type. If a narrowing conversion is used, the most encompassing possible result type is selected as the target type. In order to use the target type, each operand is converted to the target type. The operation is then performed using the converted operands.

Abstract: Existing methods for returning program state to a previous state are often too heavy weight. Often these methods attempt to guarantee a series of properties to a programmer across a distributed environment or multiple threads. Instead, a program state reversion mechanism provides a light weight and efficient runtime solution for general purpose programming languages. For example, a series of program statements (e.g., methods, instructions, etc.) are indicated by a programmer in a state reversion language construct, such as a TryAll block. If an exception is thrown anywhere from within the TryAll block, the program is reverted to the pre-TryAll block state.

Abstract: Techniques for using a declarative programming language to automatically generate imperative language computer programs (such as the get, set, enable, and disable commands of the Windows® PowerShell scripting language) that perform administrative tasks of computing environments. A code generator 150 is operative to process a declarative language document, which includes at least three hierarchically-related data structures. The first data structure references certain administrative commands; the second data structure references parameters accepted by the commands; and the third data structure provides pointers to configuration data associated with the parameters. The document is processed in accordance with a set of rules to produce imperative-language execution routines that call sub-routines and pass variables thereto, which enables differences between parameters and configuration data to be mitigated through mapping.

Abstract: A method and system provides one or more product type descriptions, and constructs a map between the sub-conditions of the product type descriptions and constructs in a Web Ontological Language (OWL). The method converts the product type description rules into new OWL classes by creating a new OWL class for each corresponding rule; adding the new OWL class to the OWL ontology; for each condition of the corresponding rule, extracting sub-conditions; for each the sub-condition extracted; creating new constructs for the new OWL class using the map; and adding new class restrictions to the new OWL class, wherein each of the new class restrictions relates to a corresponding condition of the corresponding rule.

Abstract: This invention relates to a business application development and execution environment that recognizes and supports various development and user roles. Aspects of the method and system are adapted to builders, assemblers, power users and end users.

Abstract: Predicate abstraction techniques and tools. Using symbolic decision procedures, predicate abstractions for computer programs are generated based on a set of predicates representing observations of expected behavior of the program. The set of predicates may be generated by an automatic program analysis tool or may be provided a user based on the user's observations. The predicate abstraction process may employ binary decision diagrams. Two or more symbolic decision procedures (e.g., for different kinds of program logic) can be combined to form a combined symbolic decision procedure to be used for predicate abstraction. A data structure can be used to track derived predicates during predicate abstraction.

Abstract: A special syntax is developed to differentiate between accesses to a primary and one or more secondary object protocols in a programming language. The syntax allows the compiler to differentiate between the primary and secondary object model based on syntax, rather than type. The syntax is created in such a way as to approximate the syntax of the secondary object model, and allows the user to dynamically generate member names.

Abstract: Declaratively implementing a command. A method includes declaring an input gesture in a declarative programming language. Declaring an input gesture includes declaring one or more user performed actions. A command name is declared in a declarative programming language. A workflow is declared in a declarative programming language. Declaring a workflow includes declaring schedulable activities that are to be performed without specific specifications of the low level algorithms that are used to accomplish the activities. In an alternative example, workflows may be declared by declaring a wrapper to wrap imperative programming commands. The declared input gestures are bound with the declared workflow through the declared command name.

Abstract: Methods and apparatus, including computer program products, for inference processing in a fact-based business automation system, including receiving a rule set as a single package, generating a dependency graph for the rule set, and generating a sequence of processing logic for optimal processing of inputted facts.

Abstract: Methods and apparatus, including computer program products, that include providing to a client a definition of an object class representing attributes of a first collection of data elements and a list of possible operations on the first collection, each data element having attributes and possible operations in common with other data elements from the first collection. The method also includes customizing a usage policy of the first collection for a configuration of the client, receiving from the client a first request to execute an operation from the list on one or more data elements from the first collection, checking the first request against the definition and the usage policy, and executing the operation on the one or more data elements of the first collection.