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

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: V. A. Bitner, N. V. Zaborovsky
Materialtyp: Artigo
Språk:Inglês
Publicerad: Yaroslavl State University 2013-04-01
Serie:Modelirovanie i Analiz Informacionnyh Sistem
Ämnen:
race condition
static analysis
multithreaded algorithms
ssa
optimizing compiler
Länkar:https://www.mais-journal.ru/jour/article/view/214
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk