Infinite trees and automaton-definable relations over &ohgr;-words
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Decision Procedure for Term Algebras with Queues
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Presburger arithmetic with bounded quantifier alternation
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Model-Theoretic Approach to Regular String Relations
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Integrating decision procedures for temporal verification
Integrating decision procedures for temporal verification
Monadic second-order logics with cardinalities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
Incremental Benchmarks for Software Verification Tools and Techniques
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Arithmetic strengthening for shape analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
| Hi-index | 0.00 |
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.