We consider a recursive sorting algorithm in which, in each invocation, a new variable and a new procedure (using the variable globally) are defined and the procedure is passed to recursive calls. This algorithm is proved correct with Hoare-style pre- and postassertions. We also discuss the same algorithm expressed as a functional program
Starting from a general specification of the sorting of a sequence, and through successive transform...
Using the deductive synthesis framework developed by Manna and Waldinger we have derived a wide vari...
In this paper, we first discuss the motivation and concept of a new sorting approach, called soft so...
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
In an earlier paper, we described a method for synthesising recursive logic procedures from their fi...
In Milner's polyadic π-calculus there is a notion of sorts which is analogous to the notion of ...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...
Sorting is an important algorithmic task used in many applications. Two main aspects of sorting algo...
AbstractSort systems are introduced to improve representation and manipulation of information. While...
We show that some well-known rules in a Hoare-style proof system for total correctness of recursive ...
We present a mechanically verified implementation of the sorting algorithm commonly known as Natural...
AbstractWe show that some well-known rules in a Hoare-style proof system for total correctness of re...
is applied to the task of evolving general recursive sorting algorithms. We studied the effects of l...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
Starting from a general specification of the sorting of a sequence, and through successive transform...
Using the deductive synthesis framework developed by Manna and Waldinger we have derived a wide vari...
In this paper, we first discuss the motivation and concept of a new sorting approach, called soft so...
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
In an earlier paper, we described a method for synthesising recursive logic procedures from their fi...
In Milner's polyadic π-calculus there is a notion of sorts which is analogous to the notion of ...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...
Sorting is an important algorithmic task used in many applications. Two main aspects of sorting algo...
AbstractSort systems are introduced to improve representation and manipulation of information. While...
We show that some well-known rules in a Hoare-style proof system for total correctness of recursive ...
We present a mechanically verified implementation of the sorting algorithm commonly known as Natural...
AbstractWe show that some well-known rules in a Hoare-style proof system for total correctness of re...
is applied to the task of evolving general recursive sorting algorithms. We studied the effects of l...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
Starting from a general specification of the sorting of a sequence, and through successive transform...
Using the deductive synthesis framework developed by Manna and Waldinger we have derived a wide vari...
In this paper, we first discuss the motivation and concept of a new sorting approach, called soft so...
DOI
Add to ORKG