Patent application number | Description | Published |
20110041123 | FINE SLICING: GENERATING AN EXECUTABLE BOUNDED SLICE FOR PROGRAM - A method for generating a fine slice for a program is provided. The method comprises receiving a set of slicing criteria, wherein the set of slicing criteria comprises one or more variable occurrences or control dependences; receiving a set of cut points, wherein the set of cut points comprises one or more variable occurrences or control dependences; and generating a slice according to the set of slicing criteria and the set of cut points. The generated slice includes statements related to computation of values for the set of slicing criteria and excludes statements related to computation of values for the set of cut points. Missing information is added to the slice so that the slice is executable. | 02-17-2011 |
20110055803 | PLAN-BASED PROGRAM SLICING - 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. | 03-03-2011 |
20120227029 | METHOD FOR CODE TRANSFORMATION SUPPORTING TEMPORAL ABSTRACTION OF PARAMETERS - A method of code transformation supporting temporal abstraction of parameters is provided herein. The method includes the following stages: extracting a set of statements from an original code and further creating a residual code being the original code without the statements, wherein two or more of the extracted statements are not on a same loop in the original code; adding conditions from the original code to the extracted set of statements, such that the added conditions are sufficient to render the set of statements executable; adding statements from the original code to the residual code, such that the added statements are sufficient to render the residual code executable; and adding code portions and variables to the set of statements and the residual code, such that a passing of values between the enhanced set of statements and the residual code maintains a respective passing of values in the original code. | 09-06-2012 |
Patent application number | Description | Published |
20130125086 | SOFTWARE ARCHITECTURE BY UNTANGLING UNDESIRED CODE LEVEL DEPENDENCIES USING CODE REFACTORING - A method of improving software architecture by untangling undesired code level dependencies is provided herein. The method includes the following stages: generating an abstract representation of a computer code in a form of a code model; recording manipulations to the computer code applied by a user to the code model; calculating a series of refactorings in the computer code that represents the recorded manipulation; and carrying out the refactorings within the computer code. Specifically, some of the refactorings include separating low level software elements on the method level in response to the user manipulations of the model. | 05-16-2013 |
20130246080 | Generating Policy Summaries From Logic Code - 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. | 09-19-2013 |
20130247015 | PLAN-BASED PROGRAM SLICING - 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. | 09-19-2013 |
20130283248 | METHOD, APPARATUS AND PRODUCT FOR PORTING APPLICATIONS TO EMBEDDED PLATFORMS - A computer-implemented method and apparatus for transforming code to embedded environments, the method comprising: receiving program code not complying with a limitation of an embedded computing environment; transforming at least part of the program code to modified program code in order for the modified program code to be in compliance with the limitation; and storing the modified program code on a storage device. wherein the modified program code complies with the limitation of the embedded computing environment. | 10-24-2013 |
20140189656 | Flow Analysis in Program Execution - 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. | 07-03-2014 |
20140278476 | IDENTIFYING ADDITIONAL VARIABLES FOR APPRAISAL TABLES - 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. | 09-18-2014 |
20140278559 | ADJUDICATION PLATFORM COMPLIANCE MANAGEMENT - A method of verifying compliance of an adjudication platform with a requirement, the method comprising: applying a requirement to an adjudication platform, wherein said adjudication platform comprises a plurality of benefit rules and said requirement comprises a plurality of requirements representing at least one of a law and an insurance policy; identifying at least one of said plurality of benefit rules disagreeing with at least one of said plurality of requirements, responsive to a discrepancy between applied said requirement and said adjudication platform; outputting at least one of identified said plurality of benefit rules and said plurality of requirements. | 09-18-2014 |
20150040105 | SYSTEM AND/OR METHOD FOR COMPUTING INTERPROCEDURAL DOMINATORS - 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. | 02-05-2015 |
20150106303 | FINITE STATE MACHINE FORMING - Techniques for representing a finite state machine forming are described herein. The techniques include a method that identifies screens of a computing program. The method may include correlating the identified screens with states of a finite state machine. Events indicating transition between the identified screens may be determined as well as data flow associated with the events. The method may include forming a graph representing the screens, events, and data flow in the finite state machine. | 04-16-2015 |
20150113501 | MOBILE COMPUTING PROGRAM SLICING - Techniques for computer program slicing are described herein. The techniques include screens of a mobile computing program having a behavior. The method may include determining a subset of screens associated with the behavior. A slice of the mobile computing program may be generated based on the subset of screens of the mobile computing program such that the slice produces the same behavior of the mobile computing program. | 04-23-2015 |
20150121336 | SCREEN-ORIENTED COMPUTING PROGRAM REFACTORING - Techniques for refactoring a screen-oriented computing program are described herein. The techniques include a method that identifies screens of the computing program, and determines a starting point of the computing program based on the identified screens. The techniques include refactoring the computing program based on the starting point and the identified screens. | 04-30-2015 |
20150121349 | SCREEN ORIENTED DATA FLOW ANALYSIS - A method for performing data flow analysis of computer code, comprising: providing computer code of a computer program having a plurality of user interface screens; dividing the computer code to a plurality of portions such that each one of the portions includes code for inducing at least one of loading and using one of the user interface screens; performing a variable usage analysis to detect which variables are at least one of calculated and used in each one of the portions; constructing a data dependence model defining dependencies among the portions based on the variable usage analysis; and identifying, for at least one of the portions and using the data dependence model, at least one unnecessary variable loaded in one of the user interface screens and not used in a respective portion and in a group of portions depending on the respective portion. | 04-30-2015 |
20150248342 | METHOD FOR FINDING ALL VALID INTERPROCEDURAL EXECUTION PATHS ON COBOL IN POLYNOMIAL TIME - Disclosed are methods for finding all valid paths in a COBOL program. These methods are performed in polynomial time, allowing them to be scaled to accommodate large COBOL programs. As the methods find all valid paths in COBOL program code, by traversing and marking the nodes of the program upon being traversed. Accordingly, all usable and reachable code is indicated and marked. This increases safety when working with the code, as removal or alteration of such valid code is indicated, and thus, made unlikely. | 09-03-2015 |
Patent application number | Description | Published |
20120309781 | TETRAHYDRO-beta-CARBOLINE DERIVATIVES, SYNTHESIS AND USE THEREOF - Certain 2-halophenyl, 2,4-dihalophenyl (e.g. 2,4-dichlorophenyl), 3,4-dichlorophenyl (e.g. 3,4-dichlorophenyl), 2,6-dichlorophenyl (2,6-dichlorophenyl) and 2,5-diakoxyphenyl (e.g. 2,5-dimethoxyphenyl) derivatives of tetrahydro-β-carbolines are provided, along with their pharmaceutically acceptable salts; prodrugs and solvates, and compositions containing the compounds. The compounds are useful for the prevention and treatment of cancer, and other indications where PDE5 inhibitors have shown benefits including erectile dysfunction, pulmonary hypertension, enhancing cognitive function, cystic fibrosis, or enhancing the activity of conventional chemotherapeutic drugs. Methods for fabricating the compounds are also provided. | 12-06-2012 |
20140171477 | DERIVATIVES OF CELEBOXIB, USE THEREOF AND PREPARATION THEREOF - Derivatives of celecoxib that lack cyclooxygenase inhibitory activity but have improved PDE5 inhibitory activity are provided along with pharmaceutical compositions containing them for the treatment or prevention of cancer. Such compounds are expected to have reduced toxicity compared with celecoxib and other cyclooxygenase inhibitors, and greater efficacy compared with conventional PDE5 inhibitors. Derivatives of celecoxib are also suitable for treating chronic inflammatory conditions, erectile dysfunction, pulmonary hypertension, congestive heart failure, and enhancement of cognitive function. | 06-19-2014 |
Patent application number | Description | Published |
20120310916 | Query Execution Systems and Methods - System, method and computer program product for processing a query are disclosed. Query processing includes partitioning the stored data into a plurality of partitions based on at least one vertex in the plurality of vertexes, storing at least another triple in the plurality of triples on the at least one node, assigning, based on the triple containing the at least one vertex, at least one partition in the plurality of partitions corresponding to the triple to at least one node in the plurality of nodes, and processing, based on the assigning, the query by processing the plurality of partitions. | 12-06-2012 |
20140108861 | SYSTEMS AND METHODS FOR FAULT TOLERANT, ADAPTIVE EXECUTION OF ARBITRARY QUERIES AT LOW LATENCY - A system and method for performing distributed execution of database queries includes a query server that receives a query to be executed on a database, forms a query plan based on the query, assigns tasks to task slots on a plurality of worker nodes in a cluster, and, upon receipt of a notification that a task has completed on a worker node, immediately assigns an unassigned task to a free task slot on that worker node, such that the task may begin executing on that worker node substantially immediately thereafter. The task slots on worker nodes include pools of resources that run tasks without start-up overhead. | 04-17-2014 |
20150088924 | SCHEMA-LESS ACCESS TO STORED DATA - A system, a method, and a computer program product for accessing stored partially structured data using a structure-based query language. A partially-structured data is stored in a data management system using at least one key-value pair. Using the data management system, a query of data is processed. The query is generated using a structured language. | 03-26-2015 |
Patent application number | Description | Published |
20110302151 | Query Execution Systems and Methods - System, method, and computer program product for processing data are disclosed. The method includes receiving a query for processing of data, wherein the data is stored in a table in a plurality of tables, wherein the table is stored on at least one node within the database system, determining an attribute of the table and another table in the plurality of tables, partitioning one of the table and the another table in the plurality of tables using the determined attribute into a plurality of partitions, and performing a join of at least two partitions of the table and the another table using the determined attribute. The join is performed on a single node in the database system. | 12-08-2011 |
20110302226 | DATA LOADING SYSTEMS AND METHODS - System, method, and computer program product for processing data are disclosed. The system is configured to perform transfer of data from a file system to a database system. Such transfer is accomplished through receiving a request for loading data into a database system, wherein the data includes a plurality of attributes, determining at least one attribute of the data for loading into the database system, and loading the at least one attribute of the data into the database system while continuing to process remaining attributes of the data. | 12-08-2011 |
20110302583 | SYSTEMS AND METHODS FOR PROCESSING DATA - A system, method, and computer program product for processing data are disclosed. The system includes a data processing framework configured to receive a data processing task for processing, a plurality of database systems coupled to the data processing framework, wherein the database systems are configured to perform a data processing task, and a storage component in communication with the data processing framework and the plurality database systems, configured to store information about each partition of the data processing task being processed by each database system and the data processing framework. The data processing task is configured to be partitioned into a plurality of partitions and each database system is configured to process a partition of the data processing task assigned for processing to that database system. Each database system is configured to perform processing of its assigned partition of the data processing task in parallel with another database system processing another partition of the data processing task assigned to the another database system. The data processing framework is configured to perform at least one partition of the data processing task. | 12-08-2011 |
Patent application number | Description | Published |
20150106303 | FINITE STATE MACHINE FORMING - Techniques for representing a finite state machine forming are described herein. The techniques include a method that identifies screens of a computing program. The method may include correlating the identified screens with states of a finite state machine. Events indicating transition between the identified screens may be determined as well as data flow associated with the events. The method may include forming a graph representing the screens, events, and data flow in the finite state machine. | 04-16-2015 |
20150113501 | MOBILE COMPUTING PROGRAM SLICING - Techniques for computer program slicing are described herein. The techniques include screens of a mobile computing program having a behavior. The method may include determining a subset of screens associated with the behavior. A slice of the mobile computing program may be generated based on the subset of screens of the mobile computing program such that the slice produces the same behavior of the mobile computing program. | 04-23-2015 |
20150121336 | SCREEN-ORIENTED COMPUTING PROGRAM REFACTORING - Techniques for refactoring a screen-oriented computing program are described herein. The techniques include a method that identifies screens of the computing program, and determines a starting point of the computing program based on the identified screens. The techniques include refactoring the computing program based on the starting point and the identified screens. | 04-30-2015 |
20150121349 | SCREEN ORIENTED DATA FLOW ANALYSIS - A method for performing data flow analysis of computer code, comprising: providing computer code of a computer program having a plurality of user interface screens; dividing the computer code to a plurality of portions such that each one of the portions includes code for inducing at least one of loading and using one of the user interface screens; performing a variable usage analysis to detect which variables are at least one of calculated and used in each one of the portions; constructing a data dependence model defining dependencies among the portions based on the variable usage analysis; and identifying, for at least one of the portions and using the data dependence model, at least one unnecessary variable loaded in one of the user interface screens and not used in a respective portion and in a group of portions depending on the respective portion. | 04-30-2015 |
20150248342 | METHOD FOR FINDING ALL VALID INTERPROCEDURAL EXECUTION PATHS ON COBOL IN POLYNOMIAL TIME - Disclosed are methods for finding all valid paths in a COBOL program. These methods are performed in polynomial time, allowing them to be scaled to accommodate large COBOL programs. As the methods find all valid paths in COBOL program code, by traversing and marking the nodes of the program upon being traversed. Accordingly, all usable and reachable code is indicated and marked. This increases safety when working with the code, as removal or alteration of such valid code is indicated, and thus, made unlikely. | 09-03-2015 |