Patent application number | Description | Published |
20090119311 | SYSTEMS, METHODS, AND COMPUTER PRODUCTS FOR IN-PLACE MODEL ATTRIBUTE COMPARISON - Systems, methods and computer products for comparing computer models to show differences. Exemplary embodiments include a method for examining changes to a data model in a computer system having a keyboard and a display, the method including examining a computer model having a plurality of model attributes, identifying each model attribute and assigning a unique identifier to each model attribute, storing information about each uniquely identified model attribute, collecting data related to edits performed on of each of the uniquely identified model attributes, providing a user selectable comparison for each of the uniquely identified model attributes such that when a model attribute is selected, data particular to the model attribute is extracted using the unique identifier from a previous iteration of the model attribute and presenting the extracted data next to the current iteration of the model attribute to allow a visual comparison of the two iterations. | 05-07-2009 |
20090164971 | Convention Based UML Modeling Tool - Within the exemplary embodiments a user is presented with a GUI comprising a main modeling interface window wherein a convention-based model is constructed. The GUI further comprises and an icon repository window wherein the basic modeling tools that are provided within the exemplary embodiments are displayed to the user. Using conventional input devices, a user can drag the representations of the icons that are displayed within the icon repository window into the main modeling interface window in order to construct a desired convention-based model. | 06-25-2009 |
20090168785 | MODELING NON-DETERMINISTIC PRIORITY QUEUES FOR EFFICIENT MODEL CHECKING - A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues. | 07-02-2009 |
20100037155 | METHOD AND SYSTEM FOR GENERATING UNIVERSAL GRAPHICAL USER INTERFACE ELEMENT AND RELATION - A method, system and article of manufacture are disclosed for creating a graphical user interface (GUI) item, in a computer system having a graphical user interface and a display screen. The method includes the step of enabling a user to create one or more instances of a defined GUI item. This enabling step, in turn, includes the steps of displaying on the display screen a Universal Graphical User Interface (UGUI) item; and identifying on the display screen, in a defined manner associated with the display of the UGUI item, a desired GUI item. In response to said identifying this desired GUI item, the displayed UGUI item is visually transformed on the display screen to said desired GUI item. The UGUI item may be a UGUI element or a UGUI relation for indicating the relation between two GUI elements. | 02-11-2010 |
20110055812 | SHARABLE DEVELOPMENT ENVIRONMENT BOOKMARKS FOR FUNCTIONAL/DATA FLOW - An embodiment of the invention provides relative bookmarks that are sharable between developers engaged in product development utilizing integrated design environment applications. The relative bookmarks are sharable in that they can be exported, imported, activated and deactivated. The relative bookmarks are relative in that they do not rely on the original code line and contain at least function and/or data flow information, facilitating quick identification of relevant lines of code that have been previously bookmarked. The relative bookmarks can also be utilized to insert breakpoints. | 03-03-2011 |
20140137076 | INDICATING HIERARCHY DIVERSION IN A CLASS DIAGRAM - Indicating hierarchy diversion in a class diagram. A class inheritance structure for at least one parent class contained in computer program code can be identified to determine a class hierarchy corresponding to the parent class. For at least one child class in the class hierarchy that is a child of the parent class, a parent-child similarity value corresponding to a parent-child diversion of the child class from the parent class can be calculated via a processor. The class diagram can be generated. The class diagram can indicate at least the parent class, the child class and the parent-child similarity value. The class diagram can be presented. | 05-15-2014 |
20140137081 | INDICATING HIERARCHY DIVERSION IN A CLASS DIAGRAM - Indicating hierarchy diversion in a class diagram. A class inheritance structure for at least one parent class contained in computer program code can be identified to determine a class hierarchy corresponding to the parent class. For at least one child class in the class hierarchy that is a child of the parent class, a parent-child similarity value corresponding to a parent-child diversion of the child class from the parent class can be calculated via a processor. The class diagram can be generated. The class diagram can indicate at least the parent class, the child class and the parent-child similarity value. The class diagram can be presented. | 05-15-2014 |
20140297675 | RDF GRAPHS MADE OF RDF QUERY LANGUAGE QUERIES - A method, software and/or computer system for representing a set of SPARQL queries. The set of SPARQL queries are converting into an RDF representation of the set of SPARQL queries (that is, a SPARQL RDF graph). The SPARQL RDF graph is applied to a target RDF graph to yield a transformed target representing the responses to the set of queries, as an ontology or as text. | 10-02-2014 |
20140297676 | RDF GRAPHS MADE OF RDF QUERY LANGUAGE QUERIES - A method, software and/or computer system for representing a set of SPARQL queries. The set of SPARQL queries are converting into an RDF representation of the set of SPARQL queries (that is, a SPARQL RDF graph). The SPARQL RDF graph is applied to a target RDF graph to yield a transformed target representing the responses to the set of queries, as an ontology or as text. | 10-02-2014 |