Abstract
We define an automaton-based abstract interpretation of a trace semantics which identifies loops that definitely initialize all the elements of an array, a useful piece of information for the static analysis of imperative languages. This results in a fully automatic and fast analysis, that does not use manual code annotations. Its implementation inside the Julia analyzer is efficient and precise. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Nikolić, D., & Spoto, F. (2012). Automaton-based array initialization analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 420–432). https://doi.org/10.1007/978-3-642-28332-1_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
