Abstract: A computer-implemented method for retrieving information from information services and providing it to a public application programming interface (API) includes receiving a first request data message using a core discovery agent, the request data message including at least one requested datum, for which a value is sought, and at least one known datum, for which a value is known; calling a resource locator to request a location of an information service that provides a value for the requested datum; calling a resource façade to contact the information service; transmitting a first information service message including the requested datum and known datum from the resource façade to the information service; receiving a second information service message from the information service including a value for the requested datum; and transmitting a resolved data message including the requested datum and its value from the core discovery agent to the public API.

Abstract: A computer-implemented method for retrieving information from information services and providing it to a public application programming interface (API) includes receiving a first request data message using a core discovery agent, the request data message including at least one requested datum, for which a value is sought, and at least one known datum, for which a value is known; calling a resource locator to request a location of an information service that provides a value for the requested datum; calling a resource façade to contact the information service; transmitting a first information service message including the requested datum and known datum from the resource façade to the information service; receiving a second information service message from the information service including a value for the requested datum; and transmitting a resolved data message including the requested datum and its value from the core discovery agent to the public API.

Abstract: A new design strategy based upon finite state machine models is used to develop a policy administration system. The policy administration system comprises a plurality of finite state machined-based households, each of which is defined by a set of states represented by data that describe or relate to various policies associated with each household, a set of events represented by transactions that operate on the data, and/or a set of transition functions represented by transaction logics and/or product rules that govern how the transactions are processed. In this manner, each finite state machine-based household becomes a type of self-contained policy administration system that may be executed and managed concurrently. Each policy may be an insurance policy, such as an auto, home, life, renters, personal articles, or health insurance policy. Each finite state machine-based or virtual household may facilitate managing, updating, or generating insurance policies for the household and/or household members.

Abstract: A code scanning system has a syntax generation component that receives source code and generates an abstract syntax tree file. The system includes a white list of permitted pure functions, and a black list of prohibited impure functions. In addition, the system includes a static code analyzer for performing static analysis of the source code. The static code analyzer includes a function analyzer that receives the AST file and identifies the functions. Each function is compared to the white list, and if it is present, marked as permitted in a static analysis file. If the function is not on the white list, it is compared to the black list. If it is present on the black list, it is marked as prohibited in the static analysis file. If the function is not on the white or black list, it is marked as “unknown” and subjected to manual analysis.

Abstract: Methods and systems for performing mainframe batch testing and/or property-based validation testing using a finite-state machine are provided. According to certain aspects, a validation server may receive a set of batch data designed to validate a property under test, such as during mainframe batch testing. A validation server may validate that the set of batch data is in a proper format. The validation server may then cause a finite-state machine to process instructions contained within the set of batch data. Once the finite-state machine processes the set of batch data, the validation server may then validate that the finite-state machine adheres to the property under test. If the validation fails, the validation server may generate an error report describing the failure.

Abstract: A computer-implemented method for retrieving information from information services and providing it to a public application programming interface (API) includes receiving a first request data message using a core discovery agent, the request data message including at least one requested datum, for which a value is sought, and at least one known datum, for which a value is known; calling a resource locator to request a location of an information service that provides a value for the requested datum; calling a resource façade to contact the information service; transmitting a first information service message including the requested datum and known datum from the resource façade to the information service; receiving a second information service message from the information service including a value for the requested datum; and transmitting a resolved data message including the requested datum and its value from the core discovery agent to the public API.

Abstract: A code scanning system has a syntax generation component that receives source code and generates an abstract syntax tree file. The system includes a white list of permitted pure functions, and a black list of prohibited impure functions. In addition, the system includes a static code analyzer for performing static analysis of the source code. The static code analyzer includes a function analyzer that receives the AST file and identifies the functions. Each function is compared to the white list, and if it is present, marked as permitted in a static analysis file. If the function is not on the white list, it is compared to the black list. If it is present on the black list, it is marked as prohibited in the static analysis file. If the function is not on the white or black list, it is marked as “unknown” and subjected to manual analysis.

Abstract: A new design strategy based upon finite state machine models is used to develop a policy administration system. The policy administration system comprises a plurality of finite state machined-based households, each of which is defined by a set of states represented by data that describe or relate to various policies associated with each household, a set of events represented by transactions that operate on the data, and/or a set of transition functions represented by transaction logics and/or product rules that govern how the transactions are processed. In this manner, each finite state machine-based household becomes a type of self-contained policy administration system that may be executed and managed concurrently. Each policy may be an insurance policy, such as an auto, home, life, renters, personal articles, or health insurance policy. Each finite state machine-based or virtual household may facilitate managing, updating, or generating insurance policies for the household and/or household members.

