Abstract: A computer-implemented method includes obtaining a first representation of a system, obtaining a set of test obligations, and automatically generating one or more test cases from the first representation based on the set of test obligations. The method further includes obtaining a second representation that is related to the first representation, obtaining an analysis criterion for the second representation, and assessing the analysis criterion using the one or more test cases applied to the second representation. Based on the assessing, one or more additional test obligations may be identified and a second set of one or more test cases may be generated based on the one or more additional test obligations.

Abstract: A device may provide an interface for an interactive programming environment and may receive a command to display information about an object. The device may provide, based on the command, the information about the object, using: a first display interface that presents the information about the object in a first format that is applicable to users of the object. A second display interface, for the object, may present the information about the object in a second format, different from the first format, the second format including information about the object that is applicable to authors of the class or to authors of subclasses corresponding to the object. The first and second display interface may present the information, about the object, based on a state of the object and/or based on a display section of the information (e.g., certain information may be presented in a header section of the display).

Abstract: A system and method optimizes hardware description generated from a graphical program or model having oversampling constraints automatically. The system may include a streaming optimizer, a resource sharing optimizer, a delay balancing engine, and a global scheduler. The streaming optimizer may transform vector data paths to scalar or smaller-sized vector data paths. The resource sharing optimizer may replace multiple, functionally equivalent blocks with a single shared block. The delay balancing may insert one or more elements to correct for data path misalignment. The global scheduler may place portions of the program or model into conditional execution sections and create control logic that controls the model sample times or steps that the portions are enabled. A validation model, a report, or hardware description code that utilizes fewer hardware resources may be generated from a modified version of the model that is created.

Abstract: A disclosed method may include iterating a model optimization process, the iterating including one or more iterations. The method may also include updating a classification model based on the iterating, the updating performed using training data. The method may further include generating a final version of the classification model based on a final iteration. The method may also include setting a parameter (q), the parameter corresponding to a total number of observations (Q) that are to be removed from the training data by the final iteration. The method may further include determining one or more corresponding numbers of observations to remove from the training data, where the corresponding number of observations are to be removed at some of select iterations tk, and the corresponding number of observations are to be removed based on the number Q and an estimate of the number of iterations remaining until the final iteration.

Abstract: A device may determine to provide help information associated with a portion of program code included in a program and provided via a user interface of a programming environment. The device may obtain generic help information, associated with the portion of program code, based on determining to provide the help information. The device may determine a set of rules for modifying the generic help information using the portion of program code. The device may analyze the program, using the set of rules, to identify information, included in the program, to be included in modified help information. The device may modify the generic help information, to generate the modified help information, using the information identified based on analyzing the program. The device may provide the modified help information for display via the user interface.

Abstract: A device receives a program code being created or edited, executes a first portion of the program code to generate a first result, and executes a second portion of the program code to generate a second result. The device stores the first result and the second result, and compares the first result and the second result to determine a difference between the first result and the second result. The device utilizes the difference to identify an error in the program code, and provides information, associated with the difference and the error, for display.

Abstract: Graphical programming or modeling environments in which a coding standard can be applied to graphical programs or models are disclosed. The present invention provides mechanisms for applying the coding standard to graphical programs/models in the graphical programming/modeling environments. The mechanisms may detect violations of the coding standard in the graphical model and report such violations to the users. The mechanisms may automatically correct the graphical model to remove the violations from the graphical model. The mechanisms may also automatically avoid the violations in the simulation and/or code generation of the graphical model.

Abstract: A device may receive model information that describes a model and external system information that describes an external system that is different than the model. The model information may identify a first set of signals, associated with the model, that are incompatible with the external system. The external system information may identify a second set of signals, associated with the external system, that are incompatible with the model. The device may generate interface code based on the model information and the external system information. The interface code, when executed, may permit the model and the external system to interact using the first set of signals and the second set of signals. The device may execute the interface code to transform the first set of signals to the second set of signals and to transform the second set of signals to the first set of signals.

Abstract: A mechanism for constructing a software-based instrument panel or front panel in which the components correspond directly with sections of code in a textual language program is disclosed. The textual language program relates to how the panel updates and operates in a continuous fashion. Icons representing panel components are selected from a component library window displayed to a user. The act of dragging the icon representing the components into the Graphical Panel Layout Window automatically causes the corresponding code to be added to the textual language program and displayed to the user in a Program Dialog Window. The present invention displays both a Graphical Panel Layout Window showing the components in the instrument panel and a Program Dialog Window showing the lines of code for the textual language program controlling the operation of the components in the instrument panel. A library containing I/O dialog devices is also presented and displayed to a user.

Abstract: An embodiment includes a computer-readable media storing instructions that when executed on processing logic execute a process for reducing complexity. The media stores instructions for identifying data dependencies in a model having executable semantics, the data dependencies affecting verification of the model and for selecting a location in the model, the location having data dependencies with other locations in the model, the location to be verified when the model is verified. The media also stores instructions for detecting complexities in the model, the complexities related to the selected location and presenting information about a source for at least one of the complexities. The media further stores instructions for eliminating the source for the at least one of the complexities and for transforming the model into an updated model based on the eliminating, the updated model not including the source for the at least one of the complexities.

Abstract: In an embodiment, a model is sliced into a plurality of slices. A slice in the plurality of slices is selected. A portion of code, that corresponds to the selected slice, is identified from code generated from the model. The identified code is verified to be equivalent to the selected slice. Equivalence may include equivalent functionality, equivalent data types, equivalent performance, and or other forms of equivalence between the selected slice and the identified generated code.

Abstract: A device receives test methods that include input arguments that match parameters. The test methods are used to test one or more portions of dynamically-type programming code, and the parameters define conditions for the test methods. The device receives one or more values for each of the parameters, and applies the parameters and the one or more values to different ones of the test methods. The device executes the different ones of the test methods, with the applied parameters and the applied one or more values, to generate results, and outputs or stores the results.

Abstract: A device receives text that includes data values, and parses the text to identify data types associated with the data values. The device generates, based on the data values and the data types, a graphical representation of the text that includes data cells corresponding to the data values, and provides the graphical representation for display. The device receives one or more selections of one or more data cells in the graphical representation, stores the one or more selections as a selection history, and provides the selection history for display.

Abstract: A computer-implemented method for generating a color map using a color space, the generating including selecting lightness points representing lightness values, generating a lightness plot based on the lightness points, the lightness plot non-linearly increasing from a minimum lightness value to a maximum lightness value, and selecting chromaticity points, where the chromaticity points are represented using a plurality of dimensions, and the chromaticity points representing chromaticity values. The method includes generating a chromaticity plot based on the chromaticity points, and associating chromaticity values along the chromaticity plot with respective lightness values along the lightness plot, the associating specifying a plurality of colors. The method also includes identifying an in-gamut range for an RGB representation of the plurality of colors, the RGB representation provided in an RGB color space, and converting the color map from the color space to the RGB color space.

Abstract: A device may include a processor and a memory. The processor may receive a request to link a model element, of a model, and a spatial element. The model, when executed, simulates behavior of a system, and the spatial element is a physical object or an object that is rendered for display in two or more dimensions. The processor may further receive information identifying the model element, receive information identifying the spatial element, and create a link between the identified model element and the identified spatial element based on the received request. The link may allow at least one of the model element to be identified based on identification of the spatial element, or the spatial element to be identified based on identification of the model element. The memory may store the link.

Abstract: A system and method determines an object's lifetime. An object lifecycle engine may work with an object oriented environment. As objects are created, an object graph may be constructed having one or more roots. A root record graph may be constructed, and edges of the root record graph may point in an opposite direction than the edges of the object graph. As objects, entities, and references are added, removed, or deleted from within the environment, the object graph and the root record graph may be updated. A root finder may search the root record graph to determine whether a given root record is no longer rooted. If a root record is no longer rooted, then the object associated with that root record may be determined to be unreachable and at the end of its lifetime. If the root finder search is performed when references are removed, then objects may be destroyed in a deterministic manner.

Abstract: A computer-readable memory device may include instructions to store data describing a state machine model including source states and destination states. The device may also include instructions to store, for each of the source states, a condition field identifying a condition upon which, when satisfied, the state machine model transitions from the source state to one of the destination states. The device may also include instructions to store, for each of source states, a destination field identifying the one of the destination states. Each of at least two of the source states may identify an identical destination state in the corresponding destination field. Each of at least two of the source states may identify an identical condition in the corresponding condition field.

Abstract: A system and method may generate executable models having message sending objects and message receiving objects. A message may include a fixed data payload, and the message may persist for only a determined time interval of a total execution or simulation time of model. Message queues may be established for the messages, and the queues may have attributes. The model may include a state-based portion having states and transitions. States may be configured to generate and send messages, and to receive and process messages. In addition, transitions may be guarded by particular messages. The system and method also may generate standalone code, such as source code, for the model. The standalone code may include code that establishes a message passing service to support the sending and receiving of messages.

Abstract: A device may receive information specifying a physical time delay of a computational node of a first computational graph. The first computational graph may include a group of computational nodes that are connected in a particular manner, and may represent at least a portion of a dynamic system. The device may further add an abstract node to a second computational graph based on the received information. The abstract node may correspond to the computational node and may implement the physical time delay when the second computational graph is executed. The second computational graph may include a group of abstract nodes that are connected in the particular manner. The device may also execute the second computational graph, and may obtain one or more behavioral characteristics of the at least the portion of the dynamic system based on executing the second computational graph.

Abstract: A device receives an initial model of a system and information that identifies a solving technique to be used to solve a mathematical problem associated with the initial model. The initial model includes an initial transfer function that describes a relationship between an input to and an output from the system. The device determines an error associated with the solving technique, resulting in an inaccurate solution to the mathematical problem. The device generates an adjusted model, based on the initial model and the error, that includes an adjusted transfer function, based on the initial transfer function, or an adjusted input to the system, based on the input to the system. The device applies the solving technique to the adjusted model, to generate a result that includes a more accurate solution to the mathematical problem than applying the solving technique to the initial model, and outputs or stores the result.