- Proving AssociativeCommutative Termination Using RPOcompatible Orderings ?
- DOUBLEEXPONENTIAL COMPLEXITY OF COMPUTING A COMPLETE SET OF ACUNIFIERS
- A New Algorithm for Computing Comprehensive Grbner Systems
- Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations
- To appear in the Proceedings of International Symposium on Symbolic
- Extracting Sparse Resultant Matrices from Dixon Resultant Formulation
- Mechanizing Verification of Arithmetic Circuits: SRT Division ?
- Synthesizing Controllers for Hybrid Systems ? Deepak Kapur 1 and R.K. Shyamasundar 2
- Theorem Proving Support for Hardware Veri cation |Preliminary Draft|
- 1 An Approach for Solving Systems of Parametric Polynomial Equations
- Decidable Classes of Inductive Theorems ? Jurgen Giesl 1 and Deepak Kapur 2
- Dependency Pairs for Equational Rewriting ? Jurgen Giesl 1 and Deepak Kapur 2
- Model Checking Reconfigurable Processor Configurations for Safety Properties
- Inductive Decidability Using Implicit Stephan Falke and Deepak Kapur
- An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants
- Sparsity Considerations in Dixon Resultants \Lambda Deepak Kapur and Tushar Saxena
- Conditions for Exact Resultants using the Dixon Formulation Arthur D. Chtcherba Deepak Kapur
- Static Heap Analysis for Automatic Parallelization Mark Marron, Deepak Kapur, Darko Stefanovic, and Manuel Hermenegildo
- New Uses of Linear Arithmetic in Automated Theorem Proving by Induction \Lambda
- Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic
- Solving Polynomial Systems Using a Branch and Prune Approach P. Van Hentenryck
- An E-uni cation Algorithm for Analyzing Protocols that Use Modular Exponentiation
- A Completion Procedure for Computing a Canonical Basis for a kSubalgebra
- Algebraic and Geometric Reasoning using Dixon Resultants \Lambda Deepak Kapur and Tushar Saxena
- Applications of Computer Algebra (ACA-2004) Automatically Generating Loop Invariants
- Interpolation for Data Structures Deepak Kapur
- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
- Dependency Pairs for Rewriting with Built-in Numbers and Semantic Data Structures
- Shostak's Congruence Closure as Completion Deepak Kapur ?
- 8 Constructors Can Be Partial, Too Deepak Kapur 1
- A Reduction Approach to Decision Procedures Deepak Kapur and Calogero G. Zarba
- To appear in EPTCS. c D. Kapur, A. Marshall & P. Narendran Unification modulo a partial theory of exponentiation
- Dependency Pairs for Rewriting with Non-Free Constructors
- Electronic Notes in Theoretical Computer Science 50 No. 1 (2001) { Proc. ATMOS 2001 URL: http://www.elsevier.nl/locate/entcs/volume50.html
- Extending Decision Procedures with Induction Deepak Kapur 1? and M. Subramaniam 2
- Automated Geometric Reasoning: Dixon Resultants, Grobner Bases, and Characteristic Sets
- An Overview of the Tecton Proof System \Lambda
- An Overview of Rewrite Rule Laboratory (RRL) Deepak Kapur \Lambda
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Identification of Logically Related Heap Regions Mark Marron1, Deepak Kapur2, and Manuel Hermenegildo1
