Category

share

Dominance in Control Flow Graph

Dominance in Control Flow Graph

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 
₹ 3,651

Availability: Out of stock

 

Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description
 

Finding dominators in a control flow graph is one of the most desirable goals in control flow analysis. The dominators can be used for finding the parts of a computer code which must unconditionally run. The dominators can be further utilized for code optimizations and detecting independent units in a code. This can be especially suitable for the code written in assembly language, which represents complex structure, mainly caused by the still widely used statement GOTO. This work describes some suitable algorithms for finding dominators and then shows their application in practice. The behavior of the algorithms is investigated on random, as well as on assembly control flow graphs. This work also discusses the contribution of the dominators for the orientation in a control flow graph and proposes some suitable solutions.

Product Specifications
SKU :COC72213
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08
0 Review(s)