Finding Relevant Templates via the Principal Component Analysis

Conference paper

DOI: 10.1007/978-3-319-52234-0_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10145)
Cite this paper as:
Seladji Y. (2017) Finding Relevant Templates via the Principal Component Analysis. In: Bouajjani A., Monniaux D. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2017. Lecture Notes in Computer Science, vol 10145. Springer, Cham

Abstract

The polyhedral model is widely used for the static analysis of programs, thanks to its expressiveness but it is also time consuming. To cope with this problem, weak-polyhedral analysis have been developed which offer a good trade off between expressiveness and efficiency. Some of these analysis are based on templates which fixed the form of the program’s invariant. These templates are defined statically at the beginning of the analysis, without taking into account the dynamic of programs. Finding good templates is a difficult problem. In this article, we present a method that uses the Principal Component analysis to compute an interesting template. We demonstrate the relevancy of the obtained templates on several benchmarks.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.STIC LaboratoryUniversity of TlemcenTlemcenAlgeria

Personalised recommendations