The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Deepak Kapur: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Deepak Kapur, Paliath Narendran
    NP-Completeness of the Set Unification and Matching Problems. [Citation Graph (2, 0)][DBLP]
    CADE, 1986, pp:489-495 [Conf]
  2. Deepak Kapur, Mandayam K. Srivas
    A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:188-207 [Conf]
  3. Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur
    Using Elimination Methods to Compute Thermophysical Algebraic Invariants from Infrared Imagery. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 2, 1996, pp:1110-1115 [Conf]
  4. Deepak Kapur
    Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets. [Citation Graph (0, 0)][DBLP]
    Automated Deduction in Geometry, 1996, pp:1-36 [Conf]
  5. R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur
    Rewriting Concepts in the Study of Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ALPUK, 1992, pp:3-20 [Conf]
  6. Deepak Kapur, Mahadevan Subramaniam
    Automated Reasoning About Parallel Algorithms Using Powerlists. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:416-430 [Conf]
  7. Deepak Kapur, Mahadevan Subramaniam
    Automating Induction over Mutually Recursive Functions. [Citation Graph (0, 0)][DBLP]
    AMAST, 1996, pp:117-131 [Conf]
  8. Deepak Kapur, Mahadevan Subramaniam
    Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2003, pp:125-145 [Conf]
  9. Deepak Kapur, Mahadevan Subramaniam
    Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:22-42 [Conf]
  10. Deepak Kapur, Paliath Narendran, Lida Wang
    A Unification Algorithm for Analysis of Protocols with Blinded Signatures. [Citation Graph (0, 0)][DBLP]
    Mechanizing Mathematical Reasoning, 2005, pp:433-451 [Conf]
  11. Deepak Kapur, Hantao Zhang
    A Case Study of the Completion Procedure: Proving Ring Commutativity Problems. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:360-394 [Conf]
  12. David Cyrluk, Richard M. Harris, Deepak Kapur
    GEOMETER: A Theorem Prover for Algebraic Geometry. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:770-771 [Conf]
  13. Jürgen Giesl, Deepak Kapur
    Decidable Classes of Inductive Theorems. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:469-484 [Conf]
  14. Jürgen Giesl, Deepak Kapur
    Deciding Inductive Validity of Equations. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:17-31 [Conf]
  15. Deepak Kapur, Balakrishnan Krishnamurthy
    A Natural Proof System Based on rewriting Techniques. [Citation Graph (0, 0)][DBLP]
    CADE, 1984, pp:53-64 [Conf]
  16. Deepak Kapur, Paliath Narendran, Hantao Zhang
    Proof by Induction Using Test Sets. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:99-117 [Conf]
  17. Deepak Kapur, Mahadevan Subramaniam
    Extending Decision Procedures with Induction Schemes. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:324-345 [Conf]
  18. Deepak Kapur, Mahadevan Subramaniam
    Lemma Discovery in Automated Induction. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:538-552 [Conf]
  19. Deepak Kapur, G. Sivakumar, Hantao Zhang
    RRL: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:691-692 [Conf]
  20. Deepak Kapur, Hantao Zhang
    RRL: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:768-769 [Conf]
  21. Hantao Zhang, Deepak Kapur
    First-Order Theorem Proving Using Conditional Rewrite Rules. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:1-20 [Conf]
  22. Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy
    A Mechanizable Induction Principle for Equational Specifications. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:162-181 [Conf]
  23. Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair
    Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials. [Citation Graph (0, 0)][DBLP]
    CASC, 2005, pp:125-137 [Conf]
  24. Deepak Kapur, Mahadevan Subramaniam
    Mechanically Verifying a Family of Multiplier Circuits. [Citation Graph (0, 0)][DBLP]
    CAV, 1996, pp:135-146 [Conf]
  25. Sreenivasa Viswanadha, Deepak Kapur
    IBDL: A Language for Interface Behavior Specification and Testing. [Citation Graph (0, 0)][DBLP]
    COOTS, 1998, pp:235-248 [Conf]
  26. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
    A Transformational Methodology for Proving Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:213-226 [Conf]
  27. Deepak Kapur
    Automatically Generating Loop Invariants Using Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    Deduction and Applications, 2005, pp:- [Conf]
  28. Deepak Kapur, David R. Musser, Xumin Nie
    The Tecton Proof System. [Citation Graph (0, 0)][DBLP]
    Formal Methods in Databases and Software Engineering, 1992, pp:54-79 [Conf]
  29. David R. Musser, Deepak Kapur
    Rewrite Rule Theory and Abstract Data Type Analysis. [Citation Graph (0, 0)][DBLP]
    EUROCAM, 1982, pp:77-90 [Conf]
  30. Abdelilah Kandri-Rody, Deepak Kapur
    Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1984, pp:195-206 [Conf]
  31. Deepak Kapur, David R. Musser, Alexander A. Stepanov
    Tecton: A Language for Manipulating Generic Objects. [Citation Graph (0, 0)][DBLP]
    Program Specification, 1981, pp:402-414 [Conf]
  32. John Cochran, Deepak Kapur, Darko Stefanovic
    Model Checking Reconfigurable Processor Configurations for Safety Properties. [Citation Graph (0, 0)][DBLP]
    FPL, 2003, pp:996-999 [Conf]
  33. Deepak Kapur
    A Rewrite Rule Based Framework for Combining Decision Procedures. [Citation Graph (0, 0)][DBLP]
    FroCos, 2002, pp:87-102 [Conf]
  34. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
    Semi-Unification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:435-454 [Conf]
  35. Deepak Kapur, Paliath Narendran, Hantao Zhang
    Complexity of Sufficient-Completeness. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:426-442 [Conf]
  36. Deepak Kapur, Mahadevan Subramaniam
    Using Linear Arithmetic Procedure for Generating Induction Schemes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:438-449 [Conf]
  37. Deepak Kapur, G. Sivakumar
    Maximal Extensions os Simplification Orderings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:225-239 [Conf]
  38. Deepak Kapur, Mahadevan Subramaniam
    Mechanizing Verification of Arithmetic Circuits: SRT Division. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:103-122 [Conf]
  39. Deepak Kapur, G. Sivakumar, Hantao Zhang
    A New Method for Proving Termination of AC-Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:133-148 [Conf]
  40. Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur
    Reasoning in Systems of Equations and Inequations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:305-325 [Conf]
  41. Deepak Kapur, G. Sivakumar
    Proving Associative-Communicative Termination Using RPO-Compatible Orderings. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:39-61 [Conf]
  42. Adriaan de Groot, Jozef Hooman, Fabrice Kordon, Emmanuel Paviot-Adet, Isabelle Vernier-Mounier, Michel Lemoine, Gervais Gaudiere, Victor L. Winter, Deepak Kapur
    A Survey: Applying Formal Methods to a Software Intensive System. [Citation Graph (0, 0)][DBLP]
    HASE, 2001, pp:55-64 [Conf]
  43. Mark T. Vandevoorde, Deepak Kapur
    Parallel User Interfaces for Parallel Applications. [Citation Graph (0, 0)][DBLP]
    HPDC, 1996, pp:161-0 [Conf]
  44. Deepak Kapur, R. K. Shyamasundar
    Synthesizing Controllers for Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:361-375 [Conf]
  45. John V. Guttag, Deepak Kapur, David R. Musser
    Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:300-312 [Conf]
  46. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
    Proving Termination of GHC Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:720-736 [Conf]
  47. Enric Rodríguez-Carbonell, Deepak Kapur
    Program Verification Using Automatic Generation of Invariants. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2004, pp:325-340 [Conf]
  48. Deepak Kapur, Paliath Narendran
    An Equational Approach to Theorem Proving in First-Order Predicate Calculus. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:1146-1153 [Conf]
  49. Leopoldo E. Bertossi, Javier Pinto, Pablo Saez, Deepak Kapur, Mahadevan Subramaniam
    Automating Proofs of Integrity Constraints in Situation Calculus. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1996, pp:212-222 [Conf]
  50. Arthur D. Chtcherba, Deepak Kapur
    Conditions for exact resultants using the Dixon formulation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2000, pp:62-70 [Conf]
  51. Arthur D. Chtcherba, Deepak Kapur
    On the efficiency and optimality of Dixon-based resultant methods. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2002, pp:29-36 [Conf]
  52. Arthur D. Chtcherba, Deepak Kapur
    Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:95-102 [Conf]
  53. Deepak Kapur, Tushar Saxena
    Comparison of Various Multivariate Resultant Formulations. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1995, pp:187-194 [Conf]
  54. Deepak Kapur, Tushar Saxena
    Extraneous Factors in the Dixon Resultant Formulation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:141-148 [Conf]
  55. Deepak Kapur, Tushar Saxena, Lu Yang
    Algebraic and Geometric Reasoning Using Dixon Resultants. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:99-107 [Conf]
  56. Deepak Kapur, H. K. Wan
    Refutational Proofs of Geometry Theorems via Characteristic Set Computation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:277-284 [Conf]
  57. Enric Rodríguez-Carbonell, Deepak Kapur
    Automatic generation of polynomial loop. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:266-273 [Conf]
  58. Arthur D. Chtcherba, Deepak Kapur
    Conditions for determinantal formula for resultant of a polynomial system. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:55-62 [Conf]
  59. Deepak Kapur
    An Automated Tool for Analyzing Completeness of Equational Specifications. [Citation Graph (0, 0)][DBLP]
    ISSTA, 1994, pp:28-43 [Conf]
  60. Deepak Kapur, David R. Musser
    Inductive Reasoning with Incomplete Specifications (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:367-377 [Conf]
  61. Deepak Kapur, Paliath Narendran
    Double-exponential Complexity of Computing a Complete Set of AC-Unifiers [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:11-21 [Conf]
  62. Stephan Falke, Deepak Kapur
    Inductive Decidability Using Implicit Induction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:45-59 [Conf]
  63. Deepak Kapur, Mandayam K. Srivas
    Expressiveness of the Operation Set of a Data Abstraction. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:139-153 [Conf]
  64. Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie
    The Tecton Proof System. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:442-444 [Conf]
  65. Dan Benanav, Deepak Kapur, Paliath Narendran
    Complexity of Matching Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:417-429 [Conf]
  66. Jürgen Giesl, Deepak Kapur
    Dependency Pairs for Equational Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:93-108 [Conf]
  67. Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran
    An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:345-364 [Conf]
  68. Deepak Kapur
    Rewrite-Based Automated Reasoning: Challenges Ahead. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:1-2 [Conf]
  69. Deepak Kapur
    Shostak's Congruence Closure as Completion. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:23-37 [Conf]
  70. Deepak Kapur, Paliath Narendran, Lida Wang
    An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:165-179 [Conf]
  71. Deepak Kapur, G. Sivakumar
    A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:142-156 [Conf]
  72. Deepak Kapur, Hantao Zhang
    An Overview of Rewrite Rule Laboratory (RRL). [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:559-563 [Conf]
  73. Mark T. Vandevoorde, Deepak Kapur
    Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:420-423 [Conf]
  74. Hantao Zhang, Deepak Kapur
    Consider Only General Superpositions in Completion Procedures. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:513-527 [Conf]
  75. Enric Rodríguez-Carbonell, Deepak Kapur
    An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:280-295 [Conf]
  76. Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
    Interpolation for data structures. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 2006, pp:105-116 [Conf]
  77. Deepak Kapur, Tushar Saxena
    Sparsity Considerations in Dixon Resultants. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:184-191 [Conf]
  78. Deepak Kapur, Paliath Narendran, G. Sivakumar
    A Path Ordering for Proving Termination of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:173-187 [Conf]
  79. Deepak Kapur
    Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1997, pp:171-182 [Conf]
  80. Deepak Kapur, Nikita A. Sakhanenko
    Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2003, pp:136-154 [Conf]
  81. Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang
    Sufficient-Completeness, Ground-Reducibility and their Complexity. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:4, pp:311-350 [Journal]
  82. Deepak Kapur, Paliath Narendran, Hantao Zhang
    On Sufficient-Completeness and Related Properties of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:24, n:4, pp:395-415 [Journal]
  83. Michele Barry, David Cyrluk, Deepak Kapur, Joseph L. Mundy, Van-Duc Nguyen
    A Multi-Level Geometric Reasoning System for Vision. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:291-332 [Journal]
  84. Deepak Kapur
    A Refutational Approach to Geometry Theorem Proving. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:61-93 [Journal]
  85. Deepak Kapur, David R. Musser
    Proof by Consistency. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1987, v:31, n:2, pp:125-157 [Journal]
  86. Deepak Kapur, Joseph L. Mundy
    Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:1-11 [Journal]
  87. Deepak Kapur, Joseph L. Mundy
    Wu's Method and its Application to Perspective Viewing. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:15-36 [Journal]
  88. Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur
    Geometric, Algebraic, and Thermophysical Techniques for Object Recognition in IR Imagery. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1998, v:72, n:1, pp:84-97 [Journal]
  89. Deepak Kapur, Victor L. Winter, Raymond Berg
    Designing a Controller for a Multi-Train Multi-Track System. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:50, n:1, pp:- [Journal]
  90. Deepak Kapur, Mahadevan Subramaniam
    Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1998, v:13, n:2, pp:127-158 [Journal]
  91. Deepak Kapur, Paliath Narendran, Friedrich Otto
    On Ground-Confluence of Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:1, pp:14-31 [Journal]
  92. Deepak Kapur, Mukkai S. Krishnamoorthy
    Worst-Case Choice for the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:1, pp:27-30 [Journal]
  93. Hans-Jürgen Bürckert, Alexander Herold, Deepak Kapur, Jörg H. Siekmann, Mark E. Stickel, Michael Tepp, Hantao Zhang
    Opening the AC-Unification Race. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1988, v:4, n:4, pp:465-474 [Journal]
  94. Jürgen Giesl, Deepak Kapur
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:34, n:2, pp:103-104 [Journal]
  95. Deepak Kapur
    Announcement. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:31, n:2, pp:105-105 [Journal]
  96. Deepak Kapur
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:32, n:1, pp:1-2 [Journal]
  97. Deepak Kapur
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:32, n:3, pp:185-186 [Journal]
  98. Deepak Kapur, Paliath Narendran
    Complexity of Unification Problems with Associative-Commutative Operators. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1992, v:9, n:2, pp:261-288 [Journal]
  99. Deepak Kapur, Mahadevan Subramaniam
    New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1996, v:16, n:1-2, pp:39-78 [Journal]
  100. Deepak Kapur, G. Sivakumar, Hantao Zhang
    A Path Ordering for Proving Termination of AC Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1995, v:14, n:2, pp:293-316 [Journal]
  101. Deepak Kapur, Laurent Vigneron
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:33, n:3-4, pp:219-220 [Journal]
  102. Deepak Kapur, Hantao Zhang
    Proving Equivalence of Different Axiomatizations of Free Groups. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1988, v:4, n:3, pp:331-352 [Journal]
  103. Jürgen Giesl, Deepak Kapur
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:34, n:4, pp:323- [Journal]
  104. Jürgen Giesl, Deepak Kapur
    Third Special Issue on Techniques for Automated Termination Proofs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:37, n:3, pp:153-154 [Journal]
  105. Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur
    Inference Rules and Proof Procedures for Inequations. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1990, v:9, n:1, pp:75-104 [Journal]
  106. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
    Transformational Methodology for Proving Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:34, n:1, pp:1-41 [Journal]
  107. Dan Benanav, Deepak Kapur, Paliath Narendran
    Complexity of Matching Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:3, n:1/2, pp:203-216 [Journal]
  108. Arthur D. Chtcherba, Deepak Kapur
    Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:3-4, pp:289-315 [Journal]
  109. Arthur D. Chtcherba, Deepak Kapur
    Constructing Sylvester-type resultant matrices using the Dixon formulation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:38, n:1, pp:777-814 [Journal]
  110. Arthur D. Chtcherba, Deepak Kapur
    Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:38, n:2, pp:915-958 [Journal]
  111. Hoon Hong, Deepak Kapur, Peter Paule, Franz Winkler, Faculty of RISC-Linz
    Bruno Buchberger - A life devoted to symbolic computation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:3-4, pp:255-258 [Journal]
  112. Abdelilah Kandri-Rody, Deepak Kapur
    Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:6, n:1, pp:37-57 [Journal]
  113. Deepak Kapur
    Preface on the contributed papers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:3-4, pp:259-260 [Journal]
  114. Deepak Kapur
    Using Gröbner Bases to Reason About Geometry Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1986, v:2, n:4, pp:399-408 [Journal]
  115. Deepak Kapur, David R. Musser, Paliath Narendran
    Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:6, n:1, pp:19-36 [Journal]
  116. Deepak Kapur, Paliath Narendran, Hantao Zhang
    Automating Inductionless Induction Using Test Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:1/2, pp:81-111 [Journal]
  117. Hantao Zhang, Deepak Kapur
    Unnecessary Inferences in Associative-Commutative Completion Procedures. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:3, pp:175-206 [Journal]
  118. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
    Proving Termination of GHC Programs. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1997, v:15, n:3, pp:293-338 [Journal]
  119. Deepak Kapur, Mandayam K. Srivas
    Computability and Implementability Issues in Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1988, v:10, n:1, pp:33-63 [Journal]
  120. Enric Rodríguez-Carbonell, Deepak Kapur
    Automatic generation of polynomial invariants of bounded degree using abstract interpretation. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2007, v:64, n:1, pp:54-75 [Journal]
  121. John V. Guttag, Deepak Kapur, David R. Musser
    On Proving Uniform Termination and Restricted Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:189-214 [Journal]
  122. Deepak Kapur, Paliath Narendran
    The Knuth-Bendix Completion Procedure and Thue Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:1052-1072 [Journal]
  123. Deepak Kapur, Mahadevan Subramaniam
    Using an induction prover for verifying arithmetic circuits. [Citation Graph (0, 0)][DBLP]
    STTT, 2000, v:3, n:1, pp:32-65 [Journal]
  124. Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran
    An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:109-114 [Journal]
  125. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
    Semi-Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:169-187 [Journal]
  126. Deepak Kapur, Paliath Narendran
    A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:337-344 [Journal]
  127. Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton
    The Church-Rosser Property and Special Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:123-133 [Journal]
  128. Deepak Kapur, Xumin Nie, David R. Musser
    An Overview of the Tecton Proof System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:2, pp:307-339 [Journal]
  129. Stephan Falke, Deepak Kapur
    Dependency Pairs for Rewriting with Non-free Constructors. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:426-442 [Conf]
  130. Mark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo
    A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. [Citation Graph (0, 0)][DBLP]
    LCPC, 2006, pp:345-363 [Conf]
  131. Mark Marron, Darko Stefanovic, Manuel V. Hermenegildo, Deepak Kapur
    Heap analysis in the presence of collection libraries. [Citation Graph (0, 0)][DBLP]
    PASTE, 2007, pp:31-36 [Conf]
  132. Enric Rodríguez-Carbonell, Deepak Kapur
    Generating all polynomial invariants in simple loops. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2007, v:42, n:4, pp:443-476 [Journal]

  133. A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. [Citation Graph (, )][DBLP]


  134. Induction, Invariants, and Abstraction. [Citation Graph (, )][DBLP]


  135. Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. [Citation Graph (, )][DBLP]


  136. Identification of logically related heap regions. [Citation Graph (, )][DBLP]


  137. Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. [Citation Graph (, )][DBLP]


  138. Sharing analysis of arrays, collections, and recursive structures. [Citation Graph (, )][DBLP]


  139. Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. [Citation Graph (, )][DBLP]


  140. Shape Analysis with Reference Set Relations. [Citation Graph (, )][DBLP]


  141. Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures. [Citation Graph (, )][DBLP]


  142. Coverset Induction with Partiality and Subsorts: A Powerlist Case Study. [Citation Graph (, )][DBLP]


  143. Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures. [Citation Graph (, )][DBLP]


Search in 0.150secs, Finished in 0.157secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002