Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

System and/or method for computing interprocedural dominators

An interprocedural, dominant technique used in computing, memory systems, program files, etc.

Active Publication Date: 2016-03-23
INT BUSINESS MASCH CORP
View PDF9 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The original algorithm suffers from a lot of asymptotic complexity, but is easy to understand
Subsequent work improved time bounds, but generally sacrificed both simplicity and ease of implementation

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • System and/or method for computing interprocedural dominators
  • System and/or method for computing interprocedural dominators
  • System and/or method for computing interprocedural dominators

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] An aspect of some embodiments of the invention relates to a computerized method and / or system for incremental and / or on-demand analysis of a software program comprising a plurality of functions using an intra-procedural dominator graph and / or Computer Program Products. Advantageously, this process allows for parallelization and / or scaling up. Advantageously, this process reduces the changes needed to move from intra-procedural analysis to inter-procedural analysis.

[0037] In an example embodiment, multiple intra-procedural dominator graphs computed for multiple functions of software program code are combined to form an inter-procedural dominator graph. Optionally, an inter-procedural dominance graph is analyzed to identify dominance relationships, eg, between functions of a software program. Optionally, the identified dominance relationships are used to analyze the software program.

[0038]In an example embodiment, computer program code is analyzed to construct an...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

According to an aspect of some embodiments there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

Description

technical field [0001] The present invention in some of its embodiments relates to a method and / or system for computing a dominator, and more particularly, but not exclusively, to a method and / or system for computing an inter-procedural dominator. Background technique [0002] "Asimple, fast dominance algorithm." Software Practice & Experience 4 (2001): 1-10 by Cooper, Keith D., Timothy J. Harvey, and Ken Kennedy seems to disclose that "the problem of finding a dominator in a control flow graph has a long history in the literature. The original algorithm was influenced by Substantial asymptotic complexity impact, but easy to understand. Subsequent work improves time bounds, but generally sacrifices both simplicity and ease of implementation. This paper returns to the simple formulation of the governing formula as a global dataflow problem." [0003] In a lecture titled "Finding Dominators in Interprocedural Flow Graphs", Lucas Georgiadis of the University of Ioannina appears...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/45
CPCG06F8/433G06F8/40G06F8/73G06F8/75G06F11/3624G06F11/3628
Inventor A·阿巴迪M·阿巴迪J·布纳亚胡Y·费尔德曼
Owner INT BUSINESS MASCH CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com