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

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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: V. A. Bitner, N. V. Zaborovsky
Formato: Artigo
Idioma:Inglês
Publicado em: Yaroslavl State University 2013-04-01
Colecção:Modelirovanie i Analiz Informacionnyh Sistem
Assuntos:
race condition
static analysis
multithreaded algorithms
ssa
optimizing compiler
Acesso em linha:https://www.mais-journal.ru/jour/article/view/214
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registos relacionados