G. A. Venkatesh and C. N. Fischer. Spare: A development environment for program analysis algorithms. IEEE Trans. Softw. Eng., 18(4):304--318, April 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in a formal notation. However, in practice, a verification of a non trivial protocol that involves more than one participant has yet to be fully automated. In [5, 15] we compare Amalia to tools that automatically generate analyzers from formal semantic descriptions (e.g. CWB NC [4] SPARE [17], and CENTAUR [3] Amalia generated analyzers have the advantage that they are more easily integrated into a larger environment than are analyzers generated from these other tools. On the other hand, these tools, specifically CENTAUR and CWBNC, use a more expressive rules language than Amalia can ....

G. A. Venkatesh and C. N. Fischer. Spare: A development environment for program analysis algorithms. IEEE Trans. Softw. Eng., 18(4):304--318, April 1992.

....the statement with a node that is connected (through a tunneling value connection) to the right dependence region. 9. RELATED WORK A number of analysis frameworks have been developed for making intra and interprocedural analyses easier to write and reason about, including Sharlit [26] SPARE [27], FIAT [17] McCAT [19] System Z [33] PAG [2] the k tuple dataflow analysis framework [22] and Dwyer and Clarke s system [15] However, none of these systems address integrating transformations with analyses, nor automatically combining analyses profitably. Nelson and Oppen [23] describe how ....

G. A. Venkatesh and Charles N. Fischer. SPARE: A development environment for program analysis algorithms. IEEE Transactions on Software Engineering, 18(4):304--318, April 1992.

....reify the necessary semantic rules. 6.3. Automated analyzer generators Other researchers have looked at automatically generating analyzers from formal semantics descriptions. For example, CENTAUR [5] maps specifications in natural semantics into Horn clauses in Prolog. Another example is SPARE [17], which synthesizes analysis algorithms from denotational semantic specifications. However, these generators produce stand alone analysis tools; additionally, the CENTAUR environment requires an online Prolog engine in order to run. The Concurrency Workbench of North Carolina (CWBNC) is a ....

G. A. Venkatesh and C. N. Fischer. Spare: A development environment for program analysis algorithms. IEEE Trans. Softw. Eng., 18(4):304--318, April 1992.

....d ; prod(s l (S n dom(t ) v(i) and so, by Lemma 5, S 2 M[ I] The remaining cases are similar.2 6. DISCUSSION AND FUTURE WORK In our previous papers [6, 14] we compare Amalia to tools that automatically generate analyzers from formal semantic descriptions (e.g. CWB NC [5] SPARE [15], and CENTAUR [3] Amaliagenerated analyzers have the advantage that they are more lightweight, and therefore more easily integrated into a larger environment, than are analyzers generated from these other tools. On the other hand, these tools, specifically CENTAUR and CWB NC, use a more ....

G. A. Venkatesh and C. N. Fischer. Spare: A development environment for program analysis algorithms. IEEE Trans. Softw. Eng., 18(4):304--318, April 1992.

....but hardly any (with the possible exception of IBURG [6] seems to have sustained wide spread and long term usage. Tool making for program analysis. A similar disappointing outlook applies to tools for program analysis, despite several e#orts to construct systems of some generality (e.g. [1, 29, 30, 33]) This is not because of a lack of theoretical developments; indeed there are the methodologies of data flow equations (e.g. 10] set based analyses through the generation of constraints (e.g. 7] abstract interpretation expressed denotationally (e.g. 15] or operationally (e.g. 3] ....

G. V. Venkatesh and C. N. Fischer. Spare: a Development Environment for Program Analysis Algorithms. IEEE Transactions on Software Engineering, 1992.

....flow. In order to utilize breakpointing information during PDG slicing, a mapping would have to be provided between various points in the control flow graph and the program dependence graph. The notion of a constrained quasi static slice is another approach to reduce the size of static slices [18]. An algorithm for computing constrained slices appears in [9] Constraints on input values are provided and, using this information, a static slice is produced that excludes program executions requiring inputs that do not satisfy the given constraints. In contrast, hybrid slicing exploits dynamic ....

A. Venkatesh and C.N. Fischer, "SPARE: A Development Environment for Program Analysis Algorithms, " IEEE Transactions on Software Engineering, Vol. 18, No. 4, April 1992.

....demand driven data flow computation (although exhaustive data flow can be computed) employs specifications to automatically produce algorithms and is oriented to software engineering tools as well as compilers. SPARE is another tool that facilitates the development of program analysis algorithms [24]. This tool supports a high level specification language through which analysis algorithms are expressed. The denotational nature of the specifications enables automatic implementation as well as verification of the algorithms. Although the tool is useful for rapid prototyping, the efficiency of ....

A. Venkatesh and C.N. Fischer, "SPARE: a development environment for program analysis algorithms," IEEE Transactions on Software Engineering, Vol. 18, No. 4, April 1992.

No context found.

G. A. Venkatesh and Charles N. Fischer, "SPARE: A Development Environment for Program Analysis Algorithms," IEEE Transactions of Software Engineering, Vol. 18, No. 4, April, 1992, pp. 304-318.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC