| Year |
Citation |
Score |
| 2021 |
Kapur D, Lu D, Monagan M, Sun Y, Wang D. Algorithms for computing greatest common divisors of parametric multivariate polynomials Journal of Symbolic Computation. 102: 3-20. DOI: 10.1016/J.Jsc.2019.10.006 |
0.384 |
|
| 2019 |
Kapur D. Conditional Congruence Closure over Uninterpreted and Interpreted Symbols Journal of Systems Science & Complexity. 32: 317-355. DOI: 10.1007/S11424-019-8377-8 |
0.406 |
|
| 2017 |
Kapur D. Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm Journal of Systems Science & Complexity. 30: 196-233. DOI: 10.1007/S11424-017-6337-8 |
0.427 |
|
| 2015 |
Falke S, Kapur D. When is a formula a loop invariant? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9200: 264-286. DOI: 10.1007/978-3-319-23165-5_13 |
0.664 |
|
| 2013 |
Kapur D, Sun Y, Wang D. An efficient method for computing comprehensive Gröbner bases Journal of Symbolic Computation. 52: 124-142. DOI: 10.1016/J.Jsc.2012.05.015 |
0.46 |
|
| 2013 |
Kapur D, Sun Y, Wang D. An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system Journal of Symbolic Computation. 49: 27-44. DOI: 10.1016/J.Jsc.2011.12.015 |
0.338 |
|
| 2013 |
Zhang Z, Kapur D. On invariant checking Journal of Systems Science and Complexity. 26: 470-482. DOI: 10.1007/S11424-013-1296-1 |
0.446 |
|
| 2013 |
Zhao H, Zhan N, Kapur D. Synthesizing switching controllers for hybrid systems by generating invariants Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8051: 354-373. DOI: 10.1007/978-3-642-39698-4_22 |
0.321 |
|
| 2012 |
Falke S, Kapur D. Rewriting induction + linear arithmetic = decision procedure Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7364: 241-255. DOI: 10.1007/978-3-642-31365-3_20 |
0.669 |
|
| 2012 |
Falke S, Kapur D, Sinz C. Termination analysis of imperative programs using bitvector arithmetic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7152: 261-277. DOI: 10.1007/978-3-642-27705-4_21 |
0.628 |
|
| 2011 |
Falke S, Kapur D, Sinz C. Termination analysis of C programs using compiler intermediate languages Leibniz International Proceedings in Informatics, Lipics. 10: 41-50. DOI: 10.4230/LIPIcs.RTA.2011.41 |
0.558 |
|
| 2011 |
Kapur D, Sun Y, Wang D. Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 193-200. DOI: 10.1145/1993886.1993918 |
0.344 |
|
| 2011 |
Kapur D, Minimair M. Multivariate resultants in bernstein basis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6301: 60-85. DOI: 10.1007/978-3-642-21046-4_4 |
0.471 |
|
| 2010 |
Hendrix J, Kapur D, Meseguer J. Coverset induction with partiality and subsorts: A powerlist case study Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6172: 275-290. DOI: 10.1007/978-3-642-14052-5_20 |
0.368 |
|
| 2010 |
Falke S, Kapur D. Termination of context-sensitive rewriting with built-in numbers and collection data structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5979: 44-61. DOI: 10.1007/978-3-642-11999-6_4 |
0.663 |
|
| 2010 |
Marron M, Majumdar R, Stefanovic D, Kapur D. Shape analysis with reference set relations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5944: 247-262. DOI: 10.1007/978-3-642-11319-2_19 |
0.584 |
|
| 2009 |
Marron M, Kapur D, Hermenegildo M. Identification of logically related heap regions International Symposium On Memory Management, Ismm. 89-98. DOI: 10.1145/1542431.1542446 |
0.555 |
|
| 2009 |
Chtcherba AD, Kapur D, Minimair M. Cayley-Dixon projection operator for multi-univariate composed polynomials Journal of Symbolic Computation. 44: 972-999. DOI: 10.1016/J.Jsc.2008.07.007 |
0.788 |
|
| 2009 |
Falke S, Kapur D. Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures Electronic Notes in Theoretical Computer Science. 237: 75-90. DOI: 10.1016/J.Entcs.2009.03.036 |
0.688 |
|
| 2009 |
Kapur D, Cai Y. An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors Mathematics in Computer Science. 2: 601-634. DOI: 10.1007/S11786-009-0072-Z |
0.346 |
|
| 2009 |
Falke S, Kapur D. A term rewriting approach to the automated termination analysis of imperative programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5663: 277-293. DOI: 10.1007/978-3-642-02959-2_22 |
0.624 |
|
| 2008 |
Marron M, Hermenegildo M, Kapur D, Stefanovic D. Efficient context-sensitive shape analysis with graph based heap models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4959: 245-259. DOI: 10.1007/978-3-540-78791-4_17 |
0.599 |
|
| 2008 |
Falke S, Kapur D. Dependency pairs for rewriting with built-in numbers and semantic data structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5117: 94-109. DOI: 10.1007/978-3-540-70590-1_7 |
0.668 |
|
| 2007 |
Rodríguez-Carbonell E, Kapur D. Automatic generation of polynomial invariants of bounded degree using abstract interpretation Science of Computer Programming. 64: 54-75. DOI: 10.1016/J.Scico.2006.03.003 |
0.465 |
|
| 2007 |
Rodríguez-Carbonell E, Kapur D. Generating all polynomial invariants in simple loops Journal of Symbolic Computation. 42: 443-476. DOI: 10.1016/J.Jsc.2007.01.002 |
0.495 |
|
| 2007 |
Falke S, Kapur D. Dependency pairs for rewriting with non-free constructors Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4603: 426-442. |
0.651 |
|
| 2006 |
Kapur D. A quantifier-elimination based heuristic for automatically generating inductive assertions for programs Journal of Systems Science and Complexity. 19: 307-330. DOI: 10.1007/S11424-006-0307-X |
0.442 |
|
| 2006 |
Chtcherba AD, Kapur D. Conditions for determinantal formula for resultant of a polynomial system Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 2006: 55-62. |
0.799 |
|
| 2006 |
Falke S, Kapur D. Inductive decidability using implicit induction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4246: 45-59. |
0.641 |
|
| 2005 |
Chtcherba AD, Kapur D, Minimair M. Cayley-Dixon resultant matrices of multi-univariate composed polynomials Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3718: 125-137. DOI: 10.1007/11555964_11 |
0.795 |
|
| 2005 |
Rodríguez-Carbonell E, Kapur D. Program verification using automatic generation of invariants Lecture Notes in Computer Science. 3407: 325-340. |
0.386 |
|
| 2004 |
Chtcherba AD, Kapur D. Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation Journal of Symbolic Computation. 38: 915-958. DOI: 10.1016/J.Jsc.2003.12.001 |
0.802 |
|
| 2004 |
Chtcherba AD, Kapur D. Constructing Sylvester-type resultant matrices using the Dixon formulation Journal of Symbolic Computation. 38: 777-814. DOI: 10.1016/J.Jsc.2003.11.003 |
0.805 |
|
| 2004 |
Rodríguez-Carbonell E, Kapur D. An abstract interpretation approach for automatic generation of polynomial invariants Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3148: 280-295. |
0.353 |
|
| 2004 |
Chtcherba AD, Kapur D. Support hull: Relating the Cayley-Dixon resultant constructions to the support of a polynomial system Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 95-102. |
0.797 |
|
| 2004 |
Rodríguez-Carbonell E, Kapur D. Automatic generation of polynomial loop invariants: Algebraic foundations Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 266-273. |
0.402 |
|
| 2003 |
Chtcherba AD, Kapur D. On the relationship between the Dixon-based resultant construction and the supports of polynomial systems Acm Sigsam Bulletin. 37: 66-67. DOI: 10.1145/990353.990358 |
0.529 |
|
| 2003 |
Chtcherba AD, Kapur D. Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation Journal of Symbolic Computation. 36: 289-315. DOI: 10.1016/S0747-7171(03)00084-1 |
0.791 |
|
| 2003 |
Kapur D, Sakhanenko NA. Automatic generation of generalization lemmas for proving properties of tail-recursive definitions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2758: 136-154. |
0.369 |
|
| 2003 |
Kapur D, Subramaniam M. Automatic generation of simple lemmas from recursive definitions using decision procedures - Preliminary report Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2896: 125-145. |
0.337 |
|
| 2002 |
Chtcherba AD, Kapur D. On the efficiency and optimality of Dixon-based resultant methods Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 29-36. |
0.787 |
|
| 2000 |
Kapur D, Subramaniam M. Using an induction prover for verifying arithmetic circuits International Journal On Software Tools For Technology Transfer. 3: 32-65. DOI: 10.1007/Pl00010808 |
0.374 |
|
| 2000 |
Kapur D, Sivakumar G. Proving associative-commutative termination using RPO-compatible orderings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1761: 39-61. |
0.305 |
|
| 2000 |
Kapur D, Subramaniam M. Extending decision procedures with induction schemes Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1831: 324-345. |
0.315 |
|
| 1998 |
Krishna Rao MRK, Kapur D, Shyamasundar RK. Transformational methodology for proving termination of logic programs Journal of Logic Programming. 34. DOI: 10.1016/S0743-1066(97)00028-9 |
0.36 |
|
| 1998 |
Kapur D, Subramaniam M. Mechanizing reasoning about large finite tables in a rewrite based theorem prover Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1538: 22-42. DOI: 10.1007/3-540-49366-2_3 |
0.43 |
|
| 1997 |
Van Hentenryck P, Mcallester D, Kapur D. Solving polynomial systems using a branch and prune approach Siam Journal On Numerical Analysis. 34: 797-827. DOI: 10.1137/S0036142995281504 |
0.429 |
|
| 1996 |
Kapur D, Subramaniam M. New uses of linear arithmetic in automated theorem proving by induction Journal of Automated Reasoning. 16: 39-78. DOI: 10.1007/Bf00244459 |
0.469 |
|
| 1996 |
Kapur D, Subramaniam M. Lemma discovery in automating induction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1104: 538-552. DOI: 10.1007/3-540-61511-3_112 |
0.335 |
|
| 1996 |
Kapur D. Rewrite-based automated reasoning: Challenges ahead Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1103: 1-2. |
0.35 |
|
| 1996 |
Kapur D, Subramaniam M. Automating induction over mutually recursive functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1101: 117-131. |
0.357 |
|
| 1995 |
Kapur D, Zhang H. An overview of Rewrite Rule Laboratory (RRL) Computers and Mathematics With Applications. 29: 91-114. DOI: 10.1016/0898-1221(94)00218-A |
0.353 |
|
| 1995 |
Kapur D, Sivakumar G, Zhang H. A path ordering for proving termination of AC rewrite systems Journal of Automated Reasoning. 14: 293-316. DOI: 10.1007/Bf00881859 |
0.446 |
|
| 1995 |
Kapur D, Subramaniam M. Automated reasoning about parallel algorithms using powerlists Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 936: 416-430. DOI: 10.1007/3-540-60043-4_68 |
0.328 |
|
| 1994 |
Kapur D, Nie X, Musser DR. An overview of the Tecton proof system Theoretical Computer Science. 133: 307-339. DOI: 10.1016/0304-3975(94)90192-9 |
0.35 |
|
| 1992 |
Kapur D, Narendran P, Rosenkrantz DJ, Zhang H. Sufficient-completeness, ground-reducibility and their complexity International Journal of Biometeorology. 36: 311-350. DOI: 10.1007/Bf01893885 |
0.426 |
|
| 1992 |
Kapur D, Narendran P. Complexity of unification problems with associative-commutative operators Journal of Automated Reasoning. 9: 261-288. DOI: 10.1007/Bf00245463 |
0.356 |
|
| 1991 |
Kapur D, Narendran P, Zhang H. Automating inductionless induction using test sets Journal of Symbolic Computation. 11: 83-111. DOI: 10.1016/S0747-7171(08)80133-2 |
0.377 |
|
| 1990 |
Kapur D, Narendran P, Otto F. On ground-confluence of term rewriting systems Information and Computation. 86: 14-31. DOI: 10.1016/0890-5401(90)90023-B |
0.337 |
|
| 1990 |
Mohan CK, Srivas MK, Kapur D. Inference rules and proof procedures for inequations The Journal of Logic Programming. 9: 75-104. DOI: 10.1016/0743-1066(90)90034-3 |
0.402 |
|
| 1990 |
Zhang H, Kapur D. Unnecessary inferences in associative-commutative completion procedures Mathematical Systems Theory. 23: 175-206. DOI: 10.1007/Bf02090774 |
0.444 |
|
| 1988 |
Kandri-Rody Ä, Kapur D. Computing a Gröbner basis of a polynomial ideal over a Euclidean domain Journal of Symbolic Computation. 6: 37-57. DOI: 10.1016/S0747-7171(88)80020-8 |
0.39 |
|
| 1988 |
Kapur D, Musser DR, Narendran P. Only prime superpositions need be considered in the Knuth-Bendix completion procedure Journal of Symbolic Computation. 6: 19-36. DOI: 10.1016/S0747-7171(88)80019-1 |
0.39 |
|
| 1988 |
Kapur D, Srivas M. Computability and implementability issues in abstract data types Science of Computer Programming. 10: 33-63. DOI: 10.1016/0167-6423(88)90015-9 |
0.378 |
|
| 1988 |
Barry M, Cyrluk D, Kapur D, Mundy J, Nguyen VD. A multi-level geometric reasoning system for vision Artificial Intelligence. 37: 291-332. DOI: 10.1016/0004-3702(88)90058-6 |
0.347 |
|
| 1988 |
Kapur D. A refutational approach to geometry theorem proving Artificial Intelligence. 37: 61-93. DOI: 10.1016/0004-3702(88)90050-1 |
0.428 |
|
| 1988 |
Kapur D, Mundy JL. Wu's method and its application to perspective viewing Artificial Intelligence. 37: 15-36. DOI: 10.1016/0004-3702(88)90048-3 |
0.359 |
|
| 1988 |
Bürckert H, Herold A, Kapur D, Siekmann JH, Stickel ME, Tepp M, Zhang H. Opening the AC-unification race Journal of Automated Reasoning. 4: 465-474. DOI: 10.1007/Bf00297251 |
0.344 |
|
| 1988 |
Kapur D, Zhang H. Proving equivalence of different axiomatizations of free groups Journal of Automated Reasoning. 4: 331-352. DOI: 10.1007/Bf00244946 |
0.418 |
|
| 1987 |
Kapur D, Narendran P. Matching, unification and complexity Acm Sigsam Bulletin. 21: 6-9. DOI: 10.1145/36330.36332 |
0.413 |
|
| 1987 |
Kapur D, Musser DR. Proof by consistency Artificial Intelligence. 31: 125-157. DOI: 10.1016/0004-3702(87)90017-8 |
0.474 |
|
| 1987 |
Kapur D, Narendran P, Zhang H. On sufficient-completeness and related properties of term rewriting systems Acta Informatica. 24: 395-415. DOI: 10.1007/Bf00292110 |
0.4 |
|
| 1986 |
Kapur D. Using Gröbner bases to reason about geometry problems Journal of Symbolic Computation. 2: 399-408. DOI: 10.1016/S0747-7171(86)80007-4 |
0.389 |
|
| 1985 |
Kapur D, Sivakumar G. RRL: theorem proving environment based on rewriting techniques Acm Sigsoft Software Engineering Notes. 10: 67-68. DOI: 10.1145/1012497.1012522 |
0.304 |
|
| 1985 |
Kapur D, Narendran P. An equational approach to theorem proving in first-order predicate calculus Acm Sigsoft Software Engineering Notes. 10: 63-66. DOI: 10.1145/1012497.1012521 |
0.305 |
|
| 1985 |
Kapur D, Narendran P. The Knuth-Bendix Completion Procedure and Thue Systems Siam Journal On Computing. 14: 1052-1072. DOI: 10.1137/0214073 |
0.385 |
|
| 1985 |
Kapur D, Narendran P, Krishnamoorthy MS, McNaughton R. The Church-Rosser property and special Thue systems Theoretical Computer Science. 39: 123-133. DOI: 10.1016/0304-3975(85)90134-3 |
0.312 |
|
| 1985 |
Kapur D, Narendran P. A finite thue system with decidable word problem and without equivalent finite canonical system Theoretical Computer Science. 35: 337-344. DOI: 10.1016/0304-3975(85)90023-4 |
0.345 |
|
| 1983 |
Guttag JV, Kapur D, Musser DR. On Proving Uniform Termination and Restricted Termination of Rewriting Systems Siam Journal On Computing. 12: 189-214. DOI: 10.1137/0212012 |
0.447 |
|
| Show low-probability matches. |