Deepak Kapur

	2012
161		Deepak Kapur: Program Analysis Using Quantifier-Elimination Heuristics - (Extended Abstract). TAMC 2012: 94-108
160		Stephan Falke, Deepak Kapur, Carsten Sinz: Termination Analysis of Imperative Programs Using Bitvector Arithmetic. VSTTE 2012: 261-277
159		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)
158		Xiao-Shan Gao, Deepak Kapur: Preface. J. Symb. Comput. 47(6): 583-585 (2012)
157		Xiao-Shan Gao, Deepak Kapur: A brief introduction to Wen-Tsun Wu's academic career. J. Symb. Comput. 47(6): 586-588 (2012)
	2011
156		Deepak Kapur, Yao Sun, Dingkang Wang: Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. ISSAC 2011: 193-200
155		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
154		Stephan Falke, Deepak Kapur, Carsten Sinz: Termination Analysis of C Programs Using Compiler Intermediate Languages. RTA 2011: 41-50
	2010
153		Deepak Kapur: Induction, Invariants, and Abstraction. IJCAR 2010: 353
152		Deepak Kapur, Yao Sun, Dingkang Wang: A new algorithm for computing comprehensive Gröbner systems. ISSAC 2010: 29-36
151		Joe Hendrix, Deepak Kapur, José Meseguer: Coverset Induction with Partiality and Subsorts: A Powerlist Case Study. ITP 2010: 275-290
150		Deepak Kapur, Andrew M. Marshall, Paliath Narendran: Unification modulo a partial theory of exponentiation UNIF 2010: 12-23
149		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
148		Mark Marron, Rupak Majumdar, Darko Stefanovic, Deepak Kapur: Shape Analysis with Reference Set Relations. VMCAI 2010: 247-262
	2009
147		Stephan Falke, Deepak Kapur: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. CADE 2009: 277-293
146		Mark Marron, Deepak Kapur, Manuel V. Hermenegildo: Identification of logically related heap regions. ISMM 2009: 89-98
145		Stephan Falke, Deepak Kapur: Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures. WFLP 2009: 44-61
144		Stephan Falke, Deepak Kapur: Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures. Electr. Notes Theor. Comput. Sci. 237: 75-90 (2009)
143		Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair: Cayley-Dixon projection operator for multi-univariate composed polynomials. J. Symb. Comput. 44(8): 972-999 (2009)
142		Deepak Kapur, Yongyang Cai: An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors. Mathematics in Computer Science 2(4): 601-634 (2009)
	2008
141		Deepak Kapur: Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers Springer 2008
140		Deepak Kapur, Manfred Minimair: Multivariate Resultants in Bernstein Basis. Automated Deduction in Geometry 2008: 60-85
139		Mark Marron, Manuel V. Hermenegildo, Deepak Kapur, Darko Stefanovic: Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. CC 2008: 245-259
138		Mark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo: Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. LCPC 2008: 94-108
137		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
136		Stephan Falke, Deepak Kapur: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. RTA 2008: 94-109
	2007
135		Stephan Falke, Deepak Kapur: Dependency Pairs for Rewriting with Non-free Constructors. CADE 2007: 426-442
134		Mark Marron, Darko Stefanovic, Manuel V. Hermenegildo, Deepak Kapur: Heap analysis in the presence of collection libraries. PASTE 2007: 31-36
133		Enric Rodríguez-Carbonell, Deepak Kapur: Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4): 443-476 (2007)
132		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)
	2006
131		Arthur D. Chtcherba, Deepak Kapur: Conditions for determinantal formula for resultant of a polynomial system. ISSAC 2006: 55-62
130		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
129		Stephan Falke, Deepak Kapur: Inductive Decidability Using Implicit Induction. LPAR 2006: 45-59
128		Deepak Kapur, Rupak Majumdar, Calogero G. Zarba: Interpolation for data structures. SIGSOFT FSE 2006: 105-116
127		Jürgen Giesl, Deepak Kapur: Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reasoning 37(3): 153-154 (2006)
126		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)
125		Deepak Kapur: Preface on the contributed papers. J. Symb. Comput. 41(3-4): 259-260 (2006)
	2005
124		Arthur D. Chtcherba, Deepak Kapur, Manfred Minimair: Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials. CASC 2005: 125-137
123		Deepak Kapur: Automatically Generating Loop Invariants Using Quantifier Elimination. Deduction and Applications 2005
122		Deepak Kapur, Paliath Narendran, Lida Wang: A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning 2005: 433-451
121		Victor L. Winter, Deepak Kapur: Towards Dynamic Partitioning of Reactive System Behavior: A Train Controller Case Study. Monterey Workshop 2005: 47-69
120		Jürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(2): 103-104 (2005)
119		Jürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(4): 323 (2005)
	2004
118		Enric Rodríguez-Carbonell, Deepak Kapur: Program Verification Using Automatic Generation of Invariants. ICTAC 2004: 325-340
117		Enric Rodríguez-Carbonell, Deepak Kapur: Automatic generation of polynomial loop. ISSAC 2004: 266-273
116		Arthur D. Chtcherba, Deepak Kapur: Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. ISSAC 2004: 95-102
115		Enric Rodríguez-Carbonell, Deepak Kapur: An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. SAS 2004: 280-295
114		Deepak Kapur: Preface. J. Autom. Reasoning 32(1): 1-2 (2004)
113		Deepak Kapur: Preface. J. Autom. Reasoning 32(3): 185-186 (2004)
112		Deepak Kapur, Laurent Vigneron: Preface. J. Autom. Reasoning 33(3-4): 219-220 (2004)
111		Arthur D. Chtcherba, Deepak Kapur: Constructing Sylvester-type resultant matrices using the Dixon formulation. J. Symb. Comput. 38(1): 777-814 (2004)
110		Arthur D. Chtcherba, Deepak Kapur: Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. J. Symb. Comput. 38(2): 915-958 (2004)
	2003
109		Deepak Kapur, Mahadevan Subramaniam: Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report. ASIAN 2003: 125-145
108		Jürgen Giesl, Deepak Kapur: Deciding Inductive Validity of Equations. CADE 2003: 17-31
107		John Cochran, Deepak Kapur, Darko Stefanovic: Model Checking Reconfigurable Processor Configurations for Safety Properties. FPL 2003: 996-999
106		Deepak Kapur, Paliath Narendran, Lida Wang: An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA 2003: 165-179
105		Deepak Kapur, Nikita A. Sakhanenko: Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions. TPHOLs 2003: 136-154
104		Deepak Kapur: Announcement. J. Autom. Reasoning 31(2): 105-105 (2003)
103		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)
	2002
102		Deepak Kapur: A Rewrite Rule Based Framework for Combining Decision Procedures. FroCos 2002: 87-102
101		Arthur D. Chtcherba, Deepak Kapur: On the efficiency and optimality of Dixon-based resultant methods. ISSAC 2002: 29-36
	2001
100		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
99		Jürgen Giesl, Deepak Kapur: Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484
98		Jürgen Giesl, Deepak Kapur: Dependency Pairs for Equational Rewriting. RTA 2001: 93-108
97		Deepak Kapur: Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic. Symbolic Algebraic Methods and Verification Methods 2001: 129-144
96		Deepak Kapur, Victor L. Winter, Raymond Berg: Designing a Controller for a Multi-Train Multi-Track System. Electr. Notes Theor. Comput. Sci. 50(1): 65-79 (2001)
	2000
95		Deepak Kapur, Mahadevan Subramaniam: Extending Decision Procedures with Induction Schemes. CADE 2000: 324-345
94		Arthur D. Chtcherba, Deepak Kapur: Conditions for exact resultants using the Dixon formulation. ISSAC 2000: 62-70
93		Deepak Kapur, Mahadevan Subramaniam: Using an induction prover for verifying arithmetic circuits. STTT 3(1): 32-65 (2000)
	1998
92		Deepak Kapur, Mahadevan Subramaniam: Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover. ASIAN 1998: 22-42
91		Sreenivasa Viswanadha, Deepak Kapur: IBDL: A Language for Interface Behavior Specification and Testing. COOTS 1998: 235-248
90		Deepak Kapur, G. Sivakumar: Proving Associative-Communicative Termination Using RPO-Compatible Orderings. FTP (LNCS Selection) 1998: 39-61
89		Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur: Geometric, Algebraic, and Thermophysical Techniques for Object Recognition in IR Imagery. Computer Vision and Image Understanding 72(1): 84-97 (1998)
88		Deepak Kapur, Mahadevan Subramaniam: Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory. Formal Methods in System Design 13(2): 127-158 (1998)
87		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)
	1997
86		Deepak Kapur, Mahadevan Subramaniam: Mechanizing Verification of Arithmetic Circuits: SRT Division. FSTTCS 1997: 103-122
85		Deepak Kapur, R. K. Shyamasundar: Synthesizing Controllers for Hybrid Systems. HART 1997: 361-375
84		Deepak Kapur, Tushar Saxena: Extraneous Factors in the Dixon Resultant Formulation. ISSAC 1997: 141-148
83		Deepak Kapur, G. Sivakumar: A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. RTA 1997: 142-156
82		Deepak Kapur: Shostak's Congruence Closure as Completion. RTA 1997: 23-37
81		Deepak Kapur: Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification. TPHOLs 1997: 171-182
80		M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Proving Termination of GHC Programs. New Generation Comput. 15(3): 293-338 (1997)
	1996
79		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
78		Deepak Kapur, Mahadevan Subramaniam: Automating Induction over Mutually Recursive Functions. AMAST 1996: 117-131
77		Deepak Kapur: Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets. Automated Deduction in Geometry 1996: 1-36
76		Deepak Kapur, Mahadevan Subramaniam: Lemma Discovery in Automated Induction. CADE 1996: 538-552
75		Deepak Kapur, Mahadevan Subramaniam: Mechanically Verifying a Family of Multiplier Circuits. CAV 1996: 135-146
74		Mark T. Vandevoorde, Deepak Kapur: Parallel User Interfaces for Parallel Applications. HPDC 1996: 161-
73		Leopoldo E. Bertossi, Javier Pinto, Pablo Sáez, Deepak Kapur, Mahadevan Subramaniam: Automating Proofs of Integrity Constraints in Situation Calculus. ISMIS 1996: 212-222
72		Deepak Kapur: Rewrite-Based Automated Reasoning: Challenges Ahead. RTA 1996: 1-2
71		Mark T. Vandevoorde, Deepak Kapur: Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. RTA 1996: 420-423
70		Deepak Kapur, Tushar Saxena: Sparsity Considerations in Dixon Resultants. STOC 1996: 184-191
69		Deepak Kapur, Mahadevan Subramaniam: New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. J. Autom. Reasoning 16(1-2): 39-78 (1996)
	1995
68		Deepak Kapur, Mahadevan Subramaniam: Automated Reasoning About Parallel Algorithms Using Powerlists. AMAST 1995: 416-430
67		Deepak Kapur, G. Sivakumar: Maximal Extensions os Simplification Orderings. FSTTCS 1995: 225-239
66		Deepak Kapur, Tushar Saxena: Comparison of Various Multivariate Resultant Formulations. ISSAC 1995: 187-194
65		Deepak Kapur, G. Sivakumar, Hantao Zhang: A Path Ordering for Proving Termination of AC Rewrite Systems. J. Autom. Reasoning 14(2): 293-316 (1995)
	1994
64		Deepak Kapur, Mahadevan Subramaniam: Using Linear Arithmetic Procedure for Generating Induction Schemes. FSTTCS 1994: 438-449
63		Deepak Kapur, Tushar Saxena, Lu Yang: Algebraic and Geometric Reasoning Using Dixon Resultants. ISSAC 1994: 99-107
62		Deepak Kapur: An Automated Tool for Analyzing Completeness of Equational Specifications. ISSTA 1994: 28-43
61		Deepak Kapur, Xumin Nie, David R. Musser: An Overview of the Tecton Proof System. Theor. Comput. Sci. 133(2): 307-339 (1994)
	1993
60		M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Proving Termination of GHC Programs. ICLP 1993: 720-736
	1992
59		Deepak Kapur: Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings Springer 1992
58		R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur: Rewriting Concepts in the Study of Termination of Logic Programs. ALPUK 1992: 3-20
57		Deepak Kapur, David R. Musser, Xumin Nie: The Tecton Proof System. Formal Methods in Databases and Software Engineering 1992: 54-79
56		Deepak Kapur, Paliath Narendran: Double-exponential Complexity of Computing a Complete Set of AC-Unifiers LICS 1992: 11-21
55		Deepak Kapur, Paliath Narendran: Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reasoning 9(2): 261-288 (1992)
	1991
54		M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: A Transformational Methodology for Proving Termination of Logic Programs. CSL 1991: 213-226
53		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
52		Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie: The Tecton Proof System. RTA 1991: 442-444
51		Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang: Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Inf. 28(4): 311-350 (1991)
50		Deepak Kapur, Paliath Narendran, Hantao Zhang: Automating Inductionless Induction Using Test Sets. J. Symb. Comput. 11(1/2): 81-111 (1991)
49		Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman: Semi-Unification. Theor. Comput. Sci. 81(2): 169-187 (1991)
	1990
48		Deepak Kapur, G. Sivakumar, Hantao Zhang: A New Method for Proving Termination of AC-Rewrite Systems. FSTTCS 1990: 133-148
47		Deepak Kapur, H. K. Wan: Refutational Proofs of Geometry Theorems via Characteristic Set Computation. ISSAC 1990: 277-284
46		Deepak Kapur, Paliath Narendran, Friedrich Otto: On Ground-Confluence of Term Rewriting Systems Inf. Comput. 86(1): 14-31 (1990)
45		Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur: Inference Rules and Proof Procedures for Inequations. J. Log. Program. 9(1): 75-104 (1990)
44		Hantao Zhang, Deepak Kapur: Unnecessary Inferences in Associative-Commutative Completion Procedures. Mathematical Systems Theory 23(3): 175-206 (1990)
	1989
43		Hantao Zhang, Deepak Kapur: Consider Only General Superpositions in Completion Procedures. RTA 1989: 513-527
42		Deepak Kapur, Hantao Zhang: An Overview of Rewrite Rule Laboratory (RRL). RTA 1989: 559-563
	1988
41		Hantao Zhang, Deepak Kapur: First-Order Theorem Proving Using Conditional Rewrite Rules. CADE 1988: 1-20
40		Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy: A Mechanizable Induction Principle for Equational Specifications. CADE 1988: 162-181
39		Deepak Kapur, Hantao Zhang: RRL: A Rewrite Rule Laboratory. CADE 1988: 768-769
38		David Cyrluk, Richard M. Harris, Deepak Kapur: GEOMETER: A Theorem Prover for Algebraic Geometry. CADE 1988: 770-771
37		Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman: Semi-Unification. FSTTCS 1988: 435-454
36		Deepak Kapur, Joseph L. Mundy: Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume. Artif. Intell. 37(1-3): 1-11 (1988)
35		Deepak Kapur, Joseph L. Mundy: Wu's Method and its Application to Perspective Viewing. Artif. Intell. 37(1-3): 15-36 (1988)
34		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)
33		Deepak Kapur: A Refutational Approach to Geometry Theorem Proving. Artif. Intell. 37(1-3): 61-93 (1988)
32		Deepak Kapur, Hantao Zhang: Proving Equivalence of Different Axiomatizations of Free Groups. J. Autom. Reasoning 4(3): 331-352 (1988)
31		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. Reasoning 4(4): 465-474 (1988)
30		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)
29		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)
28		Deepak Kapur, Mandayam K. Srivas: Computability and Implementability Issues in Abstract Data Types. Sci. Comput. Program. 10(1): 33-63 (1988)
	1987
27		Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur: Reasoning in Systems of Equations and Inequations. FSTTCS 1987: 305-325
26		Deepak Kapur, Paliath Narendran, Hantao Zhang: On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Inf. 24(4): 395-415 (1987)
25		Deepak Kapur, David R. Musser: Proof by Consistency. Artif. Intell. 31(2): 125-157 (1987)
24		Dan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. J. Symb. Comput. 3(1/2): 203-216 (1987)
	1986
23		Deepak Kapur, Paliath Narendran: NP-Completeness of the Set Unification and Matching Problems. CADE 1986: 489-495
22		Deepak Kapur, G. Sivakumar, Hantao Zhang: RRL: A Rewrite Rule Laboratory. CADE 1986: 691-692
21		Deepak Kapur, Paliath Narendran, Hantao Zhang: Proof by Induction Using Test Sets. CADE 1986: 99-117
20		Deepak Kapur, Paliath Narendran, Hantao Zhang: Complexity of Sufficient-Completeness. FSTTCS 1986: 426-442
19		Deepak Kapur, David R. Musser: Inductive Reasoning with Incomplete Specifications (Preliminary Report) LICS 1986: 367-377
18		Deepak Kapur: Using Gröbner Bases to Reason About Geometry Problems. J. Symb. Comput. 2(4): 399-408 (1986)
	1985
17		Deepak Kapur, Paliath Narendran: An Equational Approach to Theorem Proving in First-Order Predicate Calculus. IJCAI 1985: 1146-1153
16		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
15		Dan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. RTA 1985: 417-429
14		Deepak Kapur, Paliath Narendran, G. Sivakumar: A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 1985: 173-187
13		Deepak Kapur, Mandayam K. Srivas: A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. TAPSOFT, Vol.1 1985: 188-207
12		Deepak Kapur, Mukkai S. Krishnamoorthy: Worst-Case Choice for the Stable Marriage Problem. Inf. Process. Lett. 21(1): 27-30 (1985)
11		Deepak Kapur, Paliath Narendran: The Knuth-Bendix Completion Procedure and Thue Systems. SIAM J. Comput. 14(4): 1052-1072 (1985)
10		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)
9		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)
8		Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton: The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. 39: 123-133 (1985)
	1984
7		Deepak Kapur, Balakrishnan Krishnamurthy: A Natural Proof System Based on rewriting Techniques. CADE 1984: 53-64
6		Abdelilah Kandri-Rody, Deepak Kapur: Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings. EUROSAM 1984: 195-206
	1983
5		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
4		David R. Musser, Deepak Kapur: Rewrite Rule Theory and Abstract Data Type Analysis. EUROCAM 1982: 77-90
3		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
2		Deepak Kapur, David R. Musser, Alexander A. Stepanov: Tecton: A Language for Manipulating Generic Objects. Program Specification 1981: 402-414
	1980
1		Deepak Kapur, Mandayam K. Srivas: Expressiveness of the Operation Set of a Data Abstraction. POPL 1980: 139-153

Coauthor Index

1	Raj Agarwal	[52]
2	Michele Barry	[34]
3	Dan Benanav	[15] [24]
4	Raymond Berg	[96]
5	Leopoldo E. Bertossi	[73]
6	Hans-Jürgen Bürckert	[31]
7	Yongyang Cai	[142]
8	Arthur D. Chtcherba	[94] [101] [103] [110] [111] [116] [124] [131] [143]
9	John Cochran	[107]
10	Jedidiah R. Crandall	[149]
11	David Cyrluk	[34] [38]
12	Roya Ensafi	[149]
13	Santiago Escobar	[155]
14	Stephan Falke	[129] [135] [136] [144] [145] [147] [154] [160]
15	Xiao-Shan Gao	[157] [158]
16	Gervais Gaudiére	[100]
17	Jürgen Giesl	[98] [99] [108] [119] [120] [127]
18	Adriaan de Groot	[100]
19	John V. Guttag	[3] [5]
20	Richard M. Harris	[38]
21	Joe Hendrix	[151]
22	Manuel V. Hermenegildo	[130] [134] [137] [138] [139] [146]
23	Alexander Herold	[31]
24	Hoon Hong	[126]
25	Jozef Hooman	[100]
26	Abdelilah Kandri-Rody	[6] [16] [29]
27	Fabrice Kordon	[100]
28	Mukkai S. Krishnamoorthy	[8] [10] [12] [40]
29	Balakrishnan Krishnamurthy	[7]
30	Kim Guldstrand Larsen (Kim G. Larsen)	[159]
31	Michel Lemoine	[100]
32	Christopher Lynch	[155]
33	Rupak Majumdar	[128] [148]
34	Mark Marron	[130] [134] [137] [138] [139] [146] [148]
35	Andrew M. Marshall	[150]
36	Robert McNaughton	[8] [10]
37	Catherine Meadows	[155]
38	Mario Méndez-Lojo	[137]
39	José Meseguer	[151] [155]
40	Jonathan D. Michel	[79] [89]
41	Manfred Minimair	[124] [140] [143]
42	Chilukuri K. Mohan	[27] [45]
43	Joseph L. Mundy	[34] [35] [36]
44	David R. Musser	[2] [3] [4] [5] [19] [25] [30] [37] [49] [52] [57] [61]
45	Nagaraj Nandhakumar	[79] [89]
46	Paliath Narendran	[8] [9] [10] [11] [14] [15] [16] [17] [20] [21] [23] [24] [26] [30] [37] [46] [49] [50] [51] [55] [56] [106] [122] [150] [155]
47	Van-Duc Nguyen	[34]
48	Xumin Nie	[52] [57] [61]
49	Friedrich Otto	[46]
50	Jong Chun Park	[149]
51	Peter Paule	[126]
52	Emmanuel Paviot-Adet	[100]
53	Javier Pinto	[73]
54	M. R. K. Krishna Rao	[54] [58] [60] [80] [87]
55	Enric Rodríguez-Carbonell	[115] [117] [118] [132] [133]
56	Daniel J. Rosenkrantz	[51]
57	Pablo Sáez	[73]
58	Nikita A. Sakhanenko	[105]
59	Ralf Sasse	[155]
60	Tushar Saxena	[63] [66] [70] [79] [84] [89]
61	R. K. Shyamasundar (Rudrapatna K. Shyamasundar)	[54] [58] [60] [80] [85] [87]
62	Jörg H. Siekmann	[31]
63	Carsten Sinz	[154] [160]
64	G. Sivakumar	[14] [22] [48] [65] [67] [83] [90]
65	Mandayam K. Srivas	[1] [13] [27] [28] [45]
66	Darko Stefanovic	[107] [130] [134] [137] [138] [139] [148]
67	Alexander A. Stepanov	[2]
68	Mark E. Stickel	[31]
69	Jonathan Stillman	[37] [49]
70	Mahadevan Subramaniam	[64] [68] [69] [73] [75] [76] [78] [86] [88] [92] [93] [95] [109]
71	Yao Sun	[152] [156]
72	Michael Tepp	[31]
73	Mark T. Vandevoorde	[71] [74]
74	Isabelle Vernier-Mounier	[100]
75	Laurent Vigneron	[112]
76	Sreenivasa Viswanadha	[91]
77	H. K. Wan	[47]
78	Dingkang Wang	[152] [156]
79	Lida Wang	[106] [122]
80	Franz Winkler	[126]
81	Victor L. Winter	[96] [100] [121]
82	Lu Yang	[63]
83	Calogero G. Zarba	[128]
84	Naijun Zhan	[159]
85	Hantao Zhang	[20] [21] [22] [26] [31] [32] [39] [40] [41] [42] [43] [44] [48] [50] [51] [53] [65]
86	Hengjun Zhao	[159]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page