Decision Procedures for Queues with Integer Constraints
Queues are a widely used data structure in programming languages. They also provide an important synchronization mechanism in modeling distributed protocols. In this paper we extend the theory of queues with a length function that maps a queue to its size, resulting in a combined theory of queues and Presburger arithmetic. This extension provides a natural but tight coupling between the two theories, and hence the general Nelson-Oppen combination method for decision procedures is not applicable. We present a decision procedure for the quantifier-free theory and a quantifier elimination procedure for the first-order theory that can remove a block of existential quantifiers in one step.
KeywordsDecision Procedure Integer Variable Length Function Elimination Procedure Satisfying Assignment
Unable to display preview. Download preview PDF.
- 2.Bjørner, N.S.: Integrating Decision Procedures for Temporal Verification. Ph.D thesis, Computer Science Department, Stanford University (November 1998)Google Scholar
- 3.Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Machine Intelligence, vol. 7, pp. 91–99. American Elsevier, Amsterdam (1972)Google Scholar
- 10.Rybina, T., Voronkov, A.: A decision procedure for term algebras with queues. In: Proceedings of 15th IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 279–290. IEEE Computer Society Press, Los Alamitos (2000)Google Scholar