On Instruction Sets for Boolean Registers in Program Algebra

DOI10.7561/SACS.2016.1.1zbMath1424.68032arXiv1502.00238MaRDI QIDQ4621199

Jan A. Bergstra, C. A. Middelburg

Publication date: 8 February 2019

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

program algebrainstruction setBoolean registerinstruction sequence sizesize-bounded functional completeness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

On the complexity of the correctness problem for non-zeroness test instruction sequences

This page was built for publication: On Instruction Sets for Boolean Registers in Program Algebra