The Construction of an Universal Linearized Control Flow Graph for Static Code Analysis of Algorithms

The Construction of an Universal Linearized Control Flow Graph for Static Code Analysis of Algorithms

Show other versions (1)

This paper presents the description of a possible way to build the universal linearized control flow graph which is supposed to be architecture-independent and applicable to the description of any high level language programs. The practical usefulness of the graph considered is the existence of the...

Full description

Bibliographic Details
Main Authors: V. A. Bitner, N. V. Zaborovsky
Format: Article
Language:English
Published: Yaroslavl State University 2013-04-01
Series:Modelirovanie i Analiz Informacionnyh Sistem
Subjects:
race condition
static analysis
multithreaded algorithms
ssa
optimizing compiler
Online Access:https://www.mais-journal.ru/jour/article/view/214

Similar Items

Similar Items