Automata-based representations for arithmetic constraints in automated verification

Authors:
Constantinos Bartzis;Tevfik Bultan
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 4
Cited 0

Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results

ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint-Based Verification of Client-Server Protocols

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Comparison of Presburger Engines for EFSM Reachability

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Diophantine Equations, Presburger Arithmetic and Finite Automata

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss efficient symbolic representations for infinite-state systems specified using linear arithmetic constraints. We give new algorithms for constructing finite automata which represent integer sets that satisfy linear constraints. These automata can represent either signed or unsigned integers and have a lower number of states compared to other similar approaches. We experimentally compare different symbolic representations by using them to verify non-trivial specification examples. In many cases symbolic representations based on our construction algorithms outperform the polyhedral representation used in Omega Library, or the automata representation used in LASH.