Reachability-based acyclicity analysis by abstract interpretation

DOI10.1016/j.tcs.2012.12.018zbMath1259.68242arXiv1206.2188OpenAlexW2061213370MaRDI QIDQ1944776

Damiano Zanardini, Samir Genaim

Publication date: 27 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.2188

zbMATH Keywords

object-oriented programmingabstract interpretationacyclicity analysisheap manipulationtermination analysis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Abstract Program Slicing ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Inference of Field-Sensitive Reachability and Cyclicity

This page was built for publication: Reachability-based acyclicity analysis by abstract interpretation