Topic
Program analysis
About: Program analysis is a research topic. Over the lifetime, 4909 publications have been published within this topic receiving 157403 citations.
Papers published on a yearly basis
1 / 2
Papers
29 Mar 2004
TL;DR: This paper shows how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm.
Abstract: In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear programs and we show that each encountered linear program can be reduced to the dual problem of an instance of the min-cost flow problem. Thus, we only need to solve instances of the much simpler min-cost flow problem during minimum-cost reachability analysis. Experimental results using Uppaal show a 70-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata.
65 citations
TL;DR: It is shown how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs by taking space reuse by explicit deallocation into account.
Abstract: We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs.The analysis takes space reuse by explicit deallocation into account and al...
65 citations
4 Apr 2005
TL;DR: A modular program slicer for Java built using the Indus program analysis framework along with it's Eclipse-based user interface called Kaveri, which provides the capability for chasing various dependences in the application to understand the slice.
Abstract: This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it's Eclipse-based user interface called Kaveri. Indus provides a library of classes that enables users to quickly assemble a highly customized non-system dependence graph based inter-procedural program slicer capable of slicing concurrent Java programs. Kaveri is an Eclipse plugin that relies on the above library to deliver program slicing to the eclipse platform. Apart from the basic feature for generating program slices from within eclipse along with an intuitive UI to view the slice, the plugin also provides the capability for chasing various dependences in the application to understand the slice.
65 citations
13 Jul 1998
TL;DR: In order to be a practical alternative to compiler verification, a key feature of this validation is its full automation.
Abstract: Translation validations an alternative to the verification of translators (compilers, code generators). Rather than proving in advance that, the compiler always produces a target code which correctly implements the source code (compiler verification), each individual translation (i.e. a run of the compiler) is followed by a validation phase which verifies that the target code producted on this run correctly implements the submitted source program. In order to be a practical alternative to compiler verification, a key feature of this validation is its full automation.
65 citations
24 Jun 1998
TL;DR: These concepts have been developed for static and dynamic program slicing and are combined with different methods of visualization to guide programmers in the process of program understanding.
Abstract: Program slicing transforms a large program into a smaller one that contains only statements relevant to the computation of a given function. It has been shown that program slicing can be useful in program understanding. Traditionally, program slices are represented in the textual form. Although slicing does narrow the size of the program, the textual representation of a slice does not provide much guidance in the understanding of large programs. In this paper we present program slicing concepts on the module level that allow for better understanding of program slices of large programs and their executions. These concepts have been developed for static and dynamic program slicing and are combined with different methods of visualization to guide programmers in the process of program understanding. The presented concepts have been implemented in the slicing tool that is used to investigate the usefulness of these concepts in the process of understanding of large programs.
64 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 1 |
| 2025 | 4 |
| 2024 | 10 |
| 2023 | 19 |
| 2022 | 47 |
| 2021 | 99 |