( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems.

, , и . ICALP, том 140 из Lecture Notes in Computer Science, стр. 300-312. Springer, (1982)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Tina Kapur

Aphrodite Kapurniotu

Malak Basheshar Kapur

Deepak Bararia

Deepak Ajwani

 

Другие публикации лиц с тем же именем

Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm.. J. Systems Science & Complexity, 30 (1): 196-233 (2017)Modeling generic polyhedral objects with constraints., , и . CVPR, стр. 479-485. IEEE, (1991)Conditional Congruence Closure over Uninterpreted and Interpreted Symbols.. J. Systems Science & Complexity, 32 (1): 317-355 (2019)Expressiveness of the Operation Set of a Data Abstraction., и . POPL, стр. 139-153. ACM Press, (1980)Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation., , , и . CoRR, (2019)Using Dynamic Analysis to Generate Disjunctive Invariants., , , и . CoRR, (2019)When Is a Formula a Loop Invariant?, и . Logic, Rewriting, and Concurrency, том 9200 из Lecture Notes in Computer Science, стр. 264-286. Springer, (2015)Mechanically Verifying a Family of Multiplier Circuits., и . CAV, том 1102 из Lecture Notes in Computer Science, стр. 135-146. Springer, (1996)Dependency Pairs for Equational Rewriting., и . RTA, том 2051 из Lecture Notes in Computer Science, стр. 93-108. Springer, (2001)Deciding Inductive Validity of Equations., и . CADE, том 2741 из Lecture Notes in Computer Science, стр. 17-31. Springer, (2003)