SVF: Interprocedural static value-flow analysis in LLVM

Sui, Y; Xue, J

SVF: Interprocedural static value-flow analysis in LLVM

Sui, Y

Xue, J

Permalink

Publisher:: ASSOC COMPUTING MACHINERY
Publication Type:: Conference Proceeding
Citation:: Proceedings of CC 2016: The 25th International Conference on Compiler Construction, 2016, pp. 265-266
Issue Date:: 2016-03-17

Recently Added

	Filename	Description	Size
	2-s2.0-84966565039 am Combined .pdf	Accepted Manuscript Version	817.4 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is new to OPUS and is not currently available.

Full metadata record

Field	Value	Language
dc.contributor.author	Sui, Y https://orcid.org/0000-0002-9510-6574
dc.contributor.author	Xue, J
dc.date	2016-03-17
dc.date.accessioned	2021-01-28T01:30:18Z
dc.date.available	2021-01-28T01:30:18Z
dc.date.issued	2016-03-17
dc.identifier.citation	Proceedings of CC 2016: The 25th International Conference on Compiler Construction, 2016, pp. 265-266
dc.identifier.isbn	9781450342414
dc.identifier.uri	http://hdl.handle.net/10453/145627
dc.description.abstract	© 2016 ACM. This paper presents SVF, a tool that enables scalable and precise interprocedural Static Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF, which is fully implemented in LLVM, allows value-flow construction and pointer analysis to be performed in an iterative manner, thereby providing increasingly improved precision for both. SVF accepts pointsto information generated by any pointer analysis (e.g., Andersen's analysis) and constructs an interprocedural memory SSA form, in which the def-use chains of both top-level and address-taken variables are captured. Such value-flows can be subsequently exploited to support various forms of program analysis or enable more precise pointer analysis (e.g., flow-sensitive analysis) to be performed sparsely. By dividing a pointer analysis into three loosely coupled components: Graph, Rules and Solver, SVF provides an extensible interface for users to write their own solutions easily. SVF is publicly available at http://unsw-corg.github.io/SVF.
dc.language	en
dc.publisher	ASSOC COMPUTING MACHINERY
dc.relation.ispartof	Proceedings of CC 2016: The 25th International Conference on Compiler Construction
dc.relation.ispartof	25th International Conference on Compiler Construction (CC)
dc.relation.isbasedon	10.1145/2892208.2892235
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.title	SVF: Interprocedural static value-flow analysis in LLVM
dc.type	Conference Proceeding
utslib.location.activity	Barcelona, SPAIN
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - AAII - Australian Artificial Intelligence Institute
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	recently_added	*
dc.date.updated	2021-01-28T01:29:29Z
pubs.finish-date	2016-03-18
pubs.publication-status	Published
pubs.start-date	2016-03-17

Abstract:

© 2016 ACM. This paper presents SVF, a tool that enables scalable and precise interprocedural Static Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF, which is fully implemented in LLVM, allows value-flow construction and pointer analysis to be performed in an iterative manner, thereby providing increasingly improved precision for both. SVF accepts pointsto information generated by any pointer analysis (e.g., Andersen's analysis) and constructs an interprocedural memory SSA form, in which the def-use chains of both top-level and address-taken variables are captured. Such value-flows can be subsequently exploited to support various forms of program analysis or enable more precise pointer analysis (e.g., flow-sensitive analysis) to be performed sparsely. By dividing a pointer analysis into three loosely coupled components: Graph, Rules and Solver, SVF provides an extensible interface for users to write their own solutions easily. SVF is publicly available at http://unsw-corg.github.io/SVF.

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

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