Travelled to:1 × Austria
1 × Canada
1 × India
1 × Ireland
1 × Serbia
1 × The Netherlands
18 × USA
2 × Germany
2 × Hungary
2 × Switzerland
2 × United Kingdom
3 × Denmark
3 × France
3 × Italy
3 × Spain
Collaborated with:P.Narendran H.Zhang S.Falke ∅ J.Giesl M.Subramaniam D.R.Musser M.Marron G.Sivakumar M.V.Hermenegildo M.T.Vandevoorde M.K.Srivas D.Stefanovic M.R.K.K.Rao R.K.Shyamasundar N.Zhan R.Majumdar T.Nguyen W.Weimer S.Forrest E.Rodríguez-Carbonell T.Saxena B.Krishnamurthy S.Erbatur C.Meadows A.M.Marshall C.Ringeissen C.Sinz C.G.Zarba L.Wang D.Cyrluk R.M.Harris M.S.Krishnamoorthy D.Benanav A.Kandri-Rody J.V.Guttag A.A.Stepanov M.Chen H.Zhao K.G.Larsen R.Agarwal X.Nie S.Escobar C.Lynch J.Meseguer R.Sasse L.Chen J.Liu A.Miné J.Wang M.Méndez-Lojo T.Gan L.Dai B.Xia J.W.0042 J.An B.Zhan Z.Liu S.Santiago
Talks about:rewrit (17) analysi (10) induct (9) unif (7) use (7) termin (6) system (6) rule (6) approach (5) abstract (5)
Person: Deepak Kapur
DBLP: Kapur:Deepak
Facilitated 2 volumes:
Ed
EdContributed to:
2014
2014
20142013
201220122012
2011
20112010
20102009
2009
2008
2008200820072007
200620042003200320012001200019971996
1996
19961996
1996
1994
1993
1992
19911991198919881986198619851984
19821981
1980
198520162019Wrote 59 papers:
- FoSSaCS-2014-ErbaturKMMNR #on the #problem #symmetry #unification
- On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
- ICSE-2014-NguyenKWF #dynamic analysis #invariant #using
- Using dynamic analysis to generate disjunctive invariants (TN, DK, WW, SF), pp. 608–619.
- SAS-2014-ChenLMKW #abstract domain #constraints
- An Abstract Domain to Infer Octagonal Constraints with Absolute Value (LC, JL, AM, DK, JW), pp. 101–117.
- CADE-2013-ErbaturEKLLMMNSS #analysis #encryption #paradigm #protocol #symmetry #unification
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (SE, SE, DK, ZL, CL, CM, JM, PN, SS, RS), pp. 231–248.
- CADE-2013-ErbaturKMNR
- Hierarchical Combination (SE, DK, AMM, PN, CR), pp. 249–266.
- FM-2012-ZhaoZKL #approach #case study #hybrid #industrial
- A “Hybrid” Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example (HZ, NZ, DK, KGL), pp. 471–485.
- ICSE-2012-NguyenKWF #array #dynamic analysis #invariant #polynomial #using
- Using dynamic analysis to discover polynomial and array invariants (TN, DK, WW, SF), pp. 683–693.
- IJCAR-2012-FalkeK #induction #linear
- Rewriting Induction + Linear Arithmetic = Decision Procedure (SF, DK), pp. 241–255.
- PPDP-2011-EscobarKLMMNS #analysis #encryption #protocol #unification #using
- Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (SE, DK, CL, CM, JM, PN, RS), pp. 65–76.
- RTA-2011-FalkeKS #analysis #c #compilation #source code #termination #using
- Termination Analysis of C Programs Using Compiler Intermediate Languages (SF, DK, CS), pp. 41–50.
- IJCAR-2010-Kapur #abstraction #induction #invariant
- Induction, Invariants, and Abstraction (DK), p. 353.
- VMCAI-2010-MarronMSK #analysis #set
- Shape Analysis with Reference Set Relations (MM, RM, DS, DK), pp. 247–262.
- CADE-2009-FalkeK #analysis #approach #automation #imperative #source code #term rewriting #termination
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.
- ISMM-2009-MarronKH #identification
- Identification of logically related heap regions (MM, DK, MVH), pp. 89–98.
- CC-2008-MarronHKS #analysis #graph #modelling #performance
- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models (MM, MVH, DK, DS), pp. 245–259.
- PASTE-2008-MarronMHSK #analysis #array #recursion
- Sharing analysis of arrays, collections, and recursive structures (MM, MML, MVH, DS, DK), pp. 43–49.
- RTA-2008-FalkeK #data type #dependence #semantics
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (SF, DK), pp. 94–109.
- CADE-2007-FalkeK #dependence
- Dependency Pairs for Rewriting with Non-free Constructors (SF, DK), pp. 426–442.
- PASTE-2007-MarronSHK #analysis #library
- Heap analysis in the presence of collection libraries (MM, DS, MVH, DK), pp. 31–36.
- FSE-2006-KapurMZ #data type
- Interpolation for data structures (DK, RM, CGZ), pp. 105–116.
- SAS-2004-Rodriguez-CarbonellK #abstract interpretation #approach #automation #generative #invariant #polynomial
- An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants (ERC, DK), pp. 280–295.
- CADE-2003-GieslK #equation #induction
- Deciding Inductive Validity of Equations (JG, DK), pp. 17–31.
- RTA-2003-KapurNW #algorithm #composition #protocol
- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation (DK, PN, LW), pp. 165–179.
- IJCAR-2001-GieslK #decidability #induction #theorem
- Decidable Classes of Inductive Theorems (JG, DK), pp. 469–484.
- RTA-2001-GieslK #dependence #equation
- Dependency Pairs for Equational Rewriting (JG, DK), pp. 93–108.
- CADE-2000-KapurS #induction
- Extending Decision Procedures with Induction Schemes (DK, MS), pp. 324–345.
- RTA-1997-Kapur #congruence
- Shostak’s Congruence Closure as Completion (DK), pp. 23–37.
- RTA-1997-KapurS #order #proving #term rewriting #termination
- A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems (DK, GS), pp. 142–156.
- CADE-1996-KapurS #automation #induction
- Lemma Discovery in Automated Induction (DK, MS), pp. 538–552.
- CAV-1996-KapurS #multi #product line #verification
- Mechanically Verifying a Family of Multiplier Circuits (DK, MS), pp. 135–146.
- HPDC-1996-VandevoordeK #parallel #user interface
- Parallel User Interfaces for Parallel Applications (MTV, DK), pp. 161–170.
- RTA-1996-Kapur #automation #challenge #reasoning
- Rewrite-Based Automated Reasoning: Challenges Ahead (DK), pp. 1–2.
- RTA-1996-VandevoordeK #distributed #empirical #proving #rule-based
- Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover (MTV, DK), pp. 420–423.
- STOC-1996-KapurS
- Sparsity Considerations in Dixon Resultants (DK, TS), pp. 184–191.
- ISSTA-1994-Kapur #automation #equation #specification
- An Automated Tool for Analyzing Completeness of Equational Specifications (DK), pp. 28–43.
- ICLP-1993-RaoKS #haskell #proving #source code #termination
- Proving Termination of GHC Programs (MRKKR, DK, RKS), pp. 720–736.
- LICS-1992-KapurN #complexity #set
- Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.
- CSL-1991-RaoKS #logic programming #proving #source code #termination
- A Transformational Methodology for Proving Termination of Logic Programs (MRKKR, DK, RKS), pp. 213–226.
- RTA-1991-AgarwalMKN #proving
- The Tecton Proof System (RA, DRM, DK, XN), pp. 442–444.
- RTA-1989-KapurZ #overview
- An Overview of Rewrite Rule Laboratory (RRL) (DK, HZ), pp. 559–563.
- RTA-1989-ZhangK
- Consider Only General Superpositions in Completion Procedures (HZ, DK), pp. 513–527.
- CADE-1988-CyrlukHK #algebra #geometry #named #proving #theorem proving
- GEOMETER: A Theorem Prover for Algebraic Geometry (DC, RMH, DK), pp. 770–771.
- CADE-1988-KapurZ #named
- RRL: A Rewrite Rule Laboratory (DK, HZ), pp. 768–769.
- CADE-1988-ZhangK #first-order #proving #theorem proving #using
- First-Order Theorem Proving Using Conditional Rewrite Rules (HZ, DK), pp. 1–20.
- CADE-1988-ZhangKK #equation #induction #specification
- A Mechanizable Induction Principle for Equational Specifications (HZ, DK, MSK), pp. 162–181.
- CADE-1986-KapurN #problem #set #unification
- NP-Completeness of the Set Unification and Matching Problems (DK, PN), pp. 489–495.
- CADE-1986-KapurNZ #induction #proving #testing #using
- Proof by Induction Using Test Sets (DK, PN, HZ), pp. 99–117.
- CADE-1986-KapurSZ #named
- RRL: A Rewrite Rule Laboratory (DK, GS, HZ), pp. 691–692.
- LICS-1986-KapurM #induction #reasoning #specification
- Inductive Reasoning with Incomplete Specifications (DK, DRM), pp. 367–377.
- RTA-1985-BenanavKN #complexity #problem
- Complexity of Matching Problems (DB, DK, PN), pp. 417–429.
- RTA-1985-Kandri-RodyKN #algebra #approach #commutative #problem #unification
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (AKR, DK, PN), pp. 345–364.
- CADE-1984-KapurK #proving
- A Natural Proof System Based on rewriting Techniques (DK, BK), pp. 53–64.
- ICALP-1982-GuttagKM #term rewriting #tool support
- Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems (JVG, DK, DRM), pp. 300–312.
- PS-1981-KapurMS #named
- Tecton: A Language for Manipulating Generic Objects (DK, DRM, AAS), pp. 402–414.
- POPL-1980-KapurM #abstraction #set
- Expressiveness of the Operation Set of a Data Abstraction (DK, MKS), pp. 139–153.
- CAAP-1985-KapurNS #order #proving #term rewriting #termination
- A Path Ordering for Proving Termination of Term Rewriting Systems (DK, PN, GS), pp. 173–187.
- CAAP-1985-KapurS #approach #data type #rule-based
- A Rewrite Rule Based Approach for Synthesizing Abstract Data Types (DK, MKS), pp. 188–207.
- IJCAR-2016-GanDXZKC #polynomial #synthesis
- Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF (TG, LD, BX, NZ, DK, MC), pp. 195–212.
- CADE-2019-ChenWAZKZ #learning #named
- NIL: Learning Nonlinear Interpolants (MC, JW0, JA, BZ, DK, NZ), pp. 178–196.