Path-sensitive data flow analysis simplified

Winter, Kirsten, Zhang, Chenyi, Hayes, Ian J., Keynes, Nathan, Cifuentes, Cristina and Li, Lisa (2013). Path-sensitive data flow analysis simplified. In: Lindsay Groves and Jing Sun, Formal Methods and Software Engineering - 15th International Conference on Formal Engineering Methods, ICFEM 2013, Proceedings. 15th International Conference on Formal Engineering Methods, ICFEM 2013, Queenstown, New Zealand, (415-430). 29 October - 1 November 2013. doi:10.1007/978-3-642-41202-8_27

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Winter, Kirsten
Zhang, Chenyi
Hayes, Ian J.
Keynes, Nathan
Cifuentes, Cristina
Li, Lisa
Title of paper Path-sensitive data flow analysis simplified
Conference name 15th International Conference on Formal Engineering Methods, ICFEM 2013
Conference location Queenstown, New Zealand
Conference dates 29 October - 1 November 2013
Proceedings title Formal Methods and Software Engineering - 15th International Conference on Formal Engineering Methods, ICFEM 2013, Proceedings   Check publisher's open access policy
Journal name Lecture Notes in Computer Science   Check publisher's open access policy
Series Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Place of Publication Heidelberg, Germany
Publisher Springer
Publication Year 2013
Year available 2013
Sub-type Fully published paper
DOI 10.1007/978-3-642-41202-8_27
Open Access Status Not yet assessed
ISBN 9783642412011
9783642412028
ISSN 0302-9743
1611-3349
Editor Lindsay Groves
Jing Sun
Volume 8144
Start page 415
End page 430
Total pages 16
Language eng
Abstract/Summary Path-sensitive data flow analysis pairs classical data flow analysis with an analysis of feasibility of paths to improve precision. In this paper we propose a framework for path-sensitive backward data flow analysis that is enhanced with an abstraction of the predicate domain. The abstraction is based on a three-valued logic. It follows the strategy that path predicates are simplified if possible (without calling an external predicate solver) and every predicate that could not be reduced to a simple predicate is abstracted to the unknown value, for which the feasibility is undecided. The implementation of the framework scales well and delivers promising results.
Subjects 1700 Computer Science
2614 Theoretical Computer Science
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Conference Paper
Sub-type: Fully published paper
Collections: Official 2014 Collection
School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 3 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 3 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 24 Dec 2013, 10:21:30 EST by System User on behalf of School of Information Technol and Elec Engineering