Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeepak 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
showing all ?? records
2020 – today
- 2023
[j72]Deepak Kapur:
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. Log. Methods Comput. Sci. 19(1) (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]