MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Deepak Kapur – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

61 documents found, showing 1 through 10. Next 10 →

ATOM

An Approach for Solving Systems of Parametric Polynomial Equations
by Deepak Kapur — 1993
…1 An Approach for Solving Systems of Parametric Polynomial Equations Deepak Kapur 1 1.1 Abstract…
Cited by 5 (2 self) – Add To MetaCart

Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets
by Deepak Kapur — 1996 — Automated Deduction in Geometry, volume 1360 of Lecture
…Automated Geometric Reasoning: Dixon Resultants, Grobner Bases, and Characteristic Sets Deepak…
Cited by 6 (0 self) – Add To MetaCart

Theorem Proving Support for Hardware Verification
by Deepak Kapur — 2000 — Third Int Workshop on First-Order Theorem Proving
…Theorem Proving Support for Hardware Verication |Preliminary Draft| Deepak Kapur ? Department…
Cited by 4 (0 self) – Add To MetaCart

Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic
by Deepak Kapur — 2001 — Symbolic-Algebraic Methods and Verification Methods — Theory and Applications
…Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic Deepak Kapur…
Cited by 1 (1 self) – Add To MetaCart

Rewriting, decision procedures and lemma speculation for automated hardware verification
by Deepak Kapur — 1997 — Proc. 10th Intl. Conf. Theorem Proving in Higher Order Logics, LNCS 1275
…Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification Deepak…
Cited by 4 (3 self) – Add To MetaCart

Automatically Generating Loop Invariants Using Quantifier Elimination
by Deepak Kapur — 2004 — In IMACS Intl. Conf. on Applications of Computer Algebra
…– Deepak Kapur Abstract. An approach for automatically generating loop invariants using quantifier…
Cited by 13 (0 self) – Add To MetaCart

Constructors Can Be Partial, Too
by Deepak Kapur — 1997
…8 Constructors Can Be Partial, Too Deepak Kapur 1 State University of New York at Albany 8…
Cited by 6 (1 self) – Add To MetaCart

Shostak's Congruence Closure as Completion
by Deepak Kapur — 1997 — Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science
…Shostak's Congruence Closure as Completion Deepak Kapur ? Department of Computer Science State…
Cited by 28 (3 self) – Add To MetaCart

Lemma Discovery in Automating Induction
by Deepak Kapur, M. Subramaniam — 1996 — 13th International Conference on Automated Deduction (CADE-13
…Lemma Discovery in Automating Induction Deepak Kapur M. Subramaniam Computer Science Department…
Cited by 15 (1 self) – Add To MetaCart

Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures
by Deepak Kapur, M. Subramaniam — 2003 — Proc. ASIAN 2003, LNCS
… ⋆ — Preliminary Report — Deepak Kapur 1 and M. Subramaniam 2 1 Department of Computer Science, University of New…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB