The Mathworks, Inc.

Other

Yit Phang Khoo

Srinath Avadhanula

Krishna Balasubramanian

John P Dirner

Kalyan Bemalkhedkar

Pieter Johannes Mosterman

Ebrahim Mehran Mestchian

Gina Danielle Venolia

Vijaya Raghavan

Mahesh Nanjundappa

S M Shahed Nejhum

David B Andrade

Andrew Begel

Thomas Zimmermann

Jean-François Kempf

Gregg P Smith

Systems and methods evaluate assessments on time-series data. An expression including temporal operators may be created for an assessment. The expression may be arranged in the form of an expression tree having nodes representing input data to the assessment and intermediate results of the expression. An assessment may be evaluated by performing a bottom-up traversal of the expression tree. One or more plots may be generated including a plot of the outcome of the assessment, e.g., pass, fail, or untested, plots of intermediate results of the expression and plots of input data as a function of time. Graphical affordance may be presented on the plots that mark the regions that may have contributed to a specific pass or fail result of the assessment, and points within the regions that resulted in the assessment passing or failing.

Systems and methods for evaluating assessments

Systems and methods automatically construct a harness model having a selected component from source model. The systems and methods determine an execution context of the component in the source model, and construct and configure the harness model to provide the same or an equivalent execution context in the harness model. Model elements may be added to the harness model, and the model elements may be configured to replicate the execution context. The harness model may be executed, and the operation of the component evaluated. Changes to the component are synchronized between the source model and the harness model, as are changes to the component's execution context. Assessment operations may be included in the harness model, and these assessment operations may be evaluated when the harness model is executed. A verification report that includes the results of the assessments may be generated.

Systems and methods for creating harness models for model verification

A model of a state machine may be created in a modeling environment, and the model may be executed over a simulation time. A duration operator may be defined within the model. The duration operator may include as an input argument, a conditional expression that may evaluate to True or False. During execution, the modeling environment may define a plurality of time steps over the course of the model's simulation time. The conditional expression of the duration operator may be evaluated at the time steps. When the conditional expression evaluates to True, the modeling environment may begin tracking elapsed simulation time, and may continue to track elapsed simulation time while the conditional expression remains True. The value of elapsed simulation time may be made available to other portions of the model.

Conditional-based duration logic

A device may receive a chart generated via a technical computing environment, where the chart includes a textual portion and a graphical portion, and the graphical portion includes state information. The device may parse the chart into the textual portion and the graphical portion, and may process the textual portion with a textual engine of the technical computing environment to generate textual results. The device may process the graphical portion with a graphical engine of the technical computing environment to generate graphical results, and may combine the textual results with the graphical results to generate chart results. The device may output or store the chart results.

Resolution of textual code in a graphical hierarchical model of a technical computing environment

Software development items can be represented in a graph data structure. Relationships between the represented items can be detected and reflected in the graph data structure. Queries can be run against the data structure to determine which software development items are related to each other. Implicit query can be implemented in a software development context. A graph browser can present panes showing related items. In some embodiments, a set of regular expressions can be used to identify paths in a graph. Probability scores for the identified paths can be computed. Path data for the identified paths, including the probability scores, can be stored in a searchable location accessible by one or more applications. A query of the path data can be processed to return query results associated with at least one of the identified paths.

Discovering and exploiting relationships in software repositories

Growing community of inventors

Natick, MA, United States of America

Yit Phang Khoo