The performance of optimising compilers crucially depends on the availability of controlflow information at compile time. For any first-order imperative program, such information is available via a flowchart constructed from the program text. Consequently, traditional dataflow analyses can be used to perform a series of compile-time program optimisations (Aho et al. 1986). For higher-order prog...

This is the third in a series introducing the activity model in the Unified Modeling Language, version 2 (UML 2), and how it integrates with the action model [1]. The previous article addressed the execution characteristics of actions in general, and additional functionality of actions that invoke behaviors [2]. The first article gave an overview of activities and actions that is assumed here [...

Most of the parsers deened for TAG (Tree Adjoining Grammar) formalism are based in classical CFG (Context-Free Grammar) parsers. An elementary tree is considered a set of CFG-rules and adjunction operation is simulated by substitution. Additional control considerations must be added in order to establish the real power of TAGs. In this paper, we present one elementary tree representation for TA...

Data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous Data Flow (SDF) graph, a special case of data flow graph [Lee87a]. Even though the static p...

In his dissertation [3], Olin Shivers introduces a concept of control flow graphs for functional languages, provides an algorithm to statically derive a safe approximation of the control flow graph and proves this algorithm correct. In this research project [1], Shivers’ algorithms and proofs are formalized using the HOLCF extension of the logic HOL in the theorem prover Isabelle.

In this work the relation between Boolean Matrix Multiplication (BMM) and Context Free Grammar (CFG) parsing is shown. The first described approach, which is due to Valiant (1975), shows how CFG parsing can be reduced to Boolean Matrix Multiplication. Afterwards the reverse direction, i.e. how a CFG parser can be used to multiply two Boolean matrices, is presented, which is due to Lee (2002). T...

AbsrructAs the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Although converting a sequential data flow algorithm to a p...

Path-based Statistical Software Testing is interested in sampling the feasible paths in the control flow graph of the program being tested. As the ratio of feasible paths becomes negligible for large programs, an ML approach is presented to iteratively estimate and exploit the distribution of feasible paths.

The compound fuling granule (CFG) is a traditional Chinese drug which has been used to treat ovarian cancer in China for over twenty years. Nevertheless, the underlying molecular mechanism of its anti-cancer effect remains unclear. In this study, microarray data analysis was performed to search differentially expressed genes in CFG-treated ovarian cancer cells. Several cell cycle and epithelial...