S-semantics -- an example

DOI10.1007/978-3-030-98869-2_4MaRDI QIDQ6102251zbMATH OpenOpenAlexFDO

Authors Włodzimierz Drabent

Publication date 8 May 2023

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.06077

zbMATH Keywords

declarative programminglogic programmingprogram completenessprogram correctnesss-semanticsspecification

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Abstract: 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 published examples of using the s-semantics to reason about particular programs. Here we apply s-semantics to prove correctness and completeness of Fr"uhwirth's $n$ queens program. This is compared with a proof, published elsewhere, based on the standard semantics and Herbrand interpretations.

Recommendations

• S-semantics for logic programming: a retrospective look
• scientific article; zbMATH DE number 1191243
• A closer look at declarative interpretations
• scientific article; zbMATH DE number 176721
• On the declarative and procedural semantics of logic programs

Cites work

• A practicable timing attack against HQC and its countermeasure
• A side-channel assisted cryptanalytic attack against \textsf{QcBits}
• A timing attack on the HQC encryption scheme
• Correctness and completeness of logic programs
• Declarative modeling of the operational behavior of logic languages
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Generalization of the ball-collision algorithm
• Generic Decoding in the Sum-Rank Metric
• scientific article; zbMATH DE number 4037276 (Why is no real title available?)
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 788036 (Why is no real title available?)
• scientific article; zbMATH DE number 870438 (Why is no real title available?)
• Inductive assertion method for logic pograms
• Information set decoding in the Lee metric with applications to cryptography
• Information-set decoding for linear codes over F_q
• LWE with side information: attacks and concrete security estimation
• New directions in cryptography
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• Practical power analysis attacks on software implementations of McEliece
• S-semantics for logic programming: a retrospective look
• Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
• Side Channels in the McEliece PKC
• The s-semantics approach: Theory and applications
• Timing attacks against the syndrome inversion in code-based cryptosystems
• Towards Side-Channel Resistant Implementations of QC-MDPC McEliece Encryption on Constrained Devices
• Vulnerabilities of ``McEliece in the world of Escher

Cited in

(1)

• On Correctness and Completeness of an n Queens Program

This page was built for publication: S-semantics -- an example

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102251)