Automatically Proving Program Termination

doi 10.1007/978-3-540-73368-3_1

Full Text

Abstract

Available in

Date

Unknown

Authors

Publisher

Springer Berlin Heidelberg

Related search

Proving Termination With Multiset Orderings

Communications of the ACM
Computer Science
1979English

Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Proving Theorems by Program Transformation

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

A Theorem Proving Approach for Automatically Synthesizing Visualizations of Flow Cytometry Data

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2017English

Proving the Correctness of Recursion-Based Automatic Program Transformations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Construction of a Question-Answering Program That Automatically Answers the Medical Licensing Examination

Transactions of the Japanese Society for Artificial Intelligence
Artificial IntelligenceSoftware
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy