Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation

Komondoor, Raghavan (2013) Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation. In: 20th International Static Analysis Symposium (SAS), JUN 20-22, 2013, Seattle, WA, pp. 259-282.

PDF sta_ana_1935_259_2013.pdf - Published Version Restricted to Registered users only Download (393kB) | Request a copy

Abstract

We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked to the power of the given abstract lattice. We address pointers in a first-class manner, including when they are used within loops to traverse and update recursive data structures. Finally, we illustrate the comparative precision of our slices over those of previous approaches using representative examples.

Item Type:	Conference Proceedings
Series.:	Lecture Notes in Computer Science
Publisher:	SPRINGER-VERLAG BERLIN
Additional Information:	Copy right for this article belongs to the SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	14 Nov 2014 07:30
Last Modified:	14 Nov 2014 07:30
URI:	http://eprints.iisc.ac.in/id/eprint/50287

Actions (login required)

View Item