Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Kaustubh Nimkar
Proving Non-Termination Using Max-SMT
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Automatically Proving Program Termination
Proving Termination With Multiset Orderings
Communications of the ACM
Computer Science
Proving Existential Termination of Normal Logic Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Computational Theory
Software
Artificial Intelligence
Mathematics
Using Representation Theorems for Proving Polynomials Non-Negative
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Practical Methods for Proving Termination of General Logic Programs
Journal of Artificial Intelligence Research
Artificial Intelligence
Termination and Non-Termination Specification Inference
ACM SIGPLAN Notices
Computer Science
Extending DIVINE With Symbolic Verification Using SMT
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Providing Morphological Information for SMT Using Neural Networks
The Prague Bulletin of Mathematical Linguistics
