Finite integer computations: An algebraic foundation for their correctness

DOI10.1007/S00165-006-0090-4MaRDI QIDQ2432238zbMATH OpenOpenAlexWikidataFDO

Authors Sabine Glesner

Publication date 25 October 2006

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-006-0090-4

zbMATH Keywords

formal verificationinconsistencyIsabelle/HOLJava Cardconstant foldingchanging representation sizesfinite integer and residue class arithmeticJava and C arithmeticJava Card bytecode optimization

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 4084863
• On arithmetical algorithms over finite fields
• scientific article; zbMATH DE number 5041654
• Finite precision arithmetic and the Schur algorithm
• scientific article; zbMATH DE number 429512
• Algorithms for finite field arithmetic
• scientific article; zbMATH DE number 125228
• scientific article; zbMATH DE number 1440131
• scientific article; zbMATH DE number 3119358
• Methods for justifying arithmetic hypotheses and computer algebra

Cited in

(2)

• On the most suitable axiomatization of signed integers
• A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers

Describes a project that uses

Uses Software

• Isabelle/HOL

This page was built for publication: Finite integer computations: An algebraic foundation for their correctness

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