J. Plevyak, X. Zhang, and A. Chien. Obtaining sequential eciency for concurrent object-oriented languages. In Proc. of 22nd Symp. on Principles of Programming Languages (POPL'95), pages 311-321, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Compositional Pointer and Escape Analysis for Java Programs - Whaley, Rinard (1999) (85 citations) (Correct)
....once. When possible, the algorithm also coarsens the lock granularity by using locks in enclosing objects to synchronize operations on nested objects. Plevyak and Chien describe similar algorithms for reducing synchronization overhead in sequential executions of concurrent object oriented programs [21]. Several research groups have recently developed synchronization optimization techniques for Java programs. Aldrich, Chambers, Sirer, and Eggers describe several techniques for reducing synchronization overhead, including synchronization elimination for thread private objects and several ....
J. Plevyak, X. Zhang, and A. Chien. Obtaining sequential eciency for concurrent object-oriented languages. In Proceedings of the 22nd Annual ACM Symposium on the Principles of Programming Languages, San Francisco, CA, January 1995. ACM, New York.
From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (2000) (27 citations) (Correct)
.... analysis of higher order programs is done for a variety of reasons, including: closure conversion [65] binding time analysis [12] optimizing strict functional programs [32] optimizing non strict functional programs [23] optimizing object oriented programs [53] optimizing concurrent programs [55], safety checking [24, 50] and detecting uncaught exceptions [69] A basic, often seen form of ow analyses can be done in O(n 3 ) time where n is the size of the program. This so called monovariant form of analysis can be varied in minor ways without changing the time complexity [28] and for ....
....4. Notice that if s = then the cover is ; We will de ne the family of ow analyses such that covers can be chosen independently at di erent call sites. Thus, we do not require a uniform covering strategy. This means that our de nition captures adaptive styles of ow analysis, in the spirit of [55], where the degree of polyvariance is determined during the analysis. 7 flow set for e2 e1 e2 a cover consisting of four sets Figure 1: Cover the argument flow set for e2 e1 e2 Figure 2: 0 CFA. flow set for e2 e1 e2 a one set cover Figure 3: Schmidt s analysis. flow set for e2 e1 e2 Figure 4: ....
John Plevyak, Xingbin Zhang, and Andrew A. Chien. Obtaining sequential eciency for concurrent object-oriented languages. In Proceedings of POPL'95, 22nd Annual SIGPLAN{SIGACT Symposium on Principles of Programming Languages, 1995.
Compiler-Based Object Consistency - von Praun, Gross (2001) (Correct)
No context found.
J. Plevyak, X. Zhang, and A. Chien. Obtaining sequential eciency for concurrent object-oriented languages. In Proc. of 22nd Symp. on Principles of Programming Languages (POPL'95), pages 311-321, 1995.
Unknown - (Correct)
No context found.
J. Plevyak, X. Zhang, and A. Chien. Obtaining sequential eciency for concurrent object-oriented languages. In Proceedings of the 22nd Annual ACM Symposium on the Principles of Programming Languages, San Francisco, CA, January 1995. ACM, New York.
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