Abstract
A subsystem for verification of linear algebra programs is described. The subsystem is implemented as part of the problem-oriented verification system SPEKTR.
Similar content being viewed by others
References
V. A. Nepomnyashchii and O. M. Ryakin, Applied Program Verification Methods [in Russian], Radio i Svyaz’, Moscow (1988).
A. A. Letichevskii and V. S. Kostyrko, “Using the MIR-2 computer for program analysis,” Kibernetika, No. 6, 31–40 (1974).
D. C. Luckham, “Program verification and verification-oriented programming,” Information Processing '70, Proc. IFIP Congr. (1977), pp. 783–793.
D. I. Good, R. M. Cohen, and J. Keeton-Williams, “Principles of proving concurrent programs in Gypsy,” Proc. ACM Symp. on Principles of Programming Languages (1979), pp. 42–52.
S. L. Gerhart et al., “An overview of AFFIRM: a specification and verification system,” Information Processing '80, Proc. IFIP Congr. (1980), pp. 343–347.
V. A. Nepomnyashchii, S. G. Vorob'ev, and A. A. Sulimov, “SPEKTR: a problem-oriented program verification system,” Kibernetika, No. 6, 31–37 (1987).
M. I. Ageev, V. P. Alik, R. M. Galis, and Yu. I. Markov, Library of Algorithms 1b–50b [in Russian], Sovetskoe Radio, Moscow (1975).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 136–144, September–October, 1992.
Rights and permissions
About this article
Cite this article
Nepomnyashchii, V.A., Sulimov, A.A. Verification of linear algebra programs in the spektr system. Cybern Syst Anal 28, 766–774 (1992). https://doi.org/10.1007/BF01131856
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01131856