Automatic result verification by complete run-time checking of computations

DOI10.1142/S0129054101000424MaRDI QIDQ5249251zbMATH OpenOpenAlexFDO

Authors Edgar F. A. Lederer, Romeo A. Dumitrescu

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054101000424

zbMATH Keywords

coordination model/languagefunctional/imperative programmingparallel/distributed programmingresult verificationresult-checkingrun-time checking

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Software model checking by program specialization
• Verification as a parameterized testing (experiments with the SCP4 supercompiler)
• scientific article; zbMATH DE number 3926214
• Programmable verifiers in imperative programming
• Verification of distributed programs of the SPMD-type on the basis of the L-programs formalism

Cites work

• Certification of computational results
• Designing programs that check their work
• Reflections on the Pentium division bug
• Software reliability via run-time result-checking

Cited in

(2)

• A Self-Checking Generalized Prediction Checker and Its Use for Built-In Testing
• Scientific computing with automatic result verification

This page was built for publication: Automatic result verification by complete run-time checking of computations

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