Alternating Automata Modulo First Order Theories

Abstract : We introduce first-order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first-order formulae, with states and internal variables given by uninterpreted predicate terms. The model is closed under union, intersection and complement, and its emptiness problem is undecidable, even for the simplest data theory of equality. To cope with the undecidability problem, we develop an abstraction refinement semi-algorithm based on lazy annotation of the symbolic execution paths with interpolants, obtained by applying (i) quantifier elimination with witness term generation and (ii) Lyndon interpolation in the quantifier-free theory of the data domain, with uninterpreted predicate symbols. This provides a method for checking inclusion of timed and finite-memory register automata, and emptiness of quantified predicate automata, previously used in the verification of parameter-ized concurrent programs, composed of replicated threads, with shared memory.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02387992
Contributor : Radu Iosif <>
Submitted on : Monday, December 2, 2019 - 11:00:51 AM
Last modification on : Friday, December 6, 2019 - 1:17:32 PM

File

final.pdf
Files produced by the author(s)

Identifiers

Citation

Radu Iosif, Xiao Xu. Alternating Automata Modulo First Order Theories. Computer Aided Verification - 31st International Conference, Jul 2019, New York, United States. pp.43-63, ⟨10.1007/978-3-030-25543-5_3⟩. ⟨hal-02387992⟩

Share

Metrics

Record views

32

Files downloads

30