Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-319-08867-9_52

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer International Publishing

Related search

Automatically Proving Program Termination

English

Proving Termination With Multiset Orderings

Communications of the ACM
Computer Science
1979English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2007English

Using Representation Theorems for Proving Polynomials Non-Negative

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Termination and Non-Termination Specification Inference

ACM SIGPLAN Notices
Computer Science
2015English

Extending DIVINE With Symbolic Verification Using SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Providing Morphological Information for SMT Using Neural Networks

The Prague Bulletin of Mathematical Linguistics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy