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

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteurs: V. A. Bitner, N. V. Zaborovsky
Formaat: Artigo
Taal:Inglês
Gepubliceerd in: Yaroslavl State University 2013-04-01
Reeks:Modelirovanie i Analiz Informacionnyh Sistem
Onderwerpen:
race condition
static analysis
multithreaded algorithms
ssa
optimizing compiler
Online toegang:https://www.mais-journal.ru/jour/article/view/214
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Gelijkaardige items