Deepak Kapur - RankMe

237 papers A* 12A 25B 28C 7Misc 1Journal 89Unranked 72

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A new algorithm for Gröbner bases conversion. J. Symb. Comput. Amir Hashemi, Deepak Kapur
2025	J	`jnl`	Computing Certificates of Strictly Positive Polynomials in Archimedean Quadratic Modules. CoRR Weifeng Shang, Chenqi Mou, José Abel Castellanos, Deepak Kapur
2024	J	`jnl`	Attacking Connection Tracking Frameworks as used by Virtual Private Networks. Proc. Priv. Enhancing Technol. Benjamin Mixon-Baca, Jeffrey Knockel, Diwen Xue, Tarun Ayyagari, Deepak Kapur, Roya Ensafi, Jedidiah R. Crandall
2023	J	`jnl`	Existence and Construction of a Gröbner Basis for a Polynomial Ideal. CoRR Deepak Kapur, Paliath Narendran
2023	J	`jnl`	Interpolation Results for Arrays with Length and MaxDiff. ACM Trans. Comput. Log. Silvio Ghilardi, Alessandro Gianola, Deepak Kapur, Chiara Naso
2023	J	`jnl`	Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. Log. Methods Comput. Sci. Deepak Kapur
2023	J	`jnl`	Verifying Quantum Phase Estimation (QPE) using Prove-It. CoRR Wayne M. Witzel, Warren D. Craft, Robert D. Carr, Deepak Kapur
2022	B	`conf`	Algorithms for Testing Membership in Univariate Quadratic Modules over the Reals. ISSAC Weifeng Shang, Chenqi Mou, Deepak Kapur
2022	J	`jnl`	Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols. J. Autom. Reason. Franz Baader, Deepak Kapur
2022	J	`jnl`	General Interpolation and Strong Amalgamation for Contiguous Arrays. CoRR Silvio Ghilardi, Alessandro Gianola, Deepak Kapur, Chiara Naso
2022	J	`jnl`	Uniform Interpolants in EUF: Algorithms using DAG-representations. Log. Methods Comput. Sci. Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
2021	B	`conf`	A Modular Associative Commutative (AC) Congruence Closure Algorithm. FSCD Deepak Kapur
2021	—	`conf`	AXDInterpolator: A Tool for Computing Interpolants for Arrays with MaxDiff. SMT José Abel Castellanos Joo, Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
2021	J	`jnl`	Algorithms for computing greatest common divisors of parametric multivariate polynomials. J. Symb. Comput. Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang
2021	B	`conf`	Interpolation and Amalgamation for Arrays with MaxDiff. FoSSaCS Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
2021	J	`jnl`	Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. CoRR Deepak Kapur
2020	J	`jnl`	An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System. CoRR Deepak Kapur, Yiming Yang
2020	J	`jnl`	Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS. CoRR Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
2020	—	`conf`	Computing Uniform Interpolants for EUF via (conditional) DAG-based Compact Representations. CILC Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
2020	—	`conf`	Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols. IJCAR (1) Franz Baader, Deepak Kapur
2020	J	`jnl`	Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version). CoRR Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
2019	J	`jnl`	Conditional Congruence Closure over Uninterpreted and Interpreted Symbols. J. Syst. Sci. Complex. Deepak Kapur
2019	J	`jnl`	Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation. CoRR ThanhVu Nguyen, Westley Weimer, Deepak Kapur, Stephanie Forrest
2019	J	`jnl`	Editorial. Formal Aspects Comput. Martin Fränzle, Deepak Kapur, Heike Wehrheim, Naijun Zhan
2019	A	`conf`	NIL: Learning Nonlinear Interpolants. CADE Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan
2019	J	`jnl`	NIL: Learning Nonlinear Interpolants. CoRR Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan
2019	J	`jnl`	Using Dynamic Analysis to Generate Disjunctive Invariants. CoRR ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest
2018	B	`conf`	An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. ISSAC Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang
2017	J	`jnl`	Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm. J. Syst. Sci. Complex. Deepak Kapur
2017	—	`conf`	Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation. TACAS (1) ThanhVu Nguyen, Westley Weimer, Deepak Kapur, Stephanie Forrest
2017	—	`conf`	Nonlinear Polynomials, Interpolants and Invariant Generation for System Analysis. SC²@ISSAC Deepak Kapur
2017	J	`jnl`	Preface - Special Issue of Selected Extended Papers of IJCAR 2014. J. Autom. Reason. Stéphane Demri, Deepak Kapur, Christoph Weidenbach
2017	C	`ed.`	Theoretical Aspects of Computing - ICTAC 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings ICTAC Dang Van Hung, Deepak Kapur
2016	Misc	`ed.`	Dependable Software Engineering: Theories, Tools, and Applications - Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings SETTA Martin Fränzle, Deepak Kapur, Naijun Zhan
2016	A	`conf`	Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF. IJCAR Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen
2016	J	`jnl`	Interpolation synthesis for quadratic polynomial inequalities and combination with \textit{EUF}. CoRR Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen
2015	B	`conf`	An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion Algorithm. ISSAC Deepak Kapur, Yiming Yang
2015	J	`jnl`	Decoding femininity in computer science in India. Commun. ACM Roli Varma, Deepak Kapur
2015	—	`conf`	Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2015	—	`conf`	When Is a Formula a Loop Invariant? Logic, Rewriting, and Concurrency Stephan Falke, Deepak Kapur
2014	B	`conf`	An Abstract Domain to Infer Octagonal Constraints with Absolute Value. SAS Liqian Chen, Jiangchao Liu, Antoine Miné, Deepak Kapur, Ji Wang
2014	A	`ed.`	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 IJCAR Stéphane Demri, Deepak Kapur, Christoph Weidenbach
2014	J	`jnl`	DIG: A Dynamic Invariant Generator for Polynomial and Array Invariants. ACM Trans. Softw. Eng. Methodol. ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest
2014	—	`conf`	Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2014	—	`conf`	On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen
2014	B	`conf`	On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen
2014	A*	`conf`	Using dynamic analysis to generate disjunctive invariants. ICSE ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest
2013	J	`jnl`	An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system. J. Symb. Comput. Deepak Kapur, Yao Sun, Dingkang Wang
2013	J	`jnl`	An efficient method for computing comprehensive Gröbner bases. J. Symb. Comput. Deepak Kapur, Yao Sun, Dingkang Wang
2013	A	`conf`	Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
2013	—	`conf`	Elimination Techniques for Program Analysis. Programming Logics Deepak Kapur
2013	—	`conf`	Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants. Automated Reasoning and Mathematics Deepak Kapur, Zhihai Zhang, Matthias Horbach, Hengjun Zhao, Qi Lu, ThanhVu Nguyen
2013	—	`conf`	Harald Ganzinger's Legacy: Contributions to Logics and Programming. Programming Logics Deepak Kapur, Robert Nieuwenhuis, Andrei Voronkov, Christoph Weidenbach, Reinhard Wilhelm
2013	—	`conf`	Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2013	A	`conf`	Hierarchical Combination. CADE Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2013	J	`jnl`	On invariant checking. J. Syst. Sci. Complex. Zhihai Zhang, Deepak Kapur
2013	J	`jnl`	Synthesizing Switching Controllers for Hybrid Systems by Continuous Invariant Generation CoRR Deepak Kapur, Naijun Zhan, Hengjun Zhao
2013	—	`conf`	Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants. Theories of Programming and Formal Methods Hengjun Zhao, Naijun Zhan, Deepak Kapur
2012	J	`jnl`	A "Hybrid" Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example CoRR Hengjun Zhao, Naijun Zhan, Deepak Kapur, Kim G. Larsen
2012	B	`conf`	A "Hybrid" Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example. FM Hengjun Zhao, Naijun Zhan, Deepak Kapur, Kim G. Larsen
2012	J	`jnl`	A brief introduction to Wen-Tsun Wu's academic career. J. Symb. Comput. Xiao-Shan Gao, Deepak Kapur
2012	A	`conf`	Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
2012	J	`jnl`	Preface. J. Symb. Comput. Xiao-Shan Gao, Deepak Kapur
2012	C	`conf`	Program Analysis Using Quantifier-Elimination Heuristics - (Extended Abstract). TAMC Deepak Kapur
2012	A	`conf`	Rewriting Induction + Linear Arithmetic = Decision Procedure. IJCAR Stephan Falke, Deepak Kapur
2012	—	`conf`	Termination Analysis of Imperative Programs Using Bitvector Arithmetic. VSTTE Stephan Falke, Deepak Kapur, Carsten Sinz
2012	A*	`conf`	Using dynamic analysis to discover polynomial and array invariants. ICSE ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest
2011	—	`conf`	Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. UNIF Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
2011	B	`conf`	Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. ISSAC Deepak Kapur, Yao Sun, Dingkang Wang
2011	C	`conf`	Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
2011	—	`conf`	Termination Analysis of C Programs Using Compiler Intermediate Languages. RTA Stephan Falke, Deepak Kapur, Carsten Sinz
2011	J	`jnl`	Unification over Distributive Exponentiation (Sub)Theories. J. Autom. Lang. Comb. Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran
2010	B	`conf`	A new algorithm for computing comprehensive Gröbner systems. ISSAC Deepak Kapur, Yao Sun, Dingkang Wang
2010	B	`conf`	Coverset Induction with Partiality and Subsorts: A Powerlist Case Study. ITP Joe Hendrix, Deepak Kapur, José Meseguer
2010	A*	`conf`	Idle Port Scanning and Non-interference Analysis of Network Protocol Stacks Using Model Checking. USENIX Security Symposium Roya Ensafi, Jong Chun Park, Deepak Kapur, Jedidiah R. Crandall
2010	A	`conf`	Induction, Invariants, and Abstraction. IJCAR Deepak Kapur
2010	B	`conf`	Shape Analysis with Reference Set Relations. VMCAI Mark Marron, Rupak Majumdar, Darko Stefanovic, Deepak Kapur
2010	—	`conf`	Unification modulo a partial theory of exponentiation UNIF Deepak Kapur, Andrew M. Marshall, Paliath Narendran
2009	A	`conf`	A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. CADE Stephan Falke, Deepak Kapur
2009	J	`jnl`	An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors. Math. Comput. Sci. Deepak Kapur, Yongyang Cai
2009	J	`jnl`	Cayley-Dixon projection operator for multi-univariate composed polynomials. J. Symb. Comput. Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair
2009	C	`conf`	Identification of logically related heap regions. ISMM Mark Marron, Deepak Kapur, Manuel V. Hermenegildo
2009	—	`conf`	Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures. WFLP Stephan Falke, Deepak Kapur
2008	—	`ed.`	Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers ASCM Deepak Kapur
2008	—	`conf`	Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. RTA Stephan Falke, Deepak Kapur
2008	B	`conf`	Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. CC Mark Marron, Manuel V. Hermenegildo, Deepak Kapur, Darko Stefanovic
2008	—	`conf`	Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. LCPC Mark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo
2008	—	`conf`	Multivariate Resultants in Bernstein Basis. Automated Deduction in Geometry Deepak Kapur, Manfred Minimair
2008	—	`conf`	Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures. WRS@RTA Stephan Falke, Deepak Kapur
2008	—	`conf`	Sharing analysis of arrays, collections, and recursive structures. PASTE Mark Marron, Mario Méndez-Lojo, Manuel V. Hermenegildo, Darko Stefanovic, Deepak Kapur
2007	J	`jnl`	Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Sci. Comput. Program. Enric Rodríguez-Carbonell, Deepak Kapur
2007	A	`conf`	Dependency Pairs for Rewriting with Non-free Constructors. CADE Stephan Falke, Deepak Kapur
2007	J	`jnl`	Generating all polynomial invariants in simple loops. J. Symb. Comput. Enric Rodríguez-Carbonell, Deepak Kapur
2007	—	`conf`	Heap analysis in the presence of collection libraries. PASTE Mark Marron, Darko Stefanovic, Manuel V. Hermenegildo, Deepak Kapur
2006	J	`jnl`	A Quantifier-Elimination Based Heuristic for Automatically Generating Inductive Assertions for Programs. J. Syst. Sci. Complex. Deepak Kapur
2006	—	`conf`	A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. LCPC Mark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo
2006	J	`jnl`	Bruno Buchberger - A life devoted to symbolic computation. J. Symb. Comput. Hoon Hong, Deepak Kapur, Peter Paule, Franz Winkler
2006	B	`conf`	Conditions for determinantal formula for resultant of a polynomial system. ISSAC Arthur D. Chtcherba, Deepak Kapur
2006	B	`conf`	Inductive Decidability Using Implicit Induction. LPAR Stephan Falke, Deepak Kapur
2006	—	`conf`	Interpolation for data structures. SIGSOFT FSE Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
2006	J	`jnl`	Preface on the contributed papers. J. Symb. Comput. Deepak Kapur
2006	J	`jnl`	Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reason. Jürgen Giesl, Deepak Kapur
2005	—	`conf`	A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning Deepak Kapur, Paliath Narendran, Lida Wang
2005	—	`conf`	Automatically Generating Loop Invariants Using Quantifier Elimination. Deduction and Applications Deepak Kapur
2005	B	`conf`	Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials. CASC Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair
2005	J	`jnl`	Preface. J. Autom. Reason. Jürgen Giesl, Deepak Kapur
2005	J	`jnl`	Preface. J. Autom. Reason. Jürgen Giesl, Deepak Kapur
2005	—	`conf`	Towards Dynamic Partitioning of Reactive System Behavior: A Train Controller Case Study. Monterey Workshop Victor L. Winter, Deepak Kapur
2004	B	`conf`	An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. SAS Enric Rodríguez-Carbonell, Deepak Kapur
2004	B	`conf`	Automatic generation of polynomial loop. ISSAC Enric Rodríguez-Carbonell, Deepak Kapur
2004	J	`jnl`	Constructing Sylvester-type resultant matrices using the Dixon formulation. J. Symb. Comput. Arthur D. Chtcherba, Deepak Kapur
2004	—	`ch.`	Formal Specifcation and Refinement of a Safe Train Control Function. Formal Methods for Embedded Distributed Systems Victor L. Winter, Deepak Kapur, G. Fuehrer
2004	J	`jnl`	Preface. J. Autom. Reason. Deepak Kapur
2004	J	`jnl`	Preface. J. Autom. Reason. Deepak Kapur
2004	J	`jnl`	Preface. J. Autom. Reason. Deepak Kapur, Laurent Vigneron
2004	C	`conf`	Program Verification Using Automatic Generation of Invariants. ICTAC Enric Rodríguez-Carbonell, Deepak Kapur
2004	J	`jnl`	Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. J. Symb. Comput. Arthur D. Chtcherba, Deepak Kapur
2004	B	`conf`	Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. ISSAC Arthur D. Chtcherba, Deepak Kapur
2003	—	`conf`	An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA Deepak Kapur, Paliath Narendran, Lida Wang
2003	J	`jnl`	Announcement. J. Autom. Reason. Deepak Kapur
2003	—	`conf`	Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions. TPHOLs Deepak Kapur, Nikita A. Sakhanenko
2003	—	`conf`	Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report. ASIAN Deepak Kapur, Mahadevan Subramaniam
2003	A	`conf`	Deciding Inductive Validity of Equations. CADE Jürgen Giesl, Deepak Kapur
2003	J	`jnl`	Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. J. Symb. Comput. Arthur D. Chtcherba, Deepak Kapur
2003	B	`conf`	Model Checking Reconfigurable Processor Configurations for Safety Properties. FPL John Cochran, Deepak Kapur, Darko Stefanovic
2003	J	`jnl`	On the relationship between the Dixon-based resultant construction and the supports of polynomial systems. SIGSAM Bull. Arthur D. Chtcherba, Deepak Kapur
2002	—	`conf`	A Rewrite Rule Based Framework for Combining Decision Procedures. FroCoS Deepak Kapur
2002	B	`conf`	On the efficiency and optimality of Dixon-based resultant methods. ISSAC Arthur D. Chtcherba, Deepak Kapur
2001	—	`conf`	A Survey: Applying Formal Methods to a Software Intensive System. HASE Adriaan de Groot, Jozef Hooman, Fabrice Kordon, Emmanuel Paviot-Adet, Isabelle Vernier-Mounier, Michel Lemoine, Gervais Gaudiére, Victor L. Winter, Deepak Kapur
2001	A	`conf`	Decidable Classes of Inductive Theorems. IJCAR Jürgen Giesl, Deepak Kapur
2001	—	`conf`	Dependency Pairs for Equational Rewriting. RTA Jürgen Giesl, Deepak Kapur
2001	C	`conf`	Designing a Controller for a Multi-Train Multi-Track System. ATMOS Deepak Kapur, Victor L. Winter, Raymond Berg
2001	—	`ch.`	Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic. Symbolic Algebraic Methods and Verification Methods Deepak Kapur
2000	B	`conf`	Conditions for exact resultants using the Dixon formulation. ISSAC Arthur D. Chtcherba, Deepak Kapur
2000	A	`conf`	Extending Decision Procedures with Induction Schemes. CADE Deepak Kapur, Mahadevan Subramaniam
2000	J	`jnl`	Using an induction prover for verifying arithmetic circuits. Int. J. Softw. Tools Technol. Transf. Deepak Kapur, Mahadevan Subramaniam
1998	J	`jnl`	Geometric, Algebraic, and Thermophysical Techniques for Object Recognition in IR Imagery. Comput. Vis. Image Underst. Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur
1998	—	`conf`	IBDL: A Language for Interface Behavior Specification and Testing. COOTS Sreenivasa Viswanadha, Deepak Kapur
1998	J	`jnl`	Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory. Formal Methods Syst. Des. Deepak Kapur, Mahadevan Subramaniam
1998	—	`conf`	Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover. ASIAN Deepak Kapur, Mahadevan Subramaniam
1998	—	`conf`	Proving Associative-Communicative Termination Using RPO-Compatible Orderings. FTP (LNCS Selection) Deepak Kapur, G. Sivakumar
1998	J	`jnl`	Transformational Methodology for Proving Termination of Logic Programs. J. Log. Program. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
1997	—	`conf`	A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. RTA Deepak Kapur, G. Sivakumar
1997	B	`conf`	Extraneous Factors in the Dixon Resultant Formulation. ISSAC Deepak Kapur, Tushar Saxena
1997	—	`conf`	Mechanizing Verification of Arithmetic Circuits: SRT Division. FSTTCS Deepak Kapur, Mahadevan Subramaniam
1997	J	`jnl`	Proving Termination of GHC Programs. New Gener. Comput. M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
1997	—	`conf`	Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification. TPHOLs Deepak Kapur
1997	—	`conf`	Shostak's Congruence Closure as Completion. RTA Deepak Kapur
1997	—	`conf`	Synthesizing Controllers for Hybrid Systems. HART Deepak Kapur, R. K. Shyamasundar
1996	—	`conf`	Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets. Automated Deduction in Geometry Deepak Kapur
1996	—	`conf`	Automating Induction over Mutually Recursive Functions. AMAST Deepak Kapur, Mahadevan Subramaniam
1996	C	`conf`	Automating Proofs of Integrity Constraints in Situation Calculus. ISMIS Leopoldo E. Bertossi, Javier Pinto, Pablo Sáez, Deepak Kapur, Mahadevan Subramaniam
1996	—	`conf`	Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. RTA Mark T. Vandevoorde, Deepak Kapur
1996	A	`conf`	Lemma Discovery in Automated Induction. CADE Deepak Kapur, Mahadevan Subramaniam
1996	A*	`conf`	Mechanically Verifying a Family of Multiplier Circuits. CAV Deepak Kapur, Mahadevan Subramaniam
1996	J	`jnl`	New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. J. Autom. Reason. Deepak Kapur, Mahadevan Subramaniam
1996	A	`conf`	Parallel User Interfaces for Parallel Applications. HPDC Mark T. Vandevoorde, Deepak Kapur
1996	—	`conf`	Rewrite-Based Automated Reasoning: Challenges Ahead. RTA Deepak Kapur
1996	A*	`conf`	Sparsity Considerations in Dixon Resultants. STOC Deepak Kapur, Tushar Saxena
1996	—	`conf`	Using Elimination Methods to Compute Thermophysical Algebraic Invariants from Infrared Imagery. AAAI/IAAI, Vol. 2 Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur
1995	J	`jnl`	A Path Ordering for Proving Termination of AC Rewrite Systems. J. Autom. Reason. Deepak Kapur, G. Sivakumar, Hantao Zhang
1995	—	`conf`	Automated Reasoning About Parallel Algorithms Using Powerlists. AMAST Deepak Kapur, Mahadevan Subramaniam
1995	B	`conf`	Comparison of Various Multivariate Resultant Formulations. ISSAC Deepak Kapur, Tushar Saxena
1995	—	`conf`	Maximal Extensions os Simplification Orderings. FSTTCS Deepak Kapur, G. Sivakumar
1994	B	`conf`	Algebraic and Geometric Reasoning Using Dixon Resultants. ISSAC Deepak Kapur, Tushar Saxena, Lu Yang
1994	A	`conf`	An Automated Tool for Analyzing Completeness of Equational Specifications. ISSTA Deepak Kapur
1994	J	`jnl`	An Overview of the Tecton Proof System. Theor. Comput. Sci. Deepak Kapur, Xumin Nie, David R. Musser
1994	—	`conf`	Using Linear Arithmetic Procedure for Generating Induction Schemes. FSTTCS Deepak Kapur, Mahadevan Subramaniam
1993	B	`conf`	Proving Termination of GHC Programs. ICLP M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
1992	A	`ed.`	Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings CADE Deepak Kapur
1992	J	`jnl`	Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reason. Deepak Kapur, Paliath Narendran
1992	A*	`conf`	Double-exponential Complexity of Computing a Complete Set of AC-Unifiers LICS Deepak Kapur, Paliath Narendran
1992	—	`conf`	Rewriting Concepts in the Study of Termination of Logic Programs. ALPUK R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur
1992	—	`conf`	The Tecton Proof System. Formal Methods in Databases and Software Engineering Deepak Kapur, David R. Musser, Xumin Nie
1991	—	`conf`	A Case Study of the Completion Procedure: Proving Ring Commutativity Problems. Computational Logic - Essays in Honor of Alan Robinson Deepak Kapur, Hantao Zhang
1991	B	`conf`	A Transformational Methodology for Proving Termination of Logic Programs. CSL M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
1991	J	`jnl`	Automating Inductionless Induction Using Test Sets. J. Symb. Comput. Deepak Kapur, Paliath Narendran, Hantao Zhang
1991	A*	`conf`	Modeling generic polyhedral objects with constraints. CVPR Van-Duc Nguyen, Joseph L. Mundy, Deepak Kapur
1991	J	`jnl`	Semi-Unification. Theor. Comput. Sci. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
1991	J	`jnl`	Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang
1991	—	`conf`	The Tecton Proof System. RTA Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie
1990	—	`conf`	A New Method for Proving Termination of AC-Rewrite Systems. FSTTCS Deepak Kapur, G. Sivakumar, Hantao Zhang
1990	J	`jnl`	Inference Rules and Proof Procedures for Inequations. J. Log. Program. Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur
1990	J	`jnl`	On Ground-Confluence of Term Rewriting Systems Inf. Comput. Deepak Kapur, Paliath Narendran, Friedrich Otto
1990	B	`conf`	Refutational Proofs of Geometry Theorems via Characteristic Set Computation. ISSAC Deepak Kapur, H. K. Wan
1990	J	`jnl`	Unnecessary Inferences in Associative-Commutative Completion Procedures. Math. Syst. Theory Hantao Zhang, Deepak Kapur
1989	—	`conf`	A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra. Computers and Mathematics Deepak Kapur, Klaus Madlener
1989	—	`conf`	An Overview of Rewrite Rule Laboratory (RRL). RTA Deepak Kapur, Hantao Zhang
1989	—	`conf`	Consider Only General Superpositions in Completion Procedures. RTA Hantao Zhang, Deepak Kapur
1988	A	`conf`	A Mechanizable Induction Principle for Equational Specifications. CADE Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy
1988	J	`jnl`	A Multi-Level Geometric Reasoning System for Vision. Artif. Intell. Michele Barry, David Cyrluk, Deepak Kapur, Joseph L. Mundy, Van-Duc Nguyen
1988	J	`jnl`	A Refutational Approach to Geometry Theorem Proving. Artif. Intell. Deepak Kapur
1988	J	`jnl`	Computability and Implementability Issues in Abstract Data Types. Sci. Comput. Program. Deepak Kapur, Mandayam K. Srivas
1988	J	`jnl`	Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain. J. Symb. Comput. Abdelilah Kandri-Rody, Deepak Kapur
1988	A	`conf`	First-Order Theorem Proving Using Conditional Rewrite Rules. CADE Hantao Zhang, Deepak Kapur
1988	A	`conf`	GEOMETER: A Theorem Prover for Algebraic Geometry. CADE David Cyrluk, Richard M. Harris, Deepak Kapur
1988	J	`jnl`	Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume. Artif. Intell. Deepak Kapur, Joseph L. Mundy
1988	J	`jnl`	Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. J. Symb. Comput. Deepak Kapur, David R. Musser, Paliath Narendran
1988	J	`jnl`	Opening the AC-Unification Race. J. Autom. Reason. Hans-Jürgen Bürckert, Alexander Herold, Deepak Kapur, Jörg H. Siekmann, Mark E. Stickel, Michael Tepp, Hantao Zhang
1988	J	`jnl`	Proving Equivalence of Different Axiomatizations of Free Groups. J. Autom. Reason. Deepak Kapur, Hantao Zhang
1988	A	`conf`	RRL: A Rewrite Rule Laboratory. CADE Deepak Kapur, Hantao Zhang
1988	—	`conf`	Semi-Unification. FSTTCS Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
1988	J	`jnl`	Wu's Method and its Application to Perspective Viewing. Artif. Intell. Deepak Kapur, Joseph L. Mundy
1987	J	`jnl`	Complexity of Matching Problems. J. Symb. Comput. Dan Benanav, Deepak Kapur, Paliath Narendran
1987	J	`jnl`	Matching, unification and complexity. SIGSAM Bull. Deepak Kapur, Paliath Narendran
1987	J	`jnl`	On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Informatica Deepak Kapur, Paliath Narendran, Hantao Zhang
1987	J	`jnl`	Proof by Consistency. Artif. Intell. Deepak Kapur, David R. Musser
1987	—	`conf`	Reasoning in Systems of Equations and Inequations. FSTTCS Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur
1986	—	`conf`	Complexity of Sufficient-Completeness. FSTTCS Deepak Kapur, Paliath Narendran, Hantao Zhang
1986	—	`conf`	Geometry theorem proving using Hilbert's Nullstellensatz. SYMSAC Deepak Kapur
1986	A*	`conf`	Inductive Reasoning with Incomplete Specifications (Preliminary Report) LICS Deepak Kapur, David R. Musser
1986	A	`conf`	NP-Completeness of the Set Unification and Matching Problems. CADE Deepak Kapur, Paliath Narendran
1986	A	`conf`	Proof by Induction Using Test Sets. CADE Deepak Kapur, Paliath Narendran, Hantao Zhang
1986	A	`conf`	RRL: A Rewrite Rule Laboratory. CADE Deepak Kapur, G. Sivakumar, Hantao Zhang
1986	J	`jnl`	Using Gröbner Bases to Reason About Geometry Problems. J. Symb. Comput. Deepak Kapur
1985	J	`jnl`	A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. Theor. Comput. Sci. Deepak Kapur, Paliath Narendran
1985	—	`conf`	A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 Deepak Kapur, Paliath Narendran, G. Sivakumar
1985	—	`conf`	A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. TAPSOFT, Vol.1 Deepak Kapur, Mandayam K. Srivas
1985	A*	`conf`	An Equational Approach to Theorem Proving in First-Order Predicate Calculus. IJCAI Deepak Kapur, Paliath Narendran
1985	—	`conf`	An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. RTA Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran
1985	J	`jnl`	An O(\|T\|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. Theor. Comput. Sci. Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran
1985	J	`jnl`	An equational approach to theorem proving in first-order predicate calculus. ACM SIGSOFT Softw. Eng. Notes Deepak Kapur, Paliath Narendran
1985	—	`conf`	Complexity of Matching Problems. RTA Dan Benanav, Deepak Kapur, Paliath Narendran
1985	J	`jnl`	RRL: theorem proving environment based on rewriting techniques. ACM SIGSOFT Softw. Eng. Notes Deepak Kapur, G. Sivakumar
1985	A*	`conf`	Reasoning about three dimensional space. ICRA Deepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran
1985	J	`jnl`	The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton
1985	J	`jnl`	The Knuth-Bendix Completion Procedure and Thue Systems. SIAM J. Comput. Deepak Kapur, Paliath Narendran
1985	J	`jnl`	Worst-Case Choice for the Stable Marriage Problem. Inf. Process. Lett. Deepak Kapur, Mukkai S. Krishnamoorthy
1984	A	`conf`	A Natural Proof System Based on rewriting Techniques. CADE Deepak Kapur, Balakrishnan Krishnamurthy
1984	—	`conf`	Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings. EUROSAM Abdelilah Kandri-Rody, Deepak Kapur
1983	J	`jnl`	On Proving Uniform Termination and Restricted Termination of Rewriting Systems. SIAM J. Comput. John V. Guttag, Deepak Kapur, David R. Musser
1982	A*	`conf`	Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. ICALP John V. Guttag, Deepak Kapur, David R. Musser
1982	—	`conf`	Rewrite Rule Theory and Abstract Data Type Analysis. EUROCAM David R. Musser, Deepak Kapur
1981	—	`conf`	Operators and algebraic structures. FPCA Deepak Kapur, David R. Musser, Alexander A. Stepanov
1981	—	`conf`	Tecton: A Language for Manipulating Generic Objects. Program Specification Deepak Kapur, David R. Musser, Alexander A. Stepanov
1980	A*	`conf`	Expressiveness of the Operation Set of a Data Abstraction. POPL Deepak Kapur, Mandayam K. Srivas
1979	J	`jnl`	Specifications of Majster's traversable stack and Veloso's traversable stack. ACM SIGPLAN Notices Deepak Kapur