Abstract
In software verification it is often required to prove statements about heterogeneous domains containing elements of various sorts, such as counters, stacks, lists, trees and queues. Any domain with counters, stacks, lists, and trees (but not queues) can be easily seen a special case of the term algebra, and hence a decision procedure for term algebras can be applied to decide the first-order theory of such a domain. We present a quantifier-elimination procedure for the first-order theory of term algebra extended with queues. The complete axiomatization and decidability of this theory can be immediately derived from the procedure.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference24 articles.
1. BELEGRADEK O. 1988a. Model theory of locally free algebras (in Russian). In Model Theory and its Applications. Trudy Instituta Matematiki vol. 8. Nauka Novosibirsk 3-24. English summary in {Belegradek 1988b}.
2. BELEGRADEK O. 1988b. Some model theory of locally free algebras (in Russian). In 6th Easter Conference on Model Theory B. Dahn and H. Wolter Eds. Humboldt University Berlin 28-32.
3. BERMAN L. 1980. The complexity of logical theories. Theoretical Computer Science 11 71- 77.
4. BJORNER N. 1998. Reactive verification with queues. In ARO/ONR/NSF/DARPA Workshop on Engineering Automation for Computer-Based Systems. Carmel CA 1-8.
5. BJORNER N. 2000. Integrating decision procedures for temporal verification. Ph.D. thesis Stanford University.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献