Abstract: A computerized method that combines identifying conflicting requirements and monitoring requirements integrity. Traceability link strengths are computed between a code element and a plurality of requirements. Revised traceability link strengths are computed between a revised version of the same code element and the plurality of requirements. The revised traceability link strengths are compared to the pre-existing traceability link strengths and a deviation decreased is identified when the revised traceability link strength is less than the pre-existing traceability link strength. An additional traceability link strength is computed between the revised version of the same code element and a new requirement, the new requirement first appearing with the revised version of the same code element. A conflict between the new requirement and the pre-existing requirements is identified when both a deviation decrease is identified and when additional traceability link strength exceeds a correlation threshold.

Abstract: A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code and comprising nodes connected by edges, some of the nodes being decision nodes associated with decisions and some of the nodes being action nodes associated with actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action in relation to grouped logic paths associated with the specified benefit action.

Abstract: A method that includes: running a set of functional tests over a computer code; determining, for each code element of the computer code, which functional test covered it, to yield a tests-elements coverage map; associating portions of the computer code with corresponding design portions or requirements derived from a design document or a requirements document respectively, associated with the computer code, to yield a design/requirements-code tracing map; deriving, from the tests-code coverage map and the design/requirements-code tracing map, a design/requirements-tests coverage map, exhibiting coverage of the computer code by the functional tests, in terms of the design or the requirements, wherein at least one of the running, the determining, the associating, and the deriving is executed by at least one processor.

Abstract: A method that may include: building a dependencies graph representing dependencies between code elements of a computer code; associating portions of the computer code with corresponding design specifications or requirements derived from a design specifications document or a requirements document respectively which is associated with the computer code, to yield a design specifications or requirements-code tracing map; and analyzing the design specifications or requirements-code tracing map based on the dependencies graph to yield an ordered list of design specifications or requirements respectively, wherein the order is selected such that functional tests written for the computer code and addressing design specifications or requirements of a higher order, will yield a higher level of functional test coverage of the computer code in terms of design specifications or requirements.

Abstract: A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benef

Abstract: Systems and methods for presenting benefit rules in a policy into a human readable table are provided. The method comprises analyzing logic code implemented for processing claims under a policy to identify one or more rules and one or more parameters of interest; translating the rules, as applicable to the parameters of interest, into an ordered list of boolean expressions; applying an algorithm to the ordered list of boolean expressions to identify a solution for a set of query parameters defined by the rules and the parameters of interest; and generating a summary table according to the identified solution for the set of query parameters.

Abstract: A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benef

Abstract: A method for monitoring requirements integrity. The method comprises receiving a plurality of requirements for an application development project having a plurality of code elements, computing a first strength for each of a plurality of traceability links each between a certain code element in a current software code version of the application development project and one of the plurality of requirements, computing a second strength for each of said plurality of traceability links in a new software code which includes a revision to the certain code element from said current software version, and generating an inconsistency notification based on a deviation between said second strength and said first strength.

Abstract: A method that may include: building a dependencies graph representing dependencies between code elements of a computer code; associating portions of the computer code with corresponding design specifications or requirements derived from a design specifications document or a requirements document respectively which is associated with the computer code, to yield a design specifications or requirements-code tracing map; and analyzing the design specifications or requirements-code tracing map based on the dependencies graph to yield an ordered list of design specifications or requirements respectively, wherein the order is selected such that functional tests written for the computer code and addressing design specifications or requirements of a higher order, will yield a higher level of functional test coverage of the computer code in terms of design specifications or requirements.

Abstract: A method that includes: running a set of functional tests over a computer code; determining, for each code element of the computer code, which functional test covered it, to yield a tests-elements coverage map; associating portions of the computer code with corresponding design portions or requirements derived from a design document or a requirements document respectively, associated with the computer code, to yield a design/requirements-code tracing map; deriving, from the tests-code coverage map and the design/requirements-code tracing map, a design/requirements-tests coverage map, exhibiting coverage of the computer code by the functional tests, in terms of the design or the requirements, wherein at least one of the running, the determining, the associating, and the deriving is executed by at least one processor.

Abstract: A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benef

Abstract: A method for identifying computational services performed by one or more computing resources is provided. The method comprises analyzing digital data associated with the computing resources to identify similarities between the digital data; grouping sets of digital data into one or more clusters according to similarities identified between the digital data; and generating a description for the one or more clusters to describe at least one computational service associated with a set of digital data grouped in the one or more clusters.