Z. Manna and C. G. Zarba. Combining decision procedures. In Formal Methods 46 at the Cross Roads: From Panacea to Foundational Support, volume 2757 of Lecture Notes in Computer Science, pages 381--422. Springer, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Canonization for Disjoint Unions of Theories - Krstic, Conchon (2003) (2 citations) (Correct)
....veri cation tools based on combining decision procedures. In a recent survey [17] Shankar discusses the promise and success of such tools, stressing also the need for stronger theoretical support. Clarifying theoretical foundations of the area has become a subject of intensive research; the list [3, 9, 10, 18, 12, 7] is a sample from the spate of last year s publications. Much of this e ort, including the present paper, is devoted to the demysti cation of the Shostak method. Our contribution is in providing answers to two basic questions that have not as yet been adequately addressed. With Theorem 2 we con ....
Z. Manna and C. G. Zarba. Combining decision procedures. unpublished, 2002.
The Combination Problem in Automated Reasoning - Zarba (2004) Self-citation (Zarba) (Correct)
No context found.
Zohar Manna and Calogero G. Zarba. Combining decision procedures. In Armando Haeberer, editor, Formal Methods at the Cross Roads. From Panacea to Foundational Support, Lecture Notes in Computer Science, 2003. To appear.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) Self-citation (Zarba) (Correct)
No context found.
Zohar Manna and Calogero G. Zarba. Combining decision procedures. In Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science. Springer, 2003. To appear.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) Self-citation (Zarba) (Correct)
....phase is finitary. Thus, we only need to prove that our method is also partially correct. We will use the following theorem which is a special case of a more general combination result given in [15] for theories with possibly non disjoint signatures. A direct proof of this theorem can be found in [7]. Theorem 5.1 (Combination Theorem for Disjoint Signatures) Let # i be a set of # i formulae, for i = 1, 2, and let # 1 # 2 = #. Then # 1 # 2 is satisfiable if and only if there exists an interpretation satisfying # 1 and an interpretation satisfying # 2 such that: i) B , ....
Manna, Z. and C. G. Zarba, Combining decision procedures, in: Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science (2003), to appear.
Combining Non-Stably Infinite Theories - Tinelli, Zarba (2003) (1 citation) Self-citation (Zarba) (Correct)
....phase is finitary. Thus, we only need to prove that our method is partially correct. We will use the following theorem which is a special case of a more general combination result given in [TR03] for theories with possibly non disjoint signatures. A direct proof of this theorem can be found in [MZ03] Theorem 11 (Combination Theorem for Disjoint Signatures) Let # i be a set of # i formulae, for i = 1, 2, and let # 1 # 2 = #. Then # 1 # 2 is satisfiable if and only if there exists an interpretation satisfying # 1 and an interpretation satisfying # 2 such that: i) B , ....
Zohar Manna and Calogero G. Zarba. Combining decision procedures. In Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science. Springer, 2003. To appear.
Combining Non-Stably Infinite, Non-First Order Theories - Fontaine, Gribomont (2004) (Correct)
No context found.
Z. Manna and C. G. Zarba. Combining decision procedures. In Formal Methods 46 at the Cross Roads: From Panacea to Foundational Support, volume 2757 of Lecture Notes in Computer Science, pages 381--422. Springer, 2003.
Canonization for Disjoint Unions of Theories - Krstic, Conchon (2003) (2 citations) (Correct)
No context found.
Z. Manna and C. G. Zarba. Combining decision procedures. In Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science. Springer, 2003. To appear.
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