A computerized method for analyzing the performance of an application, said application making communication function calls (1 to 6) between a plurality of processes, a call (1 to 6) or a succession of at least two calls (1 to 6) forming a pattern (7 to 11), the method being implemented by a computerized performance analysis system and comprising a step for collecting information relating to function calls (1 to 6), and a step for compressing the collected information, said compression step comprising: - a step for detecting patterns (7 to 11) and successions of patterns (7 to 11) from the collected information, to form a grammar wherein each pattern (7 to 11) and each succession of patterns (7 to 11) is identified by a unique identifier, - a step for detecting the repetition of patterns (7 to 11) and successions of patterns (7 to 11) in the grammar, - a step for generating a compressed log file wherein the patterns (7 to 11) and pattern successions (7 to 11) are stored, together with their respective numbers of repetitions (12 to 15), - generating a graph from the compressed log file, whereof the nodes (7 to 11) represent the patterns (7 to 11) ordered according to the chronology of the function calls (1 to 6) forming said patterns (7 to 11), the graph comprising a first category of edges, each edge (17 to 20) of said first category of edges connecting two nodes (7 to 11) corresponding to two successive patterns (7 to 11) according to the chronological order of the function calls (1 to 6) forming each of the two successive patterns (7 to 11); the graph comprising a second category of edges, each edge (12 to 15) of said second category of edges connecting two nodes (7 to 11) corresponding respectively to the beginning and end of a succession of patterns (7 to 11) which is repeated in the log file, or forming a loop on a node which repeats in the log file, each edge (12 to 15) of said second category of edges being assigned a weight (21 to 24) corresponding to the number of repetitions (21 to 24) of the corresponding succession of patterns (7 to 11) or of the corresponding pattern; - assigning to each node in the graph a weight proportional to the time spent in the function call or succession of calls corresponding to the node concerned; - analyzing application performance based on the graph and the weights assigned to the nodes and edges. a step for collecting information relating to function calls (1 to 6), and a step for compressing the collected information, said compression step comprising: - a step for detecting patterns (7 to 11) and successions of patterns (7 to 11) from the collected information, to form a grammar wherein each pattern (7 to 11) and each succession of patterns (7 to 11) is identified by a unique identifier, - a step for detecting the repetition of patterns (7 to 11) and successions of patterns (7 to 11) in the grammar, - a step for generating a compressed log file wherein the patterns (7 to 11) and pattern successions (7 to 11) are stored, together with their respective numbers of repetitions (12 to 15), - generating a graph from the compressed log file, whereof the nodes (7 to 11) represent the patterns (7 to 11) ordered according to the chronology of the function calls (1 to 6) forming said patterns (7 to 11), - a step for detecting patterns (7 to 11) and successions of patterns (7 to 11) from the collected information, to form a grammar wherein each pattern (7 to 11) and each succession of patterns (7 to 11) is identified by a unique identifier, - a step for detecting the repetition of patterns (7 to 11) and successions of patterns (7 to 11) in the grammar, - a step for generating a compressed log file wherein the patterns (7 to 11) and pattern successions (7 to 11) are stored, together with their respective numbers of repetitions (12 to 15), - generating a graph from the compressed log file, whereof the nodes (7 to 11) represent the patterns (7 to 11) ordered according to the chronology of the function calls (1 to 6) forming said patterns (7 to 11), the graph comprising a first category of edges, each edge (17 to 20) of said first category of edges connecting two nodes (7 to 11) corresponding to two successive patterns (7 to 11) according to the chronological order of the function calls (1 to 6) forming each of the two successive patterns (7 to 11); the graph comprising a second category of edges, each edge (12 to 15) of said second category of edges connecting two nodes (7 to 11) corresponding respectively to the beginning and end of a succession of patterns (7 to 11) which is repeated in the log file, or forming a loop on a node which repeats in the log file, each edge (12 to 15) of said second category of edges being assigned a weight (21 to 24) corresponding to the number of repetitions (21 to 24) of the corresponding succession of patterns (7 to 11) or of the corresponding pattern; - assigning to each node in the graph a weight proportional to the time spent in the function call or succession of calls corresponding to the node concerned; - analyzing application performance based on the graph and the weights assigned to the nodes and edges. - assigning to each node in the graph a weight proportional to the time spent in the function call or succession of calls corresponding to the node concerned; - analyzing application performance based on the graph and the weights assigned to the nodes and edges.