Decision procedures for queues with integer constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 225-237

  Zhang, Ting ^a   Sipma, Henny B ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONSTRAINT THEORY; DECISION THEORY; INTEGER PROGRAMMING; NETWORK PROTOCOLS;

NELSON-OPPEN COMBINATION; PRESBURGER ARITHMETIC; QUANTIFIER-FREE THEORY; SYNCHRONIZATION MECHANISM;

QUEUEING NETWORKS;

EID: 33744902881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_18     Document Type: Conference Paper

References (14)

1. Michael Benedikt, Leonid Libkin, Thomas Schwentick, and Luc Segoufin. A model-theoretic approach to regular string relations. In Proceedings of 16th IEEE Symposium on Logic in Computer Science (LICS'01), pages 431-440. IEEE Computer Society Press, 2001.
2. Nikolaj S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University, November 1998.
3. D. C. Cooper. Theorem proving in arithmetic without multiplication. In Machine Intelligence, volume 7, pages 91-99. American Elsevier, 1972.
4. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 2001.
5. Wilfrid Hodges. Model Theory. Cambridge University Press, Cambridge, UK, 1993.
6. Felix Klaedtke and Harald Rueß. Monadic second-order logics with cardinalities. In 30th International Colloquium on Automata, Languages and Programming (1CALP'03), volume 2719 of LNCS. Springer-Verlag, 2003.
7. M. Lothaire. Combinatorics on Words. Addison-Wesley, Massachusetts, USA, 1983.
8. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transaction on Programming Languages and Systems, 1(2):245-257, October 1979.
9. C. R. Reddy and D. W. Loveland. Presburger arithmetic with bounded quantifier alternation. In Proceedings of the 10th Annual Symposium on Theory of Computing (STOC'78), pages 320-325. ACM Press, 1978.
10. Tatiana Rybina and Andrei Voronkov. A decision procedure for term algebras with queues. In Proceedings of 15th IEEE Symposium on Logic in Computer Science (LICS'00), pages 279 - 290. IEEE Computer Society Press, 2000.
11. Tatiana Rybina and Andrei Voronkov. Upper bounds for a theory of queues. In Proceedings of 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of LNCS, pages 714-724, Springer-Verlag, 2003.
12. Wolfgang Thomas. Infinite trees and automaton-definable relations over ω-words. Theoretical Computer Science, 103:143-159, 1992.
13. Ting Zhang, Henny B. Sipma, and Zohar Manna. Decision procedures for recursive data structures with Integer constraints. In the 2nd International Joint Conference on Automated Reasoning (IJCAR'04), volume 3097 of LNCS, pages 152-167. Springer-Verlag, 2004.
14. Ting Zhang, Henny B. Sipma, and Zohar Manna. Term algebras with length function and bounded quantifier alternation. In the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'04), volume 3223 of LNCS, pages 321-336. Springer-Verlag, 2004.