Reachability analysis of procedural programs with affine integer arithmetic

Authors:
Michael Luttenberger
Affiliations:
Institute for Formal Methods in Computer Science, University of Stuttgart
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 3
Cited 1

On the Construction of Automata from Linear Arithmetic Constraints

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Weighted pushdown systems and their application to interprocedural dataflow analysis

SAS'03 Proceedings of the 10th international conference on Static analysis
Reachability analysis of procedural programs with affine integer arithmetic

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Reachability analysis of procedural programs with affine integer arithmetic

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a tool for reachability analysis of procedural programs whose statements consist of affine equations and inequations. We use finite automata for representing the possibly infinite sets of stack configurations and memory valuations.