Radu Rugina and Martin Rinard. Design-driven compilation. In Proc. 10th International Conference on Compiler Construction, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Detecting Errors with Configurable Whole-program Dataflow.. - Guyer, Berger, Lin (2002) (Correct)
....annota A( B( main( C( Figure 17: A commonly used procedure may have many calling contexts, but a huge number of paths. tions using the library source code. Other research has demonstrated techniques to automatically check a library routine summary against the implementation of the routine [17, 18]. The compiler could also help by checking the transfer function annotations. In our current implementation, it is possible to define analyses that do not converge if the transfer function is non monotonic. Since our lattices are finite, and tend to be relatively small, the compiler could perform ....
Radu Rugina and Martin Rinard. Design-driven compilation. In Proceedings of the International Conference on Compiler Construction, April 2001.
Dataflow Analysis Of Software Fragments - Rountev (2002) (7 citations) (Correct)
....tester, etc. Guyer and Lin [29] propose annotations for describing libraries in the domain of high performance computing. The annotations encode high level semantic information (e.g. points to and side e#ect properties) and are produced by a library expert. Similarly, Rugina and Rinard [53] propose the use of design information in the context of optimizing compilers. In particular, they present summary information that describes how a called procedure a#ects points to relationships and how it accesses regions of arrays; this information is used to perform automatic program ....
....in the context of optimizing compilers. In particular, they present summary information that describes how a called procedure a#ects points to relationships and how it accesses regions of arrays; this information is used to perform automatic program parallelization. In essence, the approaches from [29, 53] use summary functions provided by the analysis user. Dwyer [20] presents a modular dataflow analysis for verifying correctness properties of concurrent programs. Information about the surrounding environment of a module is represented using an environment automaton. This automaton describes the ....
R. Rugina and M. Rinard. Design-driven compilation. In International Conference on Compiler Construction, LNCS 2027.
Detecting Errors with Configurable Whole-program Dataflow.. - Guyer, Berger, Lin (2002) (Correct)
....that produce the expected results. The compiler could assist in the generation and checking of the basic dependence annotations using the library source code. Other research has demonstrated techniques to automatically check a library routine summary against the implementation of the routine [15, 16]. The compiler could also help by checking the transfer function annotations. In our current implementation, it is possible to define analyses that do not converge if the transfer function is non monotonic. Since our lattices are finite, and tend to be relatively small, the compiler could perform ....
R. Rugina and M. Rinard. Design-driven compilation. In Proceedings of the International Conference on Compiler Construction, April 2001.
A Language for Role Specifications - Kuncak, Lam, Rinard (2001) Self-citation (Rinard) (Correct)
No context found.
Radu Rugina and Martin Rinard. Design-driven compilation. In Proc. 10th International Conference on Compiler Construction, 2001.
A Language for Role Specifications - Kuncak, Lam, Rinard (2001) Self-citation (Rinard) (Correct)
....with [8] A more general system used for dependence testing is described in [9] There appears to be surprisingly little work on languages for describing precise e ects procedures with respect to the heap. The importance of procedure speci cations for pointer analysis was indicated in [14]. A language for annotating software libraries is described in [6] E ects systems in general were used in functional languages with side e ects [10] Our speci cation language bears some similarities to propositional dynamic logic [7] Similarly to [4] our e ect language speci es operations on ....
Radu Rugina and Martin Rinard. Design-driven compilation. In ########### ## ### #### ############# ########## ## ######## ############, 2001.
Role Analysis - Kuncak, Lam, Rinard (2002) (20 citations) Self-citation (Rinard) (Correct)
.... role analysis, does not verify that operations on data structures preserve these invariants [23] Several researchers have developed annotation languages to enable the separate analysis of multiple procedures, specifically for pointer analysis, bounds analysis of array indices, and e ect analysis [19, 39]. The techniques presented in this paper track much more detailed aliasing properties. Our procedure e ects are also more speci c and precise than the e ects in [27] as a result they are not idempotent. Both veri cation and instantiation of our e ects require speci c techniques that precisely ....
Radu Rugina and Martin Rinard. Design-driven compilation. In Proceedings of the 10th International Conference on Compiler Construction, 2001.
Designing an Algorithm for Role Analysis - Kuncak (2001) Self-citation (Rinard) (Correct)
No context found.
Radu Rugina and Martin Rinard. Design-driven compilation. In Proceedings of the 10th International Conference on Compiler Construction, 2001.
Incorporating Domain-Specific Information into the Compilation.. - Guyer (2003) (Correct)
No context found.
Radu Rugina and Martin Rinard. Design-driven compilation. In Proceedings of the International Conference on Compiler Construction, pages 150--??, April 2001.
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