TY - GEN
T1 - Macro-like instrumentation grammar for Boolean expressions
AU - Zhang, Zhenyu
AU - Xu, Zhongxing
AU - Liu, Zhifang
AU - Gao, Xiaopeng
PY - 2010
Y1 - 2010
N2 - Boolean expression is a basic programming element used to evaluate the truth-values of conditions or their combinations. While Boolean expressions may have complicated logical structures, instrumenting them often needs heavyweight transformation to source code or work with low-level program implementation, which results in cumbersome code and great difficulties to maintenance. As a result, previous instrumentation is often conducted using automatic mechanism, left as the last integration step, and needs to be redone once the source code has changes. It is inflexible and not interactivable for collaborative work. In this paper, we compare several existing popular instrumentation methods and propose a friendly approach, which adds least prefix and postfix to Boolean expressions, simply wraps all conditions, and preserves all Boolean operators if any. Our method works at source-code level yet has a macro-like grammar. It is human maintainable so that programmers may manually and cooperatively modify code by instrumenting interested Boolean expressions like operating macros. We elaborate on the grammar of our method and give empirical evaluation to its performance. Our method has been used in some realistic industrial and research projects successfully.
AB - Boolean expression is a basic programming element used to evaluate the truth-values of conditions or their combinations. While Boolean expressions may have complicated logical structures, instrumenting them often needs heavyweight transformation to source code or work with low-level program implementation, which results in cumbersome code and great difficulties to maintenance. As a result, previous instrumentation is often conducted using automatic mechanism, left as the last integration step, and needs to be redone once the source code has changes. It is inflexible and not interactivable for collaborative work. In this paper, we compare several existing popular instrumentation methods and propose a friendly approach, which adds least prefix and postfix to Boolean expressions, simply wraps all conditions, and preserves all Boolean operators if any. Our method works at source-code level yet has a macro-like grammar. It is human maintainable so that programmers may manually and cooperatively modify code by instrumenting interested Boolean expressions like operating macros. We elaborate on the grammar of our method and give empirical evaluation to its performance. Our method has been used in some realistic industrial and research projects successfully.
KW - Boolean expression
KW - Instrumentation
UR - https://www.scopus.com/pages/publications/79951664586
U2 - 10.1109/CISE.2010.5676786
DO - 10.1109/CISE.2010.5676786
M3 - 会议稿件
AN - SCOPUS:79951664586
SN - 9781424453924
T3 - 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010
BT - 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010
T2 - 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010
Y2 - 10 December 2010 through 12 December 2010
ER -