By Topic

Measuring time cost of rules for program analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xu Wang ; Inf. Initiative Center, Hokkaido Univ., Sapporo, Japan ; Akama, K. ; Songhao He

In lots of rule-based computation models, such as ELAN, Prolog, OBJ, etc., a program is composed of a set of rules. The target of computer programs analysis, is to make them parallel. Therefore, rule-based programs which consist of components one by one are quite important for that target. Rule-based program is a chain of state transitions, and actually, it is a chain of rule applications. Thus, it is necessary to measure execution time cost of each rule, so that we can reduce it to make a rule-based program more efficient through making it parallel. That is to say, time cost measuring of each part of rule-based programs is one of the foundations of the process which can make rule-based programs parallel. As Equivalence Transformation (ET) is one of the rule-based languages, on the base of ET the ideas above can be realized. In this paper, a method will be introduced to measure execution time of rules in ET rule-based program.

Published in:

Computer Sciences and Convergence Information Technology (ICCIT), 2010 5th International Conference on

Date of Conference:

Nov. 30 2010-Dec. 2 2010