Microsoft Technology Licensing, LLC

Other

Andrew Begel

Gina Danielle Venolia

Yit Phang Khoo

Reid T Holmes

Thomas Zimmermann

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

Instructions within an instruction set (such as source code for a software application) may be documented within many separate tools, such as a development environment, a version control system, and a bug report database. However, it may be inefficient to search for such information in many locations and through many interfaces while investigating the version history of an instruction. Instead, the development environment may be configured to retrieve relevant information (such as bug reports, versioning, and version release notes) and to display the version history information for a selected instruction together within the development environment.

Development environment integration with version history tools

In one embodiment of this invention, a computer system performs a method for colorizing concept keywords within program identifiers in source code. A computer system decomposes each identifier in the source code into one or more concept keywords The computer system determines a numerical value for each concept keyword based on the sequence of characters included in each concept keyword. The computer system assigns a color to each concept keyword based on the numerical value determined for each concept keyword.

Growing community of inventors

Seattle, WA, United States of America

Andrew Begel