AI Chat AI Image Generator AI Video Text to Speech

On correctness of an n queens program

09/16/2019

∙

by Włodzimierz Drabent, et al.

∙

∙

Thom Frühwirth presented a short, elegant and efficient Prolog program for the n queens problem. However the program may be seen as rather tricky and one may be not convinced about its correctness. This paper explains the program in a declarative way, and provides a proof of its correctness and completeness.

page 1

page 2

page 3

page 4

research

∙ 08/18/2021

On correctness and completeness of an n queens program

Thom Frühwirth presented a short, elegant and efficient Prolog program f...

0 Włodzimierz Drabent, et al. ∙

research

∙ 10/23/2018

Programming Without Refining

To derive a program for a given specification R means to find an artifac...

0 Marwa Benabdelali, et al. ∙

research

∙ 05/17/2022

Local Completeness Logic on Kleene Algebra with Tests

Local Completeness Logic (LCL) has been put forward as a program logic f...

0 Marco Milanese, et al. ∙

research

∙ 02/19/2018

Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction

A proof tableau of Hoare logic is an annotated program with pre- and pos...

0 Shinnosuke Mizutani, et al. ∙

research

∙ 08/24/2017

From Concurrent Programs to Simulating Sequential Programs: Correctness of a Transformation

Frama-C is a software analysis framework that provides a common infrastr...

0 Allan Blanchard, et al. ∙

research

∙ 10/27/2018

Beyond Structured Programming

The correctness of a structured program is, at best, plausible. Though t...

0 M. H. van Emden, et al. ∙

research

∙ 09/13/2019

Reasoning about call-by-value: a missing result in the history of Hoare's logic

We provide a sound and relatively complete Hoare-like proof system for r...

0 Krzysztof R. Apt, et al. ∙