Parsing, Syntax Analysis, And Semantic Analysis Patents (Class 717/143)
  • Patent number: 11386213
    Abstract: An apparatus configured for database access control. The apparatus includes a memory and a processor coupled to the memory, wherein the processor is configured to execute instructions. The instructions include receiving a statement requesting access for a user to data files stored in a non-transitory memory medium; parsing the statement into one or more arguments, wherein each argument ends with a logical operator; computing a skip count for each of the arguments; evaluating the statement using the skip counts to determine whether the access should be granted to the user; retrieving the data files from the non-transitory memory medium; and sending the data files to the user, if the access is granted.
    Type: Grant
    Filed: June 21, 2016
    Date of Patent: July 12, 2022
    Assignee: Unisys Corporation
    Inventor: Adam Gallagher
  • Patent number: 11295232
    Abstract: A hierarchical extraction model for a label hierarchy may be implemented by a weighted hierarchical state machine whose structure and/or weights are determined in part from a statistical distribution of label sequences as determined from training data. In accordance with various embodiments, the hierarchical state machine includes one or more non-cyclic directed chains of states representing at least a subset of the label sequences, and transitions weighted based at least in part on the statistical distribution.
    Type: Grant
    Filed: October 30, 2017
    Date of Patent: April 5, 2022
    Assignee: Microsoft Technology Licensing, LLC
    Inventor: David Maxwell Chickering
  • Patent number: 11275566
    Abstract: Methods, systems, and computer program products for generating computer source code products. According to one method, an engineer creating or modifying an implementation of computer source code selects abstractions of computer program design from a catalog of design patterns. Design patterns are known abstractions that solve specific problems of computer program design and implementation. The selected design patterns are then bound to elements within a representation of the implementation known as a model. The model is then converted into a representation using elemental design patterns, and this abstraction model is used to generate computer source code in any programming language. The abstraction model is also suitable as input for an automated inference engine for validation or verification purposes prior to, or after, the generation of the computer source code.
    Type: Grant
    Filed: September 24, 2020
    Date of Patent: March 15, 2022
    Assignee: ELEMENTAL REASONING, LLC
    Inventor: Jason M. Smith
  • Patent number: 11256400
    Abstract: The present disclosure provides a terminal, a split-screen display method for a screen thereof, and a storage device. The method comprises: a terminal system establishing a virtual stack according to an original stack, wherein an active component of the virtual stack is entirely or partially identical to an active component of the original stack; a first area of a terminal screen displaying a user interface corresponding to an active component at the stack top of the original stack, and a second area of the terminal screen displaying a user interface corresponding to an active component at the stack top of the virtual stack.
    Type: Grant
    Filed: March 19, 2018
    Date of Patent: February 22, 2022
    Assignee: JRD COMMUNICATION (SHENZHEN) LTD
    Inventors: Dezheng Feng, Tao Li, Jiancai He
  • Patent number: 11249877
    Abstract: Methods, apparatus, and systems for traversing a representation of an application source code are disclosed. Steps for traversing the representation include beginning to traverse the representation, monitoring a history of the traverse, and continuing to traverse the representation based on the history of the traverse. Continuing to traverse the representation may include identifying a plurality of concrete implementations of a method invocation and traversing less than all of the concrete implementations, the concrete implementations being traversed being selected based on the history of the traverse.
    Type: Grant
    Filed: July 2, 2019
    Date of Patent: February 15, 2022
    Assignee: NTT SECURITY APPSEC SOLUTIONS INC.
    Inventor: Eric Sheridan
  • Patent number: 11226815
    Abstract: A method of analyzing code is provided. The method includes generating an abstract representation of the code, identifying conditional statements in the abstract representation, populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement and assessing the truth table for each conditional statement to identify issues.
    Type: Grant
    Filed: April 7, 2020
    Date of Patent: January 18, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Michael E. Gildein, Daniel Nicolas Gisolfi
  • Patent number: 11226796
    Abstract: A method may include generating, based on a first programming code implementing a routine in a first programming language, a second programming code implementing the routine in a second programming language associated with an offline runtime environment and a third programming code implementing the routine in a third programming language associated with an online runtime environment. The routine may include a first operation and a second operation associated with a cloud-based software application. The first operation may be capable of being performed while the cloud-based software application is operating in an offline mode but the second operation may be incapable of being performed while the cloud-based software application is operating in the offline mode. The second second programming code being generated to include the first operation and exclude the second operation. The second programming code and the third programming code may be deployed to a client.
    Type: Grant
    Filed: May 4, 2020
    Date of Patent: January 18, 2022
    Assignee: SAP SE
    Inventor: Horst Schaude
  • Patent number: 11205042
    Abstract: A computer-implemented system, method and computer program product to transform content and to generate a visual indicator of that transformation, by: performing the transformation on the content, wherein the content is transformed from one state to another state; and displaying the visual indicator representative of the transformation adjacent the content; wherein the visual indicator is selected to display the content in a state that existed prior to or at a time when the transformation was performed. As subsequent transformations are performed, additional visual indicators are listed in the order performed. The visual indicator acts as a user interface element that allows a user to view or revert the content to a state that existed prior to or at a time that the transformation was performed. Selection of the visual indicator follows the control to the destination. The visual indicator also serves to relay information sent from the destination.
    Type: Grant
    Filed: October 2, 2018
    Date of Patent: December 21, 2021
    Assignee: International Business Machines Corporation
    Inventors: Ami H. Dewar, Rachael M. Dickens, Ethan A. Geyer, Thomas J. Blanchflower
  • Patent number: 11169784
    Abstract: During a process called live design, a computing system may receive, from a repository, an instance of a first component comprising a first set of one or more metaobjects that provides a binary representation of the instance of the first component. In turn, the computing system may render the instance of the first component as an icon and a first set of one or more underlying panes that provide a visual expression of the instance of the first component. The computing system may then receive, via the first set of one or more underlying panes, a user modification to the instance of the first component. Thereafter, the computing device and/or the repository may determine whether the user modification to the instance of the first component is valid, and may process the user modification in accordance with the determining.
    Type: Grant
    Filed: January 28, 2020
    Date of Patent: November 9, 2021
    Inventor: James L. Bosworth
  • Patent number: 11157532
    Abstract: The embodiments relate to generating hierarchical patterns based on a corpus of text. The corpus is analyzed, which includes extracting a set of features of the corpus. A set of grammatical patterns are generated based on the extracted features. The set of grammatical patterns includes at least one grammatical pattern generated from an internal pattern and at least one grammatical pattern generated from an external pattern. The grammatical patterns of the set are organized into a hierarchy and/or are ranked. The hierarchy and/or ranking are visually displayed.
    Type: Grant
    Filed: October 5, 2015
    Date of Patent: October 26, 2021
    Assignee: International Business Machines Corporation
    Inventors: Shenghua Bao, Ying Chen, Anshu N. Jain, Cartic Ramakrishnan, Maia A. Smith
  • Patent number: 11126413
    Abstract: A compiling device (100) configured to convert a source code computer program (102) into an object code computer program (106), the compiling device comprising—a processor circuit arranged to—parse (120) the source code computer program and generate a static single assignment (SSA) graph (122) for at least a portion of the source code computer program, and—search for a second subgraph (P) of the SSA graph, wherein a first subgraph (N) is a subgraph of the second subgraph (N?P), a sum of the bit sizes associated to incoming edges of the second subgraph being smaller than a sum of the bit sizes associated to incoming edges of the first graph, —implementing the second subgraph of the SSA graph in the object code computer program as a single operation thus omitting the assignments corresponding to edges of the first subgraph.
    Type: Grant
    Filed: January 5, 2018
    Date of Patent: September 21, 2021
    Assignee: Koninklijke Philips N.V.
    Inventor: Willem Charles Mallon
  • Patent number: 11119740
    Abstract: Operations may include obtaining a code artifact in which the code artifact is a code snippet is of a software language of interest. The operations may also include identifying fault locations of the code snippet that each correspond to a parsing error. In addition, the operations may include implementing repairs for each identified fault location in which, for each fault location, a respective repair is implemented for its corresponding parsing error such that the code snippet is modified into a parsable code snippet.
    Type: Grant
    Filed: January 8, 2020
    Date of Patent: September 14, 2021
    Assignee: FUJITSU LIMITED
    Inventors: Sonal Mahajan, Mukul R. Prasad
  • Patent number: 11113264
    Abstract: Provided are systems and methods for resolving conflicts between different versions of a database file. In one example, the method may include one or more of receiving, at a database, a request to publish a modified version of a database file modified by a user having privileges to update the database file, detecting, during a merge operation, a conflict between one or more data values included in the unpublished modified version of the database file and one or more corresponding data values in an intervening version of the database file published by another user that also has privileges to update the database file, and outputting a user interface displaying an identification of the one or more conflicting data values and one or more selections for resolving the one or more conflicting data values.
    Type: Grant
    Filed: April 27, 2018
    Date of Patent: September 7, 2021
    Assignee: SAP SE
    Inventor: Jan Rittinger
  • Patent number: 11106861
    Abstract: Techniques and solutions are described for defining transformation specifications in a programming-language independent language and converting such specifications to one or more executable formats. The language can provide for defining rules and actions. Rules can refer to (e.g., be based at least in part on) data targets, such as attributes of a schema, whose identifiers are to be read or updated, or to other rules. Rules can be reused, and can recursively refer to one another, such that a large number of complex schema transformations can be accomplished using a series of first order logic statements. Actions can define what, and how, values will be changed when a predicate rule is satisfied. A transformation specification in the language can be parsed and selectively complied to one or more executable formats, including in programming languages such as the structured query language. Disclosed technologies can facilitate data transformations by non-technical users.
    Type: Grant
    Filed: February 1, 2019
    Date of Patent: August 31, 2021
    Assignee: SAP SE
    Inventors: Jan Portisch, Joachim Gross, Sandra Bracholdt
  • Patent number: 11048503
    Abstract: According to one embodiment, a code information storage is configured to store information on a plurality of functions, a calling relationship between the plurality of functions, and code blocks in the respective plurality of functions. A user operation storage is configured to store information of an already read code block. An already read graph generator is configured to generate an already read graph expressing an already read function including the already read code block, all the code blocks included in the already read function, and a calling relationship between the already read code block and the already read function. An expression of the already read code block differs from an expression of the other code block.
    Type: Grant
    Filed: March 7, 2019
    Date of Patent: June 29, 2021
    Assignee: KABUSHIKI KAISHA TOSHIBA
    Inventors: Shou Morita, Mamoru Aoki, Takenori Koshiro
  • Patent number: 11042647
    Abstract: An example method includes monitoring execution of one or more applications on a runtime computing system that includes a plurality of processing units, receiving, from the runtime computing system during execution of the applications, monitoring information that includes at least one of function call data or application programming interface call data associated with operations performed by the plurality of processing units during execution of the applications, importing the monitoring information into a risk model, analyzing the monitoring information within the risk model to determine one or more potential vulnerabilities and one or more impacts of the one or more vulnerabilities in the runtime computing system, and outputting, for display in a graphical user interface, a graphical representation of the one or more potential vulnerabilities and the one or more impacts within the risk model.
    Type: Grant
    Filed: December 20, 2019
    Date of Patent: June 22, 2021
    Assignee: ARCHITECTURE TECHNOLOGY CORPORATION
    Inventors: Robert A. Joyce, Matthew P. Donovan
  • Patent number: 11030105
    Abstract: According to one technique, a virtual machine generates an object configured to provide secure access to memory through one or more memory fencing operations. Through the object, the virtual machine receives a call that indicates a memory location and specifies a particular memory fencing operation of the one or more memory fencing operations to perform with respect to the memory location. The virtual machine causes performance of the particular memory fencing operation with respect to the memory location.
    Type: Grant
    Filed: April 7, 2015
    Date of Patent: June 8, 2021
    Assignee: Oracle International Corporation
    Inventors: Paul Sandoz, Brian Goetz, John Robert Rose
  • Patent number: 11023214
    Abstract: Embodiments herein disclose systems and methods for enabling new types (referred to as existent types), that allow for expressing additional possible values and, thereby, eliminating out-of-bounds access errors in programming. In addition to the value “null” as supported by many programming languages, embodiments herein introduce a new special or reserved value to represent an out-of-bounds access. In an exemplary embodiment, a special “undefined” value or memory address, which is distinct from “null”, that exclusively describes out-of-bounds accesses is defined. The implementation includes but is not limited to value checks, bounds checks, and container-level implementations.
    Type: Grant
    Filed: July 27, 2019
    Date of Patent: June 1, 2021
    Inventors: Roger James Poon, Anton Rapetov
  • Patent number: 10956574
    Abstract: A system and method for securing an application through an application-aware runtime agent can include: acquiring a code profile, instrumenting the application with a runtime agent according to the code profile, enforcing the runtime agent on the execution of the application, and responding to the runtime agent. Enforcing the runtime agent on the execution of the application can include monitoring the execution flow, which comprises of monitoring the utilization of the controls through the execution of the application; detecting a threat, which comprises identifying a section of the execution flow as a potential security threat; and regulating the execution flow to prevent or ameliorate the security threat. Responding to the runtime agent can include responding to the security threat and providing a user interface that may output runtime agent diagnostics and trigger alerts.
    Type: Grant
    Filed: October 8, 2018
    Date of Patent: March 23, 2021
    Assignee: ShiftLeft Inc.
    Inventors: Chetan Conikee, Manish Gupta, Vlad A Ionescu, Ignacio del Valle Alles
  • Patent number: 10936668
    Abstract: A method for providing visualization of data objects in a relational database is provided. The method comprises: (a) bringing an electronic device of a user in communication with a server comprising the non-hierarchical relational database, (b) generating and displaying a graph comprising visual graphical elements including a first node representing a first class encompassing a first subset of the data objects, a second node representing a second class encompassing a second subset of the data objects, and a link representing a relationship between the first class and the second class, (c) receiving a request via the user interface of the electronic device to perform a task directed to at least a subset of the data objects, (d) generating one or more filtering operations for the task and, upon execution, producing a graphical result comprising a filtered data set, and (e) automatically displaying the graphical result on the user interface.
    Type: Grant
    Filed: October 22, 2018
    Date of Patent: March 2, 2021
    Assignee: DATAWALK SPOLKA AKCYJNA
    Inventor: Krystian Piecko
  • Patent number: 10929529
    Abstract: A cyber-security threat detection system and method stores physical data measurements from a cyber-physical system and extracts synchronized measurement vectors synchronized to one or more timing pulses. The system and method synthesize data integrity attacks in response to the physical data measurements and applies alternating parameterized linear and non-linear operations in response to the synthesized data integrity attacks. The synthesis renders optimized model parameters used to detect multiple cyber-attacks.
    Type: Grant
    Filed: January 28, 2020
    Date of Patent: February 23, 2021
    Assignee: UT-BATTELLE, LLC
    Inventors: Erik M. Ferragut, Jason A. Laska
  • Patent number: 10884716
    Abstract: A first and second local scope definition associated with a first and second node, respectively, in a hierarchical application tree are received where the hierarchical application tree includes application instructions at one or more nodes within the hierarchical application tree. A pruned version of the hierarchical application tree is determined including by propagating the first local scope definition from the first node to the second node, a child of the first node. Any nodes that are not relevant to a particular set of one or more local scope definitions at a given node are pruned in order to obtain a pruned version of the hierarchical application tree. A qualified application is generated using those application instructions at the unpruned nodes in the pruned version of the hierarchical application tree.
    Type: Grant
    Filed: May 15, 2020
    Date of Patent: January 5, 2021
    Assignee: EMC IP Holding Company LLC
    Inventor: Sachin G. Totale
  • Patent number: 10846299
    Abstract: Computer program products, methods, systems, apparatus, and computing entities are provided for automatically validating and/or converting data in candidate transaction in a distributed ledger systems. The validating and converting can be automatically executed via one or more smart contracts. Once validated and/or converted the candidate transaction may be committed to a ledger in the distributed ledger system.
    Type: Grant
    Filed: December 11, 2018
    Date of Patent: November 24, 2020
    Assignee: Optum, Inc.
    Inventors: Brian T. Gaillardetz, Maxwell Galat, Vatsal Shah, Daniel Smith, Soleh Udin Al Ayubi
  • Patent number: 10824406
    Abstract: For parsing source code into a linear array, a method parses source code into a plurality of logic design elements. The method further identifies conditional logic for each logic design element. In addition, the method identifies computation logic for each logic design element. The method encodes each logic design element as a logic state of a plurality of logic states in a linear array. Each logic state includes one or more binary output variables, one or more binary input variables, one or more minterms of the one or more binary input variables, one or more maxterms of the one or more minterms, one or more present state values, and one or more next state values. The method reduces the logic relationships to a Boolean equation. The method generates one of output source code and a hardware implementation from the Boolean equation.
    Type: Grant
    Filed: August 23, 2019
    Date of Patent: November 3, 2020
    Assignee: Assurant Design Automation LLC
    Inventor: M. David McFarland
  • Patent number: 10732944
    Abstract: A method, apparatus, and system for using a verification substitute header file in a verification of an application that uses Protocol Buffers (Protobuf) for data communication is disclosed. The operations comprise: obtaining one or more Protobuf message types from a Protobuf definition file; generating the verification substitute header file based on the Protobuf message types; adding one or more verification stubs to the verification substitute header file; including the verification substitute header file in source code of the application; and performing the verification of the application including the verification substitute header file.
    Type: Grant
    Filed: May 14, 2019
    Date of Patent: August 4, 2020
    Assignee: BAIDU USA LLC
    Inventors: Qian Feng, Yulong Zhang, Pei Wang, Yu Ding, Tao Wei
  • Patent number: 10691433
    Abstract: A system for code development and execution includes a client interface and a client processor. The client interface is configured to receive user code for execution and receive an indication of a server that will perform the execution. The client processor is configured to parse the user code to identify one or more data items referred to during the execution. The client processor is also configured to provide the server with an inquiry for metadata regarding the one or more data items, receive the metadata regarding the one or more data items, determine a logical plan based at least in part on the metadata regarding the one or more data items; and provide the logical plan to the server for execution.
    Type: Grant
    Filed: August 31, 2018
    Date of Patent: June 23, 2020
    Assignee: Databricks Inc.
    Inventors: Srinath Shankar, Eric Keng-hao Liang, Gregory George Owen
  • Patent number: 10678787
    Abstract: Described are methods, systems and computer readable media for computer assisted completion of hyperlink command segments.
    Type: Grant
    Filed: October 27, 2017
    Date of Patent: June 9, 2020
    Assignee: Deephaven Data Labs LLC
    Inventor: Charles Wright
  • Patent number: 10649742
    Abstract: During a process called live design, a computing system may receive, from a repository, an instance of a first component comprising a first set of one or more metaobjects that provides a binary representation of the instance of the first component. In turn, the computing system may render the instance of the first component as an icon and a first set of one or more underlying panes that provide a visual expression of the instance of the first component. The computing system may then receive, via the first set of one or more underlying panes, a user modification to the instance of the first component. Thereafter, the computing device and/or the repository may determine whether the user modification to the instance of the first component is valid, and may process the user modification in accordance with the determining.
    Type: Grant
    Filed: June 15, 2015
    Date of Patent: May 12, 2020
    Inventor: James L. Bosworth
  • Patent number: 10621152
    Abstract: In a pipeline of operations having a terminating operation and a source operation, a builder is built corresponding to the terminating operation. The builder may also correspond to one or more intermediate operations. A database query is generated corresponding to the builder and is sent to a database or a data source for efficient access to the database.
    Type: Grant
    Filed: December 2, 2016
    Date of Patent: April 14, 2020
    Assignee: Speedment, Inc.
    Inventors: Per-åke Minborg, Emil Forslund
  • Patent number: 10599655
    Abstract: An applicant can instantiate a parsing framework, provide an input stream, attach observers, and initiate parsing, which inverts control to the parsing framework. The parsing framework can have an observer manager, a parser controller, and parsers. The observer manager manages observer design patterns from which the observers are instantiated. The parser controller determines which parser would be appropriate for parsing the input stream and instantiate the appropriate parser(s). The parser controller gets the callbacks from the parsers and communicates outcomes to the observer manager. The observer manager determines which of the observers is to be notified, generates parsing notifications accordingly, and dispatches the parsing notifications directly to the observers. The application can be any application that needs parsing in an electronic information exchange platform.
    Type: Grant
    Filed: February 25, 2019
    Date of Patent: March 24, 2020
    Assignee: OPEN TEXT GXS ULC
    Inventors: Phil Hanson, Kris Loia
  • Patent number: 10572659
    Abstract: A cyber-security threat detection system and method stores physical data measurements from a cyber-physical system and extracts synchronized measurement vectors synchronized to one or more timing pulses. The system and method synthesizes data integrity attacks in response to the physical data measurements and applies alternating parametrized linear and non-linear operations in response to the synthesized data integrity attacks. The synthesis renders optimized model parameters used to detect multiple cyber-attacks.
    Type: Grant
    Filed: September 19, 2017
    Date of Patent: February 25, 2020
    Assignee: UT-Battelle, LLC
    Inventors: Erik M. Ferragut, Jason A. Laska
  • Patent number: 10564947
    Abstract: A compiler system, computer-implemented method and computer program product for optimizing a program for multi-processor system execution. The compiler includes an interface component configured to load from a storage component program code to be executed by one or more processors (P1 to Pn) of a multi-processor system. The compiler further includes a static analysis component configured to determine data dependencies) within the program code, and further determines all basic blocks of the control flow graph providing potential insertion positions along paths where communication statements can be inserted to enable data flow between different processors at runtime. An evaluation function component of the compiler is configured to evaluate each potential insertion position with regards to its impact on program execution on the multi-processor system at runtime by using a predefined execution evaluation function.
    Type: Grant
    Filed: January 19, 2018
    Date of Patent: February 18, 2020
    Assignee: Karlsruhe Institute of Technology
    Inventors: Johannes Meyer, Oliver Oey, Timo Stripf, Jürgen Becker
  • Patent number: 10558809
    Abstract: An example method includes monitoring execution of one or more applications on a runtime computing system that includes a plurality of processing units, receiving, from the runtime computing system during execution of the applications, monitoring information that includes at least one of function call data or application programming interface call data associated with operations performed by the plurality of processing units during execution of the applications, importing the monitoring information into a risk model, analyzing the monitoring information within the risk model to determine one or more potential vulnerabilities and one or more impacts of the one or more vulnerabilities in the runtime computing system, and outputting, for display in a graphical user interface, a graphical representation of the one or more potential vulnerabilities and the one or more impacts within the risk model.
    Type: Grant
    Filed: April 12, 2017
    Date of Patent: February 11, 2020
    Assignee: ARCHITECTURE TECHNOLOGY CORPORATION
    Inventors: Robert A. Joyce, Matthew P. Donovan
  • Patent number: 10552296
    Abstract: Various aspects of the subject technology related to systems and methods for generating a human-readable, language-independent stack trace summary. A system may be configured to receive error reports which include a language-dependent stack trace generated in response to a software test failure and metadata. The generated language-dependent stack trace includes one or more frames. The system may generate a language-independent stack trace summary by processing each frame of the language-dependent stack trace by removing line number values from each of the one or more frames, removing column number values from each of the one or more frames, collapsing one or more file names identified in each of the one or more frames, and removing spaces from each of the one or more frames. The system may output the generated language-independent stack trace summary.
    Type: Grant
    Filed: October 20, 2017
    Date of Patent: February 4, 2020
    Assignee: Google LLC
    Inventors: Dominic Hamon, Ruixue Li
  • Patent number: 10552299
    Abstract: Models of certain groups of graphical user interface (GUI) objects (e.g., menu objects, product objects, title objects, etc.) are created. A website is then modeled as a state machine (also called a blueprint), in which states are used to model webpages of the website. Identifying characteristics of the states are specified based on the models of the GUI objects. Certain scanning options are used to reduce the complexity of the state machine and accelerate the state machine creation process, known as the “one per page” and “once per app” scanning options. After the state machine model of the website has been created, test cases are generated as traversals through the state machine. In one embodiment, user logs direct the generation of test cases so that the test cases resemble past user behavior.
    Type: Grant
    Filed: August 14, 2019
    Date of Patent: February 4, 2020
    Assignee: APPVANCE INC.
    Inventors: Kevin Surace, Luis Carlos Lara Lopez, Oscar Gerardo Mora Corrales
  • Patent number: 10534640
    Abstract: A native Job Control Language (JCL) execution engine is provided in a mainframe rehosting platform/open platform for executing a migrated JCL job without converting the JCL job to another language. The JCL execution engine provides a framework which supports an internal JCL mechanism, a simulation of a plurality of mainframe utilities commonly used in JCL jobs, and a simulation of commonly used database utilities. When the JCL execution engine receives a JCL job, it generates a statement sequence from the JCL job, orders statements in the sequence into a doubly-linked sequence, and parses the doubly-linked sequence to construct a job element hierarchy tree for execution. A plurality of job initiators are provided to dequeue jobs from a job queue and dispatch the jobs to the JCL execution engine or another type of execution engine.
    Type: Grant
    Filed: July 26, 2017
    Date of Patent: January 14, 2020
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Weixuan (Wade) Zhang, Hui Shen, Minhui Nie, Gang (Jim) Wang, Yunbo Deng, Fangzhi Tang, Zhaoyong Zhang
  • Patent number: 10437819
    Abstract: Among other things, a method of generating a computer program based on an SQL query includes receiving a SQL query, including a reference to a first data set stored at a first data source, and including a reference to a second data set stored at a second data source different from the first data source, determining that the SQL query includes two or more commands, the commands including a first union-type operation, and a first aggregation operation, and determining that the SQL query describes that the first union-type operation shall be applied to at least a portion of data from the first data set, and applied to at least a portion of data from the second data set, determining that the SQL query describes that the first aggregation operation shall be applied to data resulting from the first union-type operation, and generating the computer program.
    Type: Grant
    Filed: June 22, 2015
    Date of Patent: October 8, 2019
    Assignee: Ab Initio Technology LLC
    Inventors: Ian Schechter, Alexander Lavrentyev
  • Patent number: 10402175
    Abstract: For parsing source code into a linear array, a method parses source code into a plurality of logic design elements. The method further identifies conditional logic for each logic design element. In addition, the method identifies computation logic for each logic design element. The method encodes each logic design element as a logic state of a plurality of logic states in a linear array. Each logic state includes one or more binary output variables, one or more binary input variables, one or more minterms of the one or more binary input variables, one or more maxterms of the one or more minterms, one or more present state values, and one or more next state values. The method reduces the logic relationships to a Boolean equation. The method generates one of output source code and a hardware implementation from the Boolean equation.
    Type: Grant
    Filed: June 13, 2018
    Date of Patent: September 3, 2019
    Assignee: Assurant Design Automation LLC
    Inventor: M. David McFarland
  • Patent number: 10394685
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to XPATH expression debugging and provide a novel and non-obvious method, system and apparatus for an XPATH expression debugging framework. In an embodiment of the invention, an XPATH expression debugging method can include receiving an XPATH input expression, parsing the XPATH input expression to produce a group of sub-expressions, and ordering the sub-expressions in a model for the XPATH input expression. Thereafter, in response to a selection of one of the sub-expressions in the model, a result set can be produced for the sub-expression.
    Type: Grant
    Filed: September 13, 2012
    Date of Patent: August 27, 2019
    Assignee: International Business Machines Corporation
    Inventors: William G. O'Farrell, Mariano Consens, John (Wen Sheng) Liu
  • Patent number: 10387130
    Abstract: A distributed metadata driven system and method that allows a single server component the ability to control the display, behavior, and functionality of client applications.
    Type: Grant
    Filed: October 20, 2010
    Date of Patent: August 20, 2019
    Assignee: SUGARCRM INC.
    Inventors: Andreas Sandberg, Lila Alexei Tretikov, Majed Itani, Clint Oram
  • Patent number: 10353750
    Abstract: The present disclosure relates to techniques for discovering and exposing middleware applications as service endpoints through a universal connector in a middleware-agnostic fashion that does not require additional coding. In one embodiment, a back-end middleware system identifies a set of middleware applications that operate on an input/output (I/O) data area. Next, the back-end middleware system generates a set of discovery artifacts describing the middleware applications and the I/O data area. A discovery client sends a discovery request to a the back-end middleware system, which sends structured information from the discovery artifacts in response. Based on the structured information, the discovery client creates a REST model for the set of middleware applications, mapper artifacts that map REST operations to the middleware applications, and transformer artifacts that indicate how to convert data between Javascript-object-notation (JSON) format and format that is compatible with the I/O data area.
    Type: Grant
    Filed: March 3, 2017
    Date of Patent: July 16, 2019
    Assignee: International Business Machines
    Inventors: Gopalakrishnan P, Kishor S. Kulkarni, Sreejith Nalamvathukkal, Hariharan N. Venkitachalam
  • Patent number: 10324712
    Abstract: A method of maintaining or improving functionality of legacy code for operation in a new machine system is disclosed. Reference code and documentation are leveraged to provide functionality of the machine system. The sections may be identified and presented as user defined representations (for example, pseudocode, diagrams, descriptive text, or encapsulations) so that the reference code may be migrated to a newer machine system and the sections may be re-written as necessary to make the sections of reference compatible with the new machine system.
    Type: Grant
    Filed: November 17, 2015
    Date of Patent: June 18, 2019
    Inventor: Thomas A. Nolan
  • Patent number: 10310829
    Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler determines and indicates, in the program code, that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.
    Type: Grant
    Filed: January 27, 2017
    Date of Patent: June 4, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michael Karl Gschwind, Ulrich Weigand
  • Patent number: 10296304
    Abstract: A computer-implemented data analysis method including the steps of: providing a block for each group, in which the blocks are mapped to have different shapes from each other, and the groups are classified based on an attribute of a programming language-based function and instruction; providing a user interface for receiving the block selected by a user; generating a data analysis flow based on a user creation block that is generated when the selected blocks are combined in the user interface; transforming the data analysis flow to a programming language-based data analysis code through a language transform engine; and performing a data analysis based on the transformed data analysis code.
    Type: Grant
    Filed: April 27, 2018
    Date of Patent: May 21, 2019
    Assignee: NHN Entertainment Corporation
    Inventors: Dong Min Kang, Young Il Cho, Chanwoo Yang, Kyeong Won Seo, Sol Kim
  • Patent number: 10255280
    Abstract: An applicant can instantiate a parsing framework, provide an input stream, attach observers, and initiate parsing, which inverts control to the parsing framework. The parsing framework can have an observer manager, a parser controller, and parsers. The observer manager manages observer design patterns from which the observers are instantiated. The parser controller determines which parser would be appropriate for parsing the input stream and instantiate the appropriate parser(s). The parser controller gets the callbacks from the parsers and communicates outcomes to the observer manager. The observer manager determines which of the observers is to be notified, generates parsing notifications accordingly, and dispatches the parsing notifications directly to the observers. The application can be any application that needs parsing in an electronic information exchange platform.
    Type: Grant
    Filed: March 23, 2017
    Date of Patent: April 9, 2019
    Assignee: Open Text GXS ULC
    Inventors: Phil Hanson, Kris Loia
  • Patent number: 10248409
    Abstract: A code patching component may insert a binary patch into a native-code representation of a program during execution. Prior to inserting the binary patch, a patch code analysis tool may receive a source code patch for the program, and determine that applying the source code patch would change the binary for the program outside of the patched area (e.g., due to changes in the number of lines, changes in the file names or path information for source code files from which the program is built, or line directives that embed line numbers or file names in the binary for the patched program). The tool may modify the source code patch to limit its effects to the patch area by adding empty lines, merging of lines of code, or forcing a line number change. The tool may filter line directives to match previously embedded file name information.
    Type: Grant
    Filed: December 3, 2014
    Date of Patent: April 2, 2019
    Assignee: Amazon Technologies, Inc.
    Inventors: Martin Thomas Pohlack, Uwe Dannowski, Geoffrey Plouviez
  • Patent number: 10243819
    Abstract: In a provider network, recommendations pertaining to resources associated with a customer of the provider network is determined. The recommendations are determined based on an analysis of the resources, a requested use of the resources, and industry best practices associated with the requested use, architectural guidance, cost parameters, and policies, among others. An interface configured to provide the recommendations pertaining to the resources and the requested use is provided. A template based on the recommendations is provided and associated with the customer. The template is usable to configure an instantiation of a resource by the provider network.
    Type: Grant
    Filed: March 26, 2014
    Date of Patent: March 26, 2019
    Assignee: Amazon Technologies, Inc.
    Inventors: Mahendra Manshi Chheda, Christopher Whitaker, Frank Stienhans
  • Patent number: 10241767
    Abstract: Distributed function generation with shared structures is disclosed. A plurality of source code instructions that includes a data object definition associated with a data object type and a plurality of function definitions that accesses a data object of the data object type is received. A corresponding plurality of intermediate functions based on the plurality of function definitions is generated. First commands to generate a first set of native functions from corresponding intermediate functions are received. A first set of native functions in corresponding first native instruction sets associated with a first computing environment are generated. Second commands to generate a second set of native functions from corresponding intermediate functions are received. At least one native function in the second set of native functions is absent from the first set of native functions.
    Type: Grant
    Filed: February 24, 2017
    Date of Patent: March 26, 2019
    Assignee: Red Hat, Inc.
    Inventor: William Christian Benton
  • Patent number: 10204038
    Abstract: In one or more embodiments, one or more methods, processes and/or systems may receive multiple characters (e.g., a string), determine multiple offsets respectively corresponding to the multiple characters, determine multiple addresses based on a base address and the multiple offsets respectively corresponding to the multiple characters, and execute multiple subroutine call instructions to each of the multiple addresses. In one or more embodiments, an execution log of the subroutine call instructions to each of the multiple addresses may be analyzed. For instance, the execution log of the subroutine call instructions to each of the multiple addresses may be utilized in determining the multiple characters (e.g., the string) that were received. In one or more embodiments, determining the multiple characters may include determining offsets from a base address and utilizing the offsets as a mapping to characters. For example, the string may be recovered and/or recreated from the offsets.
    Type: Grant
    Filed: June 1, 2017
    Date of Patent: February 12, 2019
    Assignee: Dell Products L.P.
    Inventor: Craig Lawrence Chaiken
  • Patent number: 10192177
    Abstract: An example system for debugging transformed code includes a computer processor and computer memory including instructions that cause the computer processor to receive an error corresponding to a transformed code from a production service. The instructions also cause the processor to correlate the error to a symbol generated for the transformed code. The instructions further cause the processor to query a repository storing a source code corresponding to the transformed code using the symbol. The instructions also further cause the processor to assign the error to a developer based on a version history of the source code in the repository.
    Type: Grant
    Filed: June 29, 2016
    Date of Patent: January 29, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventor: Harry Phillip Ferguson, IV