Abstract: A method, apparatus and product for real-time update of a Mobile Workforce Scheduling Problem (MWSP), which comprises: agents and tasks to be performed by the agents, wherein a schedule which solves the mobile workforce scheduling problem exists and is being implemented by the agents. The method comprising: monitoring real time information update events provided to a Business Rule Management System (BRMS), activating, by the BRMS, business rules for schedule change detection; in response to a determination that re-planning is desired, automatically determining, using business rules, a portion of the MWSP to be re-planned; providing the portion of the MWSP to a MWSP solver; receiving from the MWSP solver, a new schedule for the portion of the MWSP; and updating the schedule based on the new schedule, whereby a first portion of the schedule is updated and a second portion of the schedule remains unchanged.

Abstract: An example system includes a processor to receive temperature data from a plurality of sensors disposed at locations more sensitive to temperature change in a plurality of server racks. The processor is to also generate a statistical model comprising a continuous spatial statistical distribution of temperature values based on the temperature data. The processor is to further generate a pseudo heat map based on the statistical model.

Abstract: A computerized method of identifying additional influential variables in multi-aspect adjudication frameworks comprising: acquiring an appraisal table having a set of variables affecting at least one adjudication aspect of a multi-aspect adjudication framework; identifying a set of additional variables affecting at least one adjudication aspect of a multi-aspect adjudication framework which fulfills an objective function, said objective function having a plurality of rules, said objective function assessing the compliance of at least one of said appraisal table and said set of additional variables with said plurality of rules; and outputting said set of additional variables.

Abstract: A computer-implemented method, a computerized apparatus and a computer program product, the method comprising: receiving a program to be executed on a mobile device; building a data structure representing states within the program and transitions between the states; and based on the data structure, determining by a processor a location of at least one command related to using data retrieved from a server, such that at least one fetching command is to be provided for the data to be available when execution reaches the location.

Abstract: A method for executing an event processing application in a multi-platform environment which includes a first computing platform and a second computing platform. The event processing application comprises a network of a plurality of processing rules, each of which, when executed by a computing platform, is configured to process incoming events and output outgoing events. The method comprises automatically identifying one or more processing rules comprised by the event processing application that are restricted to be executed in the first computing platform. The automatic identification comprises analyzing each rule in the plurality of processing rules to determine whether the rule is configured to perform a restricted activity. The method further comprises executing the plurality of processing rules in the multi-platform environment, some of which are executed in the first computing platform and some are executed in the second computing platform.

Abstract: A computer-implemented method, computerized apparatus and computer program product for efficient solution of nearest object problems. A set of objects having non-point shapes representable by one or more geometric elements are obtained. For each object in the set the one or more geometric elements are sampled to obtain a set of points representing the set of objects. A Voronoi diagram is constructed for the set of points, whereby a subdivision of a space accommodating the set of objects into a plurality of cells, each cell containing a single point of the set of points and defining a region of closest neighbors of the point, is obtained. Cells containing points representing the same object are aggregated into a unified cell defining an estimated region of closest neighbors of the object.

Abstract: Visual construction of spatial or spatio-temporal relationships is disclosed. A method according to the disclosed subject matter may comprise receiving a visual representation of rule, the visual representation comprising two or more objects. A spatial relationship appearing in the visual representation may be analyzed and multiple alternative textual representations for the spatial relationship may be determined. A user selection between the multiple alternative textual representations of the spatial relationship may be received, whereby obtaining a selected verbalization of the relationship. A verbalization of the rule, which comprises the verbalization of the relationship, may be generated.

Abstract: According to an aspect of some embodiments of the present invention there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

Abstract: According to an aspect of some embodiments of the present invention there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

Abstract: According to one embodiment, a method for solving a plurality of spatiotemporal planning problems. The method may include creating a domain model. The method may also include assigning a solution bound associated with the created domain model to infinity. The method may further include calculating a solution to the created domain model based on the assigned solution bound using at least one of a best-first search algorithm. The method may also include updating the assigned solution bound based on the calculated solution. The method may further include presenting the calculated solution to a user based on the updated solution bound not equaling infinity.

Abstract: A computer-implemented method, a computerized apparatus and a computer program product, the method comprising: receiving a program to be executed on a mobile device; building a data structure representing states within the program and transitions between the states; and based on the data structure, determining by a processor a location of at least one command related to using data retrieved from a server, such that at least one fetching command is to be provided for the data to be available when execution reaches the location.

Abstract: A computer implemented method for automatically fixing a security vulnerability in a source code is disclosed. The method includes obtaining identification of code that sends tainted data to corresponding sink code in the source code; and automatically fixing the vulnerability by automatically performing code modification which is selected from the group of code modifications consisting of: code motion and code duplication.

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: According to an aspect of some embodiments of the present invention there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

Abstract: According to an aspect of some embodiments of the present invention there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

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: Machines, systems and methods for distinguishing feasible paths in a program by statically tracking one or more execution paths are provided. The method comprises reading one or more program statements in an execution path; adding a location identification for the program statement read to an abstract representation of the execution stack at the time the program statement is executed, in response to determining that the program statement is a procedure call; updating the abstract representations of the execution stack to exclude infeasible execution paths for a possible point in program where the procedure could return or continue, in response to determining that the program statement is a return from a procedure.

Abstract: A method for generating a slice from a plan-based representation of a program is provided. The method comprises constructing a plan representation of a program, wherein the plan representation comprises a plurality of nodes, edges, and ports; and receiving one or more slicing criteria from a user. The slicing criteria comprise one or more variable occurrences or statements from the program, according to which a slice is generated from the plan representation.

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.