Value-Flow-Based Demand-Driven Pointer Analysis for C and C++

Sui, Y; Xue, J

Value-Flow-Based Demand-Driven Pointer Analysis for C and C++

Sui, Y

Xue, J

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Software Engineering, 2018
Issue Date:: 2018-09-06

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted ManuscriptAdobe PDF (3.05 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Sui, Y https://orcid.org/0000-0002-9510-6574	en_US
dc.contributor.author	Xue, J	en_US
dc.date.available	2020-10-07T18:07:36Z
dc.date.issued	2018-09-06	en_US
dc.identifier.citation	IEEE Transactions on Software Engineering, 2018	en_US
dc.identifier.issn	0098-5589	en_US
dc.identifier.uri	http://hdl.handle.net/10453/131230
dc.description.abstract	IEEE We present SUPA, a value-flow-based demand-driven flow- and context-sensitive pointer analysis with strong updates for C and C++ programs. SUPA enables computing points-to information via value-flow refinement, in environments with small time and memory budgets. We formulate SUPA by solving a graph-reachability problem on an inter-procedural value-flow graph representing a program's def-use chains, which are pre-computed efficiently but over-approximately. To answer a client query (a request for a variable's points-to set), SUPA reasons about the flow of values along the pre-computed def-use chains sparsely (rather than across all program points), by performing only the work necessary for the query (rather than analyzing the whole program). In particular, strong updates are performed to filter out spurious def-use chains through value-flow refinement as long as the total budget is not exhausted.	en_US
dc.relation.ispartof	IEEE Transactions on Software Engineering	en_US
dc.relation.isbasedon	10.1109/TSE.2018.2869336	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	Software Engineering	en_US
dc.title	Value-Flow-Based Demand-Driven Pointer Analysis for C and C++	en_US
dc.type	Journal Article
utslib.for	0803 Computer Software	en_US
utslib.for	0806 Information Systems	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	open_access	*
pubs.publication-status	Published	en_US

Abstract:

IEEE We present SUPA, a value-flow-based demand-driven flow- and context-sensitive pointer analysis with strong updates for C and C++ programs. SUPA enables computing points-to information via value-flow refinement, in environments with small time and memory budgets. We formulate SUPA by solving a graph-reachability problem on an inter-procedural value-flow graph representing a program's def-use chains, which are pre-computed efficiently but over-approximately. To answer a client query (a request for a variable's points-to set), SUPA reasons about the flow of values along the pre-computed def-use chains sparsely (rather than across all program points), by performing only the work necessary for the query (rather than analyzing the whole program). In particular, strong updates are performed to filter out spurious def-use chains through value-flow refinement as long as the total budget is not exhausted.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/131230