S-semantics – an example

06/10/2020
by   Włodzimierz Drabent, et al.
0

The s-semantics makes it possible to explicitly deal with variables in program answers. So it seems suitable for programs using nonground data structures, like open lists. However it is difficult to find examples of using the s-semantics to reason about particular programs. Here we apply s-semantics to prove correctness and completeness of Frühwirth's n queens program. This is compared with a proof, published elsewhere, based on the standard semantics and Herbrand interpretations.

READ FULL TEXT

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...
research
07/11/2022

Program Adverbs and Tlön Embeddings

Free monads (and their variants) have become a popular general-purpose t...
research
11/07/2017

A Semantics for Probabilistic Control-Flow Graphs

This article develops a novel operational semantics for probabilistic co...
research
02/08/2022

K-ST: A Formal Executable Semantics of PLC Structured Text Language

Programmable Logic Controllers (PLCs) are responsible for automating pro...
research
08/06/2021

Explaining Counterexamples with Giant-Step Assertion Checking

Identifying the cause of a proof failure during deductive verification o...
research
08/17/2022

Proof Engineering with Predicate Transformer Semantics

We present a lightweight, open source Agda framework for manually verify...
research
04/21/2017

Making Neural Programming Architectures Generalize via Recursion

Empirically, neural networks that attempt to learn programs from data ha...

Please sign up or login with your details

Forgot password? Click here to reset