2010•Unpublished venueRequires access

Proving Partial Correctness and Termination of Mutually Recursive Programs

Nikolaj Popov, Tudor Jebelean

Abstract

We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Correctness, Computer science, Predicate (mathematical logic), Programming language, First-order logic, Set (abstract data type), Theoretical computer science, Algorithm