RUS  ENG
Full version
JOURNALS // Proceedings of the Institute of Mathematics of the NAS of Belarus // Archive

Tr. Inst. Mat., 2010 Volume 18, Number 2, Pages 87–92 (Mi timb20)

Approximate fine information structure of algorithms

N. A. Likhoded

Institute of Mathematics of the National Academy of Sciences of Belarus

Abstract: A method for obtaining of functions setting data dependencies for sequential programs is presented.\linebreak The method is suitable for the automatization. In practice it is applicable in most cases.

UDC: 519.6+681.3.012

Received: 07.12.2009



© Steklov Math. Inst. of RAS, 2024