Synthesis of a family of recursive sorting procedures

Kung Kiu Lau; Steven D. Prestwich

Synthesis of a family of recursive sorting procedures

Kung Kiu Lau
, Steven D. Prestwich

University of Manchester

Research output: Contribution to conference › Paper › peer-review

Abstract

In an earlier paper, we described a method for synthesizing recursive logic procedures from their first-order logic specifications. The method is practical because it is strictly top-down and has been implemented as part of a user-guided synthesis system in Prolog. We have used the system to synthesize procedures for a wide variety of algorithms, including a large family of recursive sorting procedures. In this paper we describe the synthesis of this family of procedures.

Original language	English
Pages	641-658
Number of pages	18
Publication status	Published - 1991
Externally published	Yes
Event	Logic Programming - Proceedings of the 1991 International Symposium - San Diego, CA, USA Duration: 28 Oct 1991 → 1 Nov 1991

Conference

Conference	Logic Programming - Proceedings of the 1991 International Symposium
City	San Diego, CA, USA
Period	28/10/91 → 1/11/91

Cite this

@conference{3352987da5c14ad995c3d6bbf650d480,

title = "Synthesis of a family of recursive sorting procedures",

abstract = "In an earlier paper, we described a method for synthesizing recursive logic procedures from their first-order logic specifications. The method is practical because it is strictly top-down and has been implemented as part of a user-guided synthesis system in Prolog. We have used the system to synthesize procedures for a wide variety of algorithms, including a large family of recursive sorting procedures. In this paper we describe the synthesis of this family of procedures.",

author = "Lau, \{Kung Kiu\} and Prestwich, \{Steven D.\}",

year = "1991",

language = "English",

pages = "641--658",

note = "Logic Programming - Proceedings of the 1991 International Symposium ; Conference date: 28-10-1991 Through 01-11-1991",

}

TY - CONF

T1 - Synthesis of a family of recursive sorting procedures

AU - Lau, Kung Kiu

AU - Prestwich, Steven D.

PY - 1991

Y1 - 1991

N2 - In an earlier paper, we described a method for synthesizing recursive logic procedures from their first-order logic specifications. The method is practical because it is strictly top-down and has been implemented as part of a user-guided synthesis system in Prolog. We have used the system to synthesize procedures for a wide variety of algorithms, including a large family of recursive sorting procedures. In this paper we describe the synthesis of this family of procedures.

AB - In an earlier paper, we described a method for synthesizing recursive logic procedures from their first-order logic specifications. The method is practical because it is strictly top-down and has been implemented as part of a user-guided synthesis system in Prolog. We have used the system to synthesize procedures for a wide variety of algorithms, including a large family of recursive sorting procedures. In this paper we describe the synthesis of this family of procedures.

UR - https://www.scopus.com/pages/publications/0026263528

M3 - Paper

AN - SCOPUS:0026263528

SP - 641

EP - 658

T2 - Logic Programming - Proceedings of the 1991 International Symposium

Y2 - 28 October 1991 through 1 November 1991

ER -

Synthesis of a family of recursive sorting procedures

Abstract

Conference

Other files and links

Fingerprint

Cite this