Correct by construction

12/21/2018
by   M. H. van Emden, et al.
0

Matrix code allows one to discover algorithms and to render them in code that is both compilable and is correct by construction. In this way the difficulty of verifying existing code is avoided. The method is especially important for logically dense code and when precision programming is called for. The paper explains both these concepts. Logically dense code is explained by means of the partition stage of the Quicksort algorithm. Precision programming is explained by means of fast exponentiation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2019

Iteratively Composing Statically Verified Traits

Metaprogramming is often used to programmatically generate faster specia...
research
10/27/2017

The James construction and π_4(S^3) in homotopy type theory

In the first part of this paper we present a formalization in Agda of th...
research
08/10/2022

New Quantum Codes from CSS Code

We present a new propagation rule for CSS codes. Starting with a CSS cod...
research
11/19/2021

Compresion y analisis de imagenes por medio de algoritmos para la ganaderia de precision

The problem that we want to solve in this project of the subject of Data...
research
10/10/2018

Performance analysis and optimization of the JOREK code for many-core CPUs

This report investigates the performance of the JOREK code on the Intel ...
research
04/11/2017

Persian Wordnet Construction using Supervised Learning

This paper presents an automated supervised method for Persian wordnet c...
research
08/09/2022

A Means-End Account of Explainable Artificial Intelligence

Explainable artificial intelligence (XAI) seeks to produce explanations ...

Please sign up or login with your details

Forgot password? Click here to reset