Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation
Data(s) |
2013
|
---|---|
Resumo |
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. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/50287/1/sta_ana_1935_259_2013.pdf 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. |
Publicador |
SPRINGER-VERLAG BERLIN |
Relação |
http://dx.doi.org/ 10.1007/978-3-642-38856-9_15 http://eprints.iisc.ernet.in/50287/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Conference Proceedings NonPeerReviewed |