Pair-sharing analysis of object-oriented programs determines those pairs of program variables bound at run-time to overlapping data structures. This information is useful for program parallelisation and analysis. We follow a similar construction for logic programming and formalise the property, or abstract domain, Sh of pair-sharing. We prove that Sh induces a Galois insertion wrt the concrete domain of program states. We define a compositional abstract semantics for the static analysis over Sh, and prove it correct.
Pair-Sharing Analysis of Object-Oriented Programs
SPOTO, Nicola Fausto
2005-01-01
Abstract
Pair-sharing analysis of object-oriented programs determines those pairs of program variables bound at run-time to overlapping data structures. This information is useful for program parallelisation and analysis. We follow a similar construction for logic programming and formalise the property, or abstract domain, Sh of pair-sharing. We prove that Sh induces a Galois insertion wrt the concrete domain of program states. We define a compositional abstract semantics for the static analysis over Sh, and prove it correct.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Pair-SharingAnalysisOfObjectOriented.pdf
solo utenti autorizzati
Tipologia:
Versione dell'editore
Licenza:
Accesso ristretto
Dimensione
368.53 kB
Formato
Adobe PDF
|
368.53 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
