Abstracts

Programmirung

A new specification language is suggested. Its main advantage is an easiness of familiarization. In spite of simplicity the language has sufficient expressive power and has a satisfiability method for unquantified formulas. A methodology of application of the language for program verification is given by the example of a program of bubble sorting.

Full Text in Russian:

HTML

Note. Abstracts are published in author's edition

Comments

[Home] [Conference]

©2001, Siberian Branch of Russian Academy of Science, Novosibirsk
©2001, United Institute of Computer Science SB RAS, Novosibirsk
©2001, Institute of Computational Techologies SB RAS, Novosibirsk
©2001, A.P. Ershov Institute of Informatics Systems SB RAS, Novosibirsk
©2001, Institute of Mathematics SB RAS, Novosibirsk
©2001, Institute of Cytology and Genetics SB RAS, Novosibirsk
©2001, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk
©2001, Novosibirsk State University
Last modified 06-Jul-2012 (11:45:21)