Automaton-Based array initialization analysis

Authors:
Đurica Nikolić;Fausto Spoto
Affiliations:
Dipartimento di Informatica, Università di Verona, Italy;Dipartimento di Informatica, Università di Verona, Italy
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 11
Cited 2

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Object-oriented type inference

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Systematic design of program transformation frameworks by abstract interpretation

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
What else is decidable about integer arrays?

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A parametric segmentation functor for fully automatic and scalable array content analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise null-pointer analysis

Software and Systems Modeling (SoSyM)
What's decidable about arrays?

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

Inferring complete initialization of arrays

Theoretical Computer Science
Reachability analysis of program variables

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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.