default search action
Deepak Kapur
Person information
- affiliation: University of New Mexico, Albuquerque, USA
- award (2009): Herbrand Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j74]Benjamin Mixon-Baca, Jeffrey Knockel, Diwen Xue, Tarun Ayyagari, Deepak Kapur, Roya Ensafi, Jedidiah R. Crandall:
Attacking Connection Tracking Frameworks as used by Virtual Private Networks. Proc. Priv. Enhancing Technol. 2024(3): 109-126 (2024) - 2023
- [j73]Deepak Kapur:
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. Log. Methods Comput. Sci. 19(1) (2023) - [j72]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur, Chiara Naso:
Interpolation Results for Arrays with Length and MaxDiff. ACM Trans. Comput. Log. 24(4): 28:1-28:33 (2023) - [i14]Wayne M. Witzel, Warren D. Craft, Robert D. Carr, Deepak Kapur:
Verifying Quantum Phase Estimation (QPE) using Prove-It. CoRR abs/2304.02183 (2023) - [i13]Deepak Kapur, Paliath Narendran:
Existence and Construction of a Gröbner Basis for a Polynomial Ideal. CoRR abs/2306.09602 (2023) - 2022
- [j71]Franz Baader, Deepak Kapur:
Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols. J. Autom. Reason. 66(3): 301-329 (2022) - [j70]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Uniform Interpolants in EUF: Algorithms using DAG-representations. Log. Methods Comput. Sci. 18(2) (2022) - [c140]Weifeng Shang, Chenqi Mou, Deepak Kapur:
Algorithms for Testing Membership in Univariate Quadratic Modules over the Reals. ISSAC 2022: 429-437 - [i12]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur, Chiara Naso:
General Interpolation and Strong Amalgamation for Contiguous Arrays. CoRR abs/2204.11771 (2022) - 2021
- [j69]Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang:
Algorithms for computing greatest common divisors of parametric multivariate polynomials. J. Symb. Comput. 102: 3-20 (2021) - [c139]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Interpolation and Amalgamation for Arrays with MaxDiff. FoSSaCS 2021: 268-288 - [c138]Deepak Kapur:
A Modular Associative Commutative (AC) Congruence Closure Algorithm. FSCD 2021: 15:1-15:21 - [c137]José Abel Castellanos Joo, Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
AXDInterpolator: A Tool for Computing Interpolants for Arrays with MaxDiff. SMT 2021: 40-52 - [i11]Deepak Kapur:
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. CoRR abs/2111.04793 (2021) - 2020
- [c136]Franz Baader, Deepak Kapur:
Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols. IJCAR (1) 2020: 163-180 - [c135]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Computing Uniform Interpolants for EUF via (conditional) DAG-based Compact Representations. CILC 2020: 67-81 - [i10]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS. CoRR abs/2002.09784 (2020) - [i9]Deepak Kapur, Yiming Yang:
An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System. CoRR abs/2003.07957 (2020) - [i8]Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version). CoRR abs/2010.07082 (2020)
2010 – 2019
- 2019
- [j68]Martin Fränzle, Deepak Kapur, Heike Wehrheim, Naijun Zhan:
Editorial. Formal Aspects Comput. 31(1): 1 (2019) - [j67]Deepak Kapur:
Conditional Congruence Closure over Uninterpreted and Interpreted Symbols. J. Syst. Sci. Complex. 32(1): 317-355 (2019) - [c134]Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan:
NIL: Learning Nonlinear Interpolants. CADE 2019: 178-196 - [i7]ThanhVu Nguyen, Westley Weimer, Deepak Kapur, Stephanie Forrest:
Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation. CoRR abs/1903.11765 (2019) - [i6]ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest:
Using Dynamic Analysis to Generate Disjunctive Invariants. CoRR abs/1904.07463 (2019) - [i5]Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan:
NIL: Learning Nonlinear Interpolants. CoRR abs/1905.11625 (2019) - 2018
- [c133]Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang:
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. ISSAC 2018: 239-246 - 2017
- [j66]Stéphane Demri, Deepak Kapur, Christoph Weidenbach:
Preface - Special Issue of Selected Extended Papers of IJCAR 2014. J. Autom. Reason. 58(1): 1-2 (2017) - [j65]Deepak Kapur:
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm. J. Syst. Sci. Complex. 30(1): 196-233 (2017) - [c132]Deepak Kapur:
Nonlinear Polynomials, Interpolants and Invariant Generation for System Analysis. SC²@ISSAC 2017 - [c131]ThanhVu Nguyen, Westley Weimer, Deepak Kapur, Stephanie Forrest:
Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation. TACAS (1) 2017: 301-318 - [e5]Dang Van Hung, Deepak Kapur:
Theoretical Aspects of Computing - ICTAC 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings. Lecture Notes in Computer Science 10580, Springer 2017, ISBN 978-3-319-67728-6 [contents] - 2016
- [c130]Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen:
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF. IJCAR 2016: 195-212 - [e4]Martin Fränzle, Deepak Kapur, Naijun Zhan:
Dependable Software Engineering: Theories, Tools, and Applications - Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings. Lecture Notes in Computer Science 9984, 2016, ISBN 978-3-319-47676-6 [contents] - [i4]Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen:
Interpolation synthesis for quadratic polynomial inequalities and combination with \textit{EUF}. CoRR abs/1601.04802 (2016) - 2015
- [j64]Roli Varma, Deepak Kapur:
Decoding femininity in computer science in India. Commun. ACM 58(5): 56-62 (2015) - [c129]Stephan Falke, Deepak Kapur:
When Is a Formula a Loop Invariant? Logic, Rewriting, and Concurrency 2015: 264-286 - [c128]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos 2015: 291-306 - [c127]Deepak Kapur, Yiming Yang:
An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion Algorithm. ISSAC 2015: 243-250 - 2014
- [j63]ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest:
DIG: A Dynamic Invariant Generator for Polynomial and Array Invariants. ACM Trans. Softw. Eng. Methodol. 23(4): 30:1-30:30 (2014) - [c126]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS 2014: 274-288 - [c125]ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest:
Using dynamic analysis to generate disjunctive invariants. ICSE 2014: 608-619 - [c124]Liqian Chen, Jiangchao Liu, Antoine Miné, Deepak Kapur, Ji Wang:
An Abstract Domain to Infer Octagonal Constraints with Absolute Value. SAS 2014: 101-117 - [c123]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF 2014: 33-35 - [c122]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF 2014: 36-40 - [e3]Stéphane Demri, Deepak Kapur, Christoph Weidenbach:
Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. Lecture Notes in Computer Science 8562, Springer 2014, ISBN 978-3-319-08586-9 [contents] - 2013
- [j62]Zhihai Zhang, Deepak Kapur:
On invariant checking. J. Syst. Sci. Complex. 26(3): 470-482 (2013) - [j61]Deepak Kapur, Yao Sun, Dingkang Wang:
An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system. J. Symb. Comput. 49: 27-44 (2013) - [j60]Deepak Kapur, Yao Sun, Dingkang Wang:
An efficient method for computing comprehensive Gröbner bases. J. Symb. Comput. 52: 124-142 (2013) - [c121]Deepak Kapur, Robert Nieuwenhuis, Andrei Voronkov, Christoph Weidenbach, Reinhard Wilhelm:
Harald Ganzinger's Legacy: Contributions to Logics and Programming. Programming Logics 2013: 1-18 - [c120]Deepak Kapur, Zhihai Zhang, Matthias Horbach, Hengjun Zhao, Qi Lu, ThanhVu Nguyen:
Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants. Automated Reasoning and Mathematics 2013: 189-228 - [c119]Deepak Kapur:
Elimination Techniques for Program Analysis. Programming Logics 2013: 194-215 - [c118]Hengjun Zhao, Naijun Zhan, Deepak Kapur:
Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants. Theories of Programming and Formal Methods 2013: 354-373 - [c117]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse:
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE 2013: 231-248 - [c116]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination. CADE 2013: 249-266 - [c115]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA 2013: 30-34 - [i3]Deepak Kapur, Naijun Zhan, Hengjun Zhao:
Synthesizing Switching Controllers for Hybrid Systems by Continuous Invariant Generation. CoRR abs/1304.0825 (2013) - 2012
- [j59]Xiao-Shan Gao, Deepak Kapur:
Preface. J. Symb. Comput. 47(6): 583-585 (2012) - [j58]Xiao-Shan Gao, Deepak Kapur:
A brief introduction to Wen-Tsun Wu's academic career. J. Symb. Comput. 47(6): 586-588 (2012) - [c114]Stephan Falke, Deepak Kapur:
Rewriting Induction + Linear Arithmetic = Decision Procedure. IJCAR 2012: 241-255 - [c113]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse:
Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS 2012: 73-90 - [c112]Hengjun Zhao, Naijun Zhan, Deepak Kapur, Kim G. Larsen:
A "Hybrid" Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example. FM 2012: 471-485 - [c111]ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest:
Using dynamic analysis to discover polynomial and array invariants. ICSE 2012: 683-693 - [c110]Deepak Kapur:
Program Analysis Using Quantifier-Elimination Heuristics - (Extended Abstract). TAMC 2012: 94-108 - [c109]Stephan Falke, Deepak Kapur, Carsten Sinz:
Termination Analysis of Imperative Programs Using Bitvector Arithmetic. VSTTE 2012: 261-277 - [i2]Hengjun Zhao, Naijun Zhan, Deepak Kapur, Kim G. Larsen:
A "Hybrid" Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example. CoRR abs/1203.6025 (2012) - 2011
- [j57]Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran:
Unification over Distributive Exponentiation (Sub)Theories. J. Autom. Lang. Comb. 16(2-4): 109-140 (2011) - [c108]Deepak Kapur, Yao Sun, Dingkang Wang:
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. ISSAC 2011: 193-200 - [c107]Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse:
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP 2011: 65-76 - [c106]Stephan Falke, Deepak Kapur, Carsten Sinz:
Termination Analysis of C Programs Using Compiler Intermediate Languages. RTA 2011: 41-50 - [c105]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse:
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. UNIF 2011: 59-64 - 2010
- [c104]Deepak Kapur:
Induction, Invariants, and Abstraction. IJCAR 2010: 353 - [c103]Deepak Kapur, Yao Sun, Dingkang Wang:
A new algorithm for computing comprehensive Gröbner systems. ISSAC 2010: 29-36 - [c102]Joe Hendrix, Deepak Kapur, José Meseguer:
Coverset Induction with Partiality and Subsorts: A Powerlist Case Study. ITP 2010: 275-290 - [c101]Roya Ensafi, Jong Chun Park, Deepak Kapur, Jedidiah R. Crandall:
Idle Port Scanning and Non-interference Analysis of Network Protocol Stacks Using Model Checking. USENIX Security Symposium 2010: 257-272 - [c100]Mark Marron, Rupak Majumdar, Darko Stefanovic, Deepak Kapur:
Shape Analysis with Reference Set Relations. VMCAI 2010: 247-262 - [c99]Deepak Kapur, Andrew M. Marshall, Paliath Narendran:
Unification modulo a partial theory of exponentiation. UNIF 2010: 12-23
2000 – 2009
- 2009
- [j56]Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair:
Cayley-Dixon projection operator for multi-univariate composed polynomials. J. Symb. Comput. 44(8): 972-999 (2009) - [j55]Deepak Kapur, Yongyang Cai:
An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors. Math. Comput. Sci. 2(4): 601-634 (2009) - [c98]Stephan Falke, Deepak Kapur:
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. CADE 2009: 277-293 - [c97]Mark Marron, Deepak Kapur, Manuel V. Hermenegildo:
Identification of logically related heap regions. ISMM 2009: 89-98 - [c96]Stephan Falke, Deepak Kapur:
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures. WFLP 2009: 44-61 - 2008
- [c95]Deepak Kapur, Manfred Minimair:
Multivariate Resultants in Bernstein Basis. Automated Deduction in Geometry 2008: 60-85 - [c94]Mark Marron, Manuel V. Hermenegildo, Deepak Kapur, Darko Stefanovic:
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. CC 2008: 245-259 - [c93]Mark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo:
Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. LCPC 2008: 94-108 - [c92]Mark Marron, Mario Méndez-Lojo, Manuel V. Hermenegildo, Darko Stefanovic, Deepak Kapur:
Sharing analysis of arrays, collections, and recursive structures. PASTE 2008: 43-49 - [c91]Stephan Falke, Deepak Kapur:
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. RTA 2008: 94-109 - [c90]Stephan Falke, Deepak Kapur:
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures. WRS@RTA 2008: 75-90 - [e2]Deepak Kapur:
Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers. Lecture Notes in Computer Science 5081, Springer 2008, ISBN 978-3-540-87826-1 [contents] - 2007
- [j54]Enric Rodríguez-Carbonell, Deepak Kapur:
Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4): 443-476 (2007) - [j53]Enric Rodríguez-Carbonell, Deepak Kapur:
Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Sci. Comput. Program. 64(1): 54-75 (2007) - [c89]Stephan Falke, Deepak Kapur:
Dependency Pairs for Rewriting with Non-free Constructors. CADE 2007: 426-442 - [c88]Mark Marron, Darko Stefanovic, Manuel V. Hermenegildo, Deepak Kapur:
Heap analysis in the presence of collection libraries. PASTE 2007: 31-36 - 2006
- [j52]Jürgen Giesl, Deepak Kapur:
Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reason. 37(3): 153-154 (2006) - [j51]Deepak Kapur:
A Quantifier-Elimination Based Heuristic for Automatically Generating Inductive Assertions for Programs. J. Syst. Sci. Complex. 19(3): 307-330 (2006) - [j50]Hoon Hong, Deepak Kapur, Peter Paule, Franz Winkler:
Bruno Buchberger - A life devoted to symbolic computation. J. Symb. Comput. 41(3-4): 255-258 (2006) - [j49]Deepak Kapur:
Preface on the contributed papers. J. Symb. Comput. 41(3-4): 259-260 (2006) - [c87]Arthur D. Chtcherba, Deepak Kapur:
Conditions for determinantal formula for resultant of a polynomial system. ISSAC 2006: 55-62 - [c86]Mark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo:
A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. LCPC 2006: 345-363 - [c85]Stephan Falke, Deepak Kapur:
Inductive Decidability Using Implicit Induction. LPAR 2006: 45-59 - [c84]Deepak Kapur, Rupak Majumdar, Calogero G. Zarba:
Interpolation for data structures. SIGSOFT FSE 2006: 105-116 - 2005
- [j48]Jürgen Giesl, Deepak Kapur:
Preface. J. Autom. Reason. 34(2): 103-104 (2005) - [j47]Jürgen Giesl, Deepak Kapur:
Preface. J. Autom. Reason. 34(4): 323 (2005) - [c83]Deepak Kapur, Paliath Narendran, Lida Wang:
A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning 2005: 433-451 - [c82]Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair:
Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials. CASC 2005: 125-137 - [c81]Victor L. Winter, Deepak Kapur:
Towards Dynamic Partitioning of Reactive System Behavior: A Train Controller Case Study. Monterey Workshop 2005: 47-69 - [i1]Deepak Kapur:
Automatically Generating Loop Invariants Using Quantifier Elimination. Deduction and Applications 2005 - 2004
- [j46]Deepak Kapur:
Preface. J. Autom. Reason. 32(1): 1-2 (2004) - [j45]Deepak Kapur:
Preface. J. Autom. Reason. 32(3): 185-186 (2004) - [j44]Deepak Kapur, Laurent Vigneron:
Preface. J. Autom. Reason. 33(3-4): 219-220 (2004) - [j43]Arthur D. Chtcherba, Deepak Kapur:
Constructing Sylvester-type resultant matrices using the Dixon formulation. J. Symb. Comput. 38(1): 777-814 (2004) - [j42]Arthur D. Chtcherba, Deepak Kapur:
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. J. Symb. Comput. 38(2): 915-958 (2004) - [c80]Enric Rodríguez-Carbonell, Deepak Kapur:
Program Verification Using Automatic Generation of Invariants. ICTAC 2004: 325-340 - [c79]Arthur D. Chtcherba, Deepak Kapur:
Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. ISSAC 2004: 95-102 - [c78]Enric Rodríguez-Carbonell, Deepak Kapur:
Automatic generation of polynomial loop. ISSAC 2004: 266-273 - [c77]Enric Rodríguez-Carbonell, Deepak Kapur:
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. SAS 2004: 280-295 - [p2]Victor L. Winter, Deepak Kapur, G. Fuehrer:
Formal Specifcation and Refinement of a Safe Train Control Function. Formal Methods for Embedded Distributed Systems 2004: 25-64 - 2003
- [j41]Arthur D. Chtcherba, Deepak Kapur:
On the relationship between the Dixon-based resultant construction and the supports of polynomial systems. SIGSAM Bull. 37(3): 66-67 (2003) - [j40]Deepak Kapur:
Announcement. J. Autom. Reason. 31(2): 105-105 (2003) - [j39]Arthur D. Chtcherba, Deepak Kapur:
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. J. Symb. Comput. 36(3-4): 289-315 (2003) - [c76]Deepak Kapur, Mahadevan Subramaniam:
Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report. ASIAN 2003: 125-145 - [c75]Jürgen Giesl, Deepak Kapur:
Deciding Inductive Validity of Equations. CADE 2003: 17-31 - [c74]John Cochran, Deepak Kapur, Darko Stefanovic:
Model Checking Reconfigurable Processor Configurations for Safety Properties. FPL 2003: 996-999 - [c73]Deepak Kapur, Paliath Narendran, Lida Wang:
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA 2003: 165-179 - [c72]Deepak Kapur, Nikita A. Sakhanenko:
Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions. TPHOLs 2003: 136-154 - 2002
- [c71]Deepak Kapur:
A Rewrite Rule Based Framework for Combining Decision Procedures. FroCoS 2002: 87-102 - [c70]Arthur D. Chtcherba, Deepak Kapur:
On the efficiency and optimality of Dixon-based resultant methods. ISSAC 2002: 29-36 - 2001
- [c69]Jürgen Giesl, Deepak Kapur:
Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484 - [c68]Adriaan de Groot, Jozef Hooman, Fabrice Kordon, Emmanuel Paviot-Adet, Isabelle Vernier-Mounier, Michel Lemoine, Gervais Gaudiére, Victor L. Winter, Deepak Kapur:
A Survey: Applying Formal Methods to a Software Intensive System. HASE 2001: 55-64 - [c67]Jürgen Giesl, Deepak Kapur:
Dependency Pairs for Equational Rewriting. RTA 2001: 93-108 - [c66]Deepak Kapur, Victor L. Winter, Raymond Berg:
Designing a Controller for a Multi-Train Multi-Track System. ATMOS 2001: 65-79 - [p1]Deepak Kapur:
Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic. Symbolic Algebraic Methods and Verification Methods 2001: 129-144 - 2000
- [j38]Deepak Kapur, Mahadevan Subramaniam:
Using an induction prover for verifying arithmetic circuits. Int. J. Softw. Tools Technol. Transf. 3(1): 32-65 (2000) - [c65]Deepak Kapur, Mahadevan Subramaniam:
Extending Decision Procedures with Induction Schemes. CADE 2000: 324-345 - [c64]Arthur D. Chtcherba, Deepak Kapur:
Conditions for exact resultants using the Dixon formulation. ISSAC 2000: 62-70
1990 – 1999
- 1998
- [j37]Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur:
Geometric, Algebraic, and Thermophysical Techniques for Object Recognition in IR Imagery. Comput. Vis. Image Underst. 72(1): 84-97 (1998) - [j36]Deepak Kapur, Mahadevan Subramaniam:
Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory. Formal Methods Syst. Des. 13(2): 127-158 (1998) - [j35]M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
Transformational Methodology for Proving Termination of Logic Programs. J. Log. Program. 34(1): 1-41 (1998) - [c63]Deepak Kapur, Mahadevan Subramaniam:
Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover. ASIAN 1998: 22-42 - [c62]Sreenivasa Viswanadha, Deepak Kapur:
IBDL: A Language for Interface Behavior Specification and Testing. COOTS 1998: 235-248 - [c61]Deepak Kapur, G. Sivakumar:
Proving Associative-Communicative Termination Using RPO-Compatible Orderings. FTP (LNCS Selection) 1998: 39-61 - 1997
- [j34]M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
Proving Termination of GHC Programs. New Gener. Comput. 15(3): 293-338 (1997) - [c60]Deepak Kapur, Mahadevan Subramaniam:
Mechanizing Verification of Arithmetic Circuits: SRT Division. FSTTCS 1997: 103-122 - [c59]Deepak Kapur, R. K. Shyamasundar:
Synthesizing Controllers for Hybrid Systems. HART 1997: 361-375 - [c58]Deepak Kapur, Tushar Saxena:
Extraneous Factors in the Dixon Resultant Formulation. ISSAC 1997: 141-148 - [c57]Deepak Kapur:
Shostak's Congruence Closure as Completion. RTA 1997: 23-37 - [c56]Deepak Kapur, G. Sivakumar:
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. RTA 1997: 142-156 - [c55]Deepak Kapur:
Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification. TPHOLs 1997: 171-182 - 1996
- [j33]Deepak Kapur, Mahadevan Subramaniam:
New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. J. Autom. Reason. 16(1-2): 39-78 (1996) - [c54]Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur:
Using Elimination Methods to Compute Thermophysical Algebraic Invariants from Infrared Imagery. AAAI/IAAI, Vol. 2 1996: 1110-1115 - [c53]Deepak Kapur:
Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets. Automated Deduction in Geometry 1996: 1-36 - [c52]Deepak Kapur, Mahadevan Subramaniam:
Automating Induction over Mutually Recursive Functions. AMAST 1996: 117-131 - [c51]Deepak Kapur, Mahadevan Subramaniam:
Lemma Discovery in Automated Induction. CADE 1996: 538-552 - [c50]Deepak Kapur, Mahadevan Subramaniam:
Mechanically Verifying a Family of Multiplier Circuits. CAV 1996: 135-146 - [c49]Mark T. Vandevoorde, Deepak Kapur:
Parallel User Interfaces for Parallel Applications. HPDC 1996: 161-170 - [c48]Leopoldo E. Bertossi, Javier Pinto, Pablo Sáez, Deepak Kapur, Mahadevan Subramaniam:
Automating Proofs of Integrity Constraints in Situation Calculus. ISMIS 1996: 212-222 - [c47]Deepak Kapur:
Rewrite-Based Automated Reasoning: Challenges Ahead. RTA 1996: 1-2 - [c46]Mark T. Vandevoorde, Deepak Kapur:
Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. RTA 1996: 420-423 - [c45]Deepak Kapur, Tushar Saxena:
Sparsity Considerations in Dixon Resultants. STOC 1996: 184-191 - 1995
- [j32]Deepak Kapur, G. Sivakumar, Hantao Zhang:
A Path Ordering for Proving Termination of AC Rewrite Systems. J. Autom. Reason. 14(2): 293-316 (1995) - [c44]Deepak Kapur, Mahadevan Subramaniam:
Automated Reasoning About Parallel Algorithms Using Powerlists. AMAST 1995: 416-430 - [c43]Deepak Kapur, G. Sivakumar:
Maximal Extensions os Simplification Orderings. FSTTCS 1995: 225-239 - [c42]Deepak Kapur, Tushar Saxena:
Comparison of Various Multivariate Resultant Formulations. ISSAC 1995: 187-194 - 1994
- [j31]Deepak Kapur, Xumin Nie, David R. Musser:
An Overview of the Tecton Proof System. Theor. Comput. Sci. 133(2): 307-339 (1994) - [c41]Deepak Kapur, Mahadevan Subramaniam:
Using Linear Arithmetic Procedure for Generating Induction Schemes. FSTTCS 1994: 438-449 - [c40]Deepak Kapur, Tushar Saxena, Lu Yang:
Algebraic and Geometric Reasoning Using Dixon Resultants. ISSAC 1994: 99-107 - [c39]Deepak Kapur:
An Automated Tool for Analyzing Completeness of Equational Specifications. ISSTA 1994: 28-43 - 1993
- [c38]M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
Proving Termination of GHC Programs. ICLP 1993: 720-736 - 1992
- [j30]Deepak Kapur, Paliath Narendran:
Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reason. 9(2): 261-288 (1992) - [c37]R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur:
Rewriting Concepts in the Study of Termination of Logic Programs. ALPUK 1992: 3-20 - [c36]Deepak Kapur, David R. Musser, Xumin Nie:
The Tecton Proof System. Formal Methods in Databases and Software Engineering 1992: 54-79 - [c35]Deepak Kapur, Paliath Narendran:
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers. LICS 1992: 11-21 - [e1]Deepak Kapur:
Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings. Lecture Notes in Computer Science 607, Springer 1992, ISBN 3-540-55602-8 [contents] - 1991
- [j29]Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang:
Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4): 311-350 (1991) - [j28]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Automating Inductionless Induction Using Test Sets. J. Symb. Comput. 11(1/2): 81-111 (1991) - [j27]Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman:
Semi-Unification. Theor. Comput. Sci. 81(2): 169-187 (1991) - [c34]Deepak Kapur, Hantao Zhang:
A Case Study of the Completion Procedure: Proving Ring Commutativity Problems. Computational Logic - Essays in Honor of Alan Robinson 1991: 360-394 - [c33]M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
A Transformational Methodology for Proving Termination of Logic Programs. CSL 1991: 213-226 - [c32]Van-Duc Nguyen, Joseph L. Mundy, Deepak Kapur:
Modeling generic polyhedral objects with constraints. CVPR 1991: 479-485 - [c31]Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie:
The Tecton Proof System. RTA 1991: 442-444 - 1990
- [j26]Deepak Kapur, Paliath Narendran, Friedrich Otto:
On Ground-Confluence of Term Rewriting Systems. Inf. Comput. 86(1): 14-31 (1990) - [j25]Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur:
Inference Rules and Proof Procedures for Inequations. J. Log. Program. 9(1): 75-104 (1990) - [j24]Hantao Zhang, Deepak Kapur:
Unnecessary Inferences in Associative-Commutative Completion Procedures. Math. Syst. Theory 23(3): 175-206 (1990) - [c30]Deepak Kapur, G. Sivakumar, Hantao Zhang:
A New Method for Proving Termination of AC-Rewrite Systems. FSTTCS 1990: 133-148 - [c29]Deepak Kapur, H. K. Wan:
Refutational Proofs of Geometry Theorems via Characteristic Set Computation. ISSAC 1990: 277-284
1980 – 1989
- 1989
- [c28]Deepak Kapur, Klaus Madlener:
A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra. Computers and Mathematics 1989: 1-11 - [c27]Hantao Zhang, Deepak Kapur:
Consider Only General Superpositions in Completion Procedures. RTA 1989: 513-527 - [c26]Deepak Kapur, Hantao Zhang:
An Overview of Rewrite Rule Laboratory (RRL). RTA 1989: 559-563 - 1988
- [j23]Deepak Kapur, Joseph L. Mundy:
Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume. Artif. Intell. 37(1-3): 1-11 (1988) - [j22]Deepak Kapur, Joseph L. Mundy:
Wu's Method and its Application to Perspective Viewing. Artif. Intell. 37(1-3): 15-36 (1988) - [j21]Deepak Kapur:
A Refutational Approach to Geometry Theorem Proving. Artif. Intell. 37(1-3): 61-93 (1988) - [j20]Michele Barry, David Cyrluk, Deepak Kapur, Joseph L. Mundy, Van-Duc Nguyen:
A Multi-Level Geometric Reasoning System for Vision. Artif. Intell. 37(1-3): 291-332 (1988) - [j19]Deepak Kapur, Hantao Zhang:
Proving Equivalence of Different Axiomatizations of Free Groups. J. Autom. Reason. 4(3): 331-352 (1988) - [j18]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. J. Autom. Reason. 4(4): 465-474 (1988) - [j17]Deepak Kapur, David R. Musser, Paliath Narendran:
Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. J. Symb. Comput. 6(1): 19-36 (1988) - [j16]Abdelilah Kandri-Rody, Deepak Kapur:
Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain. J. Symb. Comput. 6(1): 37-57 (1988) - [j15]Deepak Kapur, Mandayam K. Srivas:
Computability and Implementability Issues in Abstract Data Types. Sci. Comput. Program. 10(1): 33-63 (1988) - [c25]Hantao Zhang, Deepak Kapur:
First-Order Theorem Proving Using Conditional Rewrite Rules. CADE 1988: 1-20 - [c24]Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy:
A Mechanizable Induction Principle for Equational Specifications. CADE 1988: 162-181 - [c23]Deepak Kapur, Hantao Zhang:
RRL: A Rewrite Rule Laboratory. CADE 1988: 768-769 - [c22]David Cyrluk, Richard M. Harris, Deepak Kapur:
GEOMETER: A Theorem Prover for Algebraic Geometry. CADE 1988: 770-771 - [c21]Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman:
Semi-Unification. FSTTCS 1988: 435-454 - 1987
- [j14]Deepak Kapur, Paliath Narendran, Hantao Zhang:
On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Informatica 24(4): 395-415 (1987) - [j13]Deepak Kapur, David R. Musser:
Proof by Consistency. Artif. Intell. 31(2): 125-157 (1987) - [j12]Deepak Kapur, Paliath Narendran:
Matching, unification and complexity. SIGSAM Bull. 21(4): 6-9 (1987) - [j11]Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. J. Symb. Comput. 3(1/2): 203-216 (1987) - [c20]Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur:
Reasoning in Systems of Equations and Inequations. FSTTCS 1987: 305-325 - 1986
- [j10]Deepak Kapur:
Using Gröbner Bases to Reason About Geometry Problems. J. Symb. Comput. 2(4): 399-408 (1986) - [c19]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Proof by Induction Using Test Sets. CADE 1986: 99-117 - [c18]Deepak Kapur, Paliath Narendran:
NP-Completeness of the Set Unification and Matching Problems. CADE 1986: 489-495 - [c17]Deepak Kapur, G. Sivakumar, Hantao Zhang:
RRL: A Rewrite Rule Laboratory. CADE 1986: 691-692 - [c16]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Complexity of Sufficient-Completeness. FSTTCS 1986: 426-442 - [c15]Deepak Kapur:
Geometry theorem proving using Hilbert's Nullstellensatz. SYMSAC 1986: 202-208 - [c14]Deepak Kapur, David R. Musser:
Inductive Reasoning with Incomplete Specifications (Preliminary Report). LICS 1986: 367-377 - 1985
- [j9]Deepak Kapur, Mukkai S. Krishnamoorthy:
Worst-Case Choice for the Stable Marriage Problem. Inf. Process. Lett. 21(1): 27-30 (1985) - [j8]Deepak Kapur, Paliath Narendran:
The Knuth-Bendix Completion Procedure and Thue Systems. SIAM J. Comput. 14(4): 1052-1072 (1985) - [j7]Deepak Kapur, Paliath Narendran:
An equational approach to theorem proving in first-order predicate calculus. ACM SIGSOFT Softw. Eng. Notes 10(4): 63-66 (1985) - [j6]Deepak Kapur, G. Sivakumar:
RRL: theorem proving environment based on rewriting techniques. ACM SIGSOFT Softw. Eng. Notes 10(4): 67-68 (1985) - [j5]Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran:
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. Theor. Comput. Sci. 35: 109-114 (1985) - [j4]Deepak Kapur, Paliath Narendran:
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. Theor. Comput. Sci. 35: 337-344 (1985) - [j3]Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton:
The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. 39: 123-133 (1985) - [c13]Deepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran:
Reasoning about three dimensional space. ICRA 1985: 405-410 - [c12]Deepak Kapur, Paliath Narendran:
An Equational Approach to Theorem Proving in First-Order Predicate Calculus. IJCAI 1985: 1146-1153 - [c11]Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran:
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. RTA 1985: 345-364 - [c10]Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. RTA 1985: 417-429 - [c9]Deepak Kapur, Paliath Narendran, G. Sivakumar:
A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 1985: 173-187 - [c8]Deepak Kapur, Mandayam K. Srivas:
A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. TAPSOFT, Vol.1 1985: 188-207 - 1984
- [c7]Deepak Kapur, Balakrishnan Krishnamurthy:
A Natural Proof System Based on rewriting Techniques. CADE 1984: 53-64 - [c6]Abdelilah Kandri-Rody, Deepak Kapur:
Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings. EUROSAM 1984: 195-206 - 1983
- [j2]John V. Guttag, Deepak Kapur, David R. Musser:
On Proving Uniform Termination and Restricted Termination of Rewriting Systems. SIAM J. Comput. 12(1): 189-214 (1983) - 1982
- [c5]David R. Musser, Deepak Kapur:
Rewrite Rule Theory and Abstract Data Type Analysis. EUROCAM 1982: 77-90 - [c4]John V. Guttag, Deepak Kapur, David R. Musser:
Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. ICALP 1982: 300-312 - 1981
- [c3]Deepak Kapur, David R. Musser, Alexander A. Stepanov:
Tecton: A Language for Manipulating Generic Objects. Program Specification 1981: 402-414 - [c2]Deepak Kapur, David R. Musser, Alexander A. Stepanov:
Operators and algebraic structures. FPCA 1981: 59-64 - 1980
- [c1]Deepak Kapur, Mandayam K. Srivas:
Expressiveness of the Operation Set of a Data Abstraction. POPL 1980: 139-153
1970 – 1979
- 1979
- [j1]Deepak Kapur:
Specifications of Majster's traversable stack and Veloso's traversable stack. ACM SIGPLAN Notices 14(5): 46-53 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint