Ting Zhang, Henny B. Sipma, Zohar Manna  Home/Search
Context Related
| stanford.edu/~tingz/papers...ijcar04.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~tingz/papers/ijc... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus providing a tight coupling between the two theories, and hence the general Nelson-Oppen combination method for decision procedures is not applicable to this theory, even for the quanti er-free case. We present four decision procedures for the integrated theory depending on whether the language has in nitely many... (Update)
Similar documents based on text: More All
0.9: Decision Procedures for Recursive Data Structures with.. - Zhang, Sipma, Manna (2004) (Correct)
0.7: Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (Correct)
0.6: Deductive Modelchecking - Sipma (1999) (Correct)
BibTeX entry: (Update)
Ting Zhang, Henny Sipma, and Zohar Manna. Decision procedures for recursive data structures with integer constraints, 2004. To appear in the Proceedings of the 2nd International Joint Conference on Automated Reasoning. http://citeseer.ist.psu.edu/zhang04decision.html More
@misc{ zhang04decision,
author = "T. Zhang and H. Sipma and Z. Manna",
title = "Decision procedures for recursive data structures with integer constraints",
text = "Ting Zhang, Henny Sipma, and Zohar Manna. Decision procedures for recursive
data structures with integer constraints, 2004. To appear in the Proceedings
of the 2nd International Joint Conference on Automated Reasoning.",
year = "2004",
url = "citeseer.ist.psu.edu/zhang04decision.html" }
Citations (may not include all citations):370 A Mathematical Introduction to Logic (context) - Enderton - 2001
133 Cambridge University Press (context) - Hodges - 1993
111 Fast decision procedures based on congruence closure (context) - Nelson, Oppen - 1980
105 The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
82 Variations of the common subexpression problem (context) - Downey, Sethi et al. - 1980
59 Simpli cation by cooperating decision procedures (context) - Nelson, Oppen - 1979
43 Theorem proving in arithmetic without multiplication (context) - Cooper - 1972
43 The Computational Complexity of Logical Theories (context) - Ferrante, Racko - 1979
31 Decidability of the purely existential fragment of the theor.. (context) - Venkataraman - 1987
26 A uniform method for proving lower bounds on the computation.. (context) - Compton, Henson - 1990
18 Complete axiomatizations of the algebras of nite (context) - Maher - 1988
15 A decision procedure for term algebras with queues - Rybina, Voronkov - 2001
14 Integrating Decision Procedures for Temporal Veri cation (context) - Bj - 1998
14 Axiomatizable classes of locally free algebras of various ty.. (context) - Mal'cev - 1971
9 Combining sets with integers - Zarba - 2002
[Article contains additional citations not shown here]
Documents on the same site (http://theory.stanford.edu/~tingz/papers/ijcar04/):
Decision Procedures for Recursive Data Structures with.. - Zhang, Sipma, Manna (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC