Universal First-Order Quantification over Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Universal First-Order Quantification over Automata

Bernard Boigelot
Baptiste Vergain

Résumé

Deciding formulas that mix arithmetic and uninterpreted predicates is of practical interest, notably for applications in verication. Some decision procedures consist in building by structural induction an automaton that recognizes the set of models of the formula under analysis, and then testing whether this automaton accepts a non-empty language. A drawback is that universal quantication is usually handled by a reduction to existential quantication and complementation. For logical formalisms in which models are encoded as innite words, this hinders the practical use of this method due to the diculty of complementing innite-word automata. The contribution of this paper is to introduce an algorithm for directly computing the eect of universal rst-order quantiers on automata recognizing sets of models, for formulas involving natural numbers encoded in unary notation. This paves the way to implementable decision procedures for various arithmetic theories.
Fichier principal
Vignette du fichier
paper.pdf (309.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04317399 , version 1 (01-12-2023)

Licence

Paternité

Identifiants

Citer

Bernard Boigelot, Pascal Fontaine, Baptiste Vergain. Universal First-Order Quantification over Automata. EMU 2023 - 27th International Conference on Implementation and Application of Automata, Eastern Mediterranean University, Sep 2023, Famagusta, Cyprus. pp.91-102, ⟨10.1007/978-3-031-40247-0_6⟩. ⟨hal-04317399⟩
20 Consultations
10 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More