Amazon Technologies, Inc.

Aritra Sengupta

Lee Pike

Martin Schaef

Nicolas Leandro Rosner

Willem Conradie Visser

Linghui Luo

Antonio Filieri

Thomas L J Cottenier

A partitioning technique is applied to divide input code into different portions. Different partitioning techniques can be applied in order to optimize the portioning of the code to account for various features of the code, such as code dependencies. Once partitioned, the code analysis tasks execute in parallel on the code portions. In this way, improved code analysis performance is obtained. Moreover, the addition of new code analysis tasks may not impact overall analysis performance as the partitioning can help to offset added or unknown analysis latency of new code analysis tasks.

Partitioning code bases for parallel execution of code analysis

Techniques for visualizing dependent relationships in computer program analysis trace elements are described. A code analysis service analyzes computer code associated with a software application for at least one of errors or policy violations. The service outputs a trace log identifying a path within the computer code that results in an error or policy violation. The trace log includes a set of trace elements each corresponding to a line of the computer code. The output is displayed as a tree data structure including nodes. The nodes may include indentations indicating dependent relationships between and among variables initialized at lines in the computer code corresponding to the nodes. Alternatively, the nodes may be arranged as a hierarchy with edges connecting adjacent nodes, and nodes at different levels indicating dependent relationships. The tree data structure may include annotations providing additional contextual information about the actions performed at each node.

Visualizing dependent relationships in computer program analysis trace elements

Growing community of inventors

Mountain View, CA, United States of America

Aritra Sengupta