Field-sensitive value analysis by field-insensitive analysis

Elvira Albert; Puri Arenas; Samir Genaim; Germán Puebla

doi:10.1007/978-3-642-05089-3_24

Field-sensitive value analysis by field-insensitive analysis

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as non-heap allocated variables. Then, we present a static analysis to infer which numeric fields satisfy these conditions at the level of (sequential) bytecode. This allows instrumenting the code with ghost variables which make such numeric fields observable to any field-insensitive value analysis. Our experimental results in termination analysis show that we greatly enlarge the class of analyzable programs with a reasonable overhead.

Original language	English
Title of host publication	FM 2009
Subtitle of host publication	Formal Methods - Second World Congress, Proceedings
Pages	370-386
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-05089-3_24
State	Published - 2 Dec 2009
Externally published	Yes
Event	2nd World Congress on Formal Methods, FM 2009 - Eindhoven, Netherlands Duration: 2 Nov 2009 → 6 Nov 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5850 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd World Congress on Formal Methods, FM 2009
Country/Territory	Netherlands
City	Eindhoven
Period	2/11/09 → 6/11/09

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-05089-3_24

Cite this

Albert, E., Arenas, P., Genaim, S., & Puebla, G. (2009). Field-sensitive value analysis by field-insensitive analysis. In FM 2009: Formal Methods - Second World Congress, Proceedings (pp. 370-386). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5850 LNCS). https://doi.org/10.1007/978-3-642-05089-3_24

@inproceedings{5b0f672b035c4f4ebcf99c6601d7c791,

title = "Field-sensitive value analysis by field-insensitive analysis",

abstract = "Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as non-heap allocated variables. Then, we present a static analysis to infer which numeric fields satisfy these conditions at the level of (sequential) bytecode. This allows instrumenting the code with ghost variables which make such numeric fields observable to any field-insensitive value analysis. Our experimental results in termination analysis show that we greatly enlarge the class of analyzable programs with a reasonable overhead.",

author = "Elvira Albert and Puri Arenas and Samir Genaim and Germ{\'a}n Puebla",

year = "2009",

month = dec,

day = "2",

doi = "10.1007/978-3-642-05089-3\_24",

language = "English",

isbn = "3642050883",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "370--386",

booktitle = "FM 2009",

note = "2nd World Congress on Formal Methods, FM 2009 ; Conference date: 02-11-2009 Through 06-11-2009",

}

Albert, E, Arenas, P, Genaim, S & Puebla, G 2009, Field-sensitive value analysis by field-insensitive analysis. in FM 2009: Formal Methods - Second World Congress, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5850 LNCS, pp. 370-386, 2nd World Congress on Formal Methods, FM 2009, Eindhoven, Netherlands, 2/11/09. https://doi.org/10.1007/978-3-642-05089-3_24

Field-sensitive value analysis by field-insensitive analysis. / Albert, Elvira; Arenas, Puri; Genaim, Samir et al.
FM 2009: Formal Methods - Second World Congress, Proceedings. 2009. p. 370-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5850 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Field-sensitive value analysis by field-insensitive analysis

AU - Albert, Elvira

AU - Arenas, Puri

AU - Genaim, Samir

AU - Puebla, Germán

PY - 2009/12/2

Y1 - 2009/12/2

N2 - Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as non-heap allocated variables. Then, we present a static analysis to infer which numeric fields satisfy these conditions at the level of (sequential) bytecode. This allows instrumenting the code with ghost variables which make such numeric fields observable to any field-insensitive value analysis. Our experimental results in termination analysis show that we greatly enlarge the class of analyzable programs with a reasonable overhead.

AB - Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as non-heap allocated variables. Then, we present a static analysis to infer which numeric fields satisfy these conditions at the level of (sequential) bytecode. This allows instrumenting the code with ghost variables which make such numeric fields observable to any field-insensitive value analysis. Our experimental results in termination analysis show that we greatly enlarge the class of analyzable programs with a reasonable overhead.

UR - https://www.scopus.com/pages/publications/70649091063

U2 - 10.1007/978-3-642-05089-3_24

DO - 10.1007/978-3-642-05089-3_24

M3 - Conference contribution

AN - SCOPUS:70649091063

SN - 3642050883

SN - 9783642050886

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 370

EP - 386

BT - FM 2009

T2 - 2nd World Congress on Formal Methods, FM 2009

Y2 - 2 November 2009 through 6 November 2009

ER -

Field-sensitive value analysis by field-insensitive analysis

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this