The design of static analyses of programs in the abstract interpretation theory starts with the choice of a collecting semantics, which is the strongest property we can derive for a program. Starting from well-known collecting semantics for functional programs in the literature, we propose a taxonomy of program properties by considering the sets of abstract interpretations for which the collecting semantics is initial and show that they can be constructively characterized in terms of the abstraction functions.
A Taxonomy of Program Analyses
Gianluca Amato
;Maria Chiara Meo
;Francesca Scozzari
2018-01-01
Abstract
The design of static analyses of programs in the abstract interpretation theory starts with the choice of a collecting semantics, which is the strongest property we can derive for a program. Starting from well-known collecting semantics for functional programs in the literature, we propose a taxonomy of program properties by considering the sets of abstract interpretations for which the collecting semantics is initial and show that they can be constructively characterized in terms of the abstraction functions.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ictcs18.pdf
accesso aperto
Tipologia:
PDF editoriale
Dimensione
469.35 kB
Formato
Adobe PDF
|
469.35 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