Abstract: A computer-implemented method for retrieving information from information services and providing it to a public application programming interface (API) includes receiving a first request data message using a core discovery agent, the request data message including at least one requested datum, for which a value is sought, and at least one known datum, for which a value is known; calling a resource locator to request a location of an information service that provides a value for the requested datum; calling a resource façade to contact the information service; transmitting a first information service message including the requested datum and known datum from the resource façade to the information service; receiving a second information service message from the information service including a value for the requested datum; and transmitting a resolved data message including the requested datum and its value from the core discovery agent to the public API.

Abstract: Methods and systems for performing mainframe batch testing and/or property-based validation testing using a finite-state machine are provided. According to certain aspects, a validation server may receive a set of batch data designed to validate a property under test, such as during mainframe batch testing. A validation server may validate that the set of batch data is in a proper format. The validation server may then cause a finite-state machine to process instructions contained within the set of batch data. Once the finite-state machine processes the set of batch data, the validation server may then validate that the finite-state machine adheres to the property under test. If the validation fails, the validation server may generate an error report describing the failure.

Abstract: Methods and systems for performing mainframe batch testing and/or property-based validation testing using a finite-state machine are provided. According to certain aspects, a validation server may receive a set of batch data designed to validate a property under test, such as during mainframe batch testing. A validation server may validate that the set of batch data is in a proper format. The validation server may then cause a finite-state machine to process instructions contained within the set of batch data. Once the finite-state machine processes the set of batch data, the validation server may then validate that the finite-state machine adheres to the property under test. If the validation fails, the validation server may generate an error report describing the failure.

Abstract: A process and implementing computer system (13) for optimally sizing elements of an integrated circuit includes determining actual arrival times and required arrival times (403) for processed signals at all nodes within the integrated circuit and determining the slack or difference (405) between arrival and required times for each node. If the actual arrival time for a particular node is after the time required to meet a predetermined design constraint of the node (407), a determination (411) is made regarding the effect of that element on the nodal slack for an incremental increase in the size of that element. Thereafter an element is selected (413) for sizing increase (415) in accordance with a weighting function and the process is repeated until all of the nodes in the integrated circuit have positive slack times (407, 409).

Abstract: A process and implementing computer system (13) for optimally sizing elements of an integrated circuit includes determining actual arrival times and required arrival times (403) for processed signals at all nodes within the integrated circuit and determining the slack or difference (405) between arrival and required times for each node. If the actual arrival time for a particular node is after the time required to meet a predetermined design constraint of the node (407), a determination (411) is made regarding the effect of that element on the nodal slack for an incremental increase in the size of that element. Thereafter an element is selected (413) for sizing increase (415) in accordance with a weighting function and the process is repeated until all of the nodes in the integrated circuit have positive slack times (407, 409).

Abstract: A process and implementing computer system (13) for optimally sizing elements of an integrated circuit includes determining actual arrival times and required arrival times (403) for processed signals at all nodes within the integrated circuit and determining the slack or difference (405) between arrival and required times for each node. If the actual arrival time for a particular node is after the time required to meet a predetermined design constraint of the node (407), a determination (411) is made regarding the effect of that element on the nodal slack for an incremental increase in the size of that element. Thereafter an element is selected (413) for sizing increase (415) in accordance with a weighting function and the process is repeated until all of the nodes in the integrated circuit have positive slack times (407,409).

Abstract: A method for designing an integrated circuit involves a four step process. First, a behavioral circuit model (BCM) is read which contains assignment statements which identify the logical operation of an integrated circuit (IC). The BCM is translated to a data file which described a plurality of interconnected logic gate functions to duplicate the operation of the BCM. The gates in the data file are then assigned a specific Vdd and ground rail size, a specific drive strength for speed considerations, and a cell pitch or height to optimize physical layout, in any order. The result in a physical design file which may be used to form masks and integrated circuits having optimized speed and optimized circuit area in a short design cycle.

Abstract: An integrated circuit, when designed, must adhere to timing constraints while attempting to minimize circuit area. In order to adhere to timing specifications while arriving at a near-optimal circuit surface area, an iterative process is used which selectively increases logic gates sizes by accessing logic gates from a memory stored logic gate library. A circuit representation is read along with timing constraints for circuit paths. Each circuit path in the circuit is processed to find it's actual circuit path delay. A most out-of-specification circuit path (in terms of speed) is chosen in the circuit and a sensitivity calculation is performed for each logic gate in the most out-of-specification circuit path. The logic gate in the circuit path with the maximized sensitivity (sensitivity=.DELTA.speed/.DELTA.area) is increased in size by accessing a larger gate in the library in order to improve speed at the expense of area.