메뉴 건너뛰기




Volumn , Issue , 2004, Pages 206-223

Transparent proxies for Java futures

Author keywords

Future; Java; Proxy; Type inference; Type qualifier

Indexed keywords

FUTURE; PROXY; PROXY PROGRAMMING; TYPE INFERENCE; TYPE QUALIFIER;

EID: 12844269813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (35)

References (41)
  • 1
    • 0033226029 scopus 로고    scopus 로고
    • Introduction to set constraint-based program analysis
    • Alexander Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming (SCP), 35(2):79-111, 1999.
    • (1999) Science of Computer Programming (SCP) , vol.35 , Issue.2 , pp. 79-111
    • Aiken, A.1
  • 4
    • 33644541363 scopus 로고    scopus 로고
    • A dynamic proxy based architecture to support distributed Java objects in a mobile environment
    • Gregory Biegel, Vinny Cahill, and Mads Haahr. A dynamic proxy based architecture to support distributed Java objects in a mobile environment. In Proceedings of the CoopIS/DOA/ODBASE, pages 809-826, 2002.
    • (2002) Proceedings of the CoopIS/DOA/ODBASE , pp. 809-826
    • Biegel, G.1    Cahill, V.2    Haahr, M.3
  • 5
    • 2542473880 scopus 로고    scopus 로고
    • An imperative core calculus for Java and Java with effects
    • University of Cambridge Computer Laboratory, April
    • Gavin M. Bierman, Matthew J. Parkinson, and Andrew M. Pitts. An imperative core calculus for Java and Java with effects. Technical Report 563, University of Cambridge Computer Laboratory, April 2003.
    • (2003) Technical Report , vol.563
    • Bierman, G.M.1    Parkinson, M.J.2    Pitts, A.M.3
  • 7
    • 3042511875 scopus 로고    scopus 로고
    • Master's thesis, Department of Computer Science, The Australian National University, December
    • Michael James Compton. SCOOP: An investigation of concurrency in Eiffel. Master's thesis, Department of Computer Science, The Australian National University, December 2000.
    • (2000) SCOOP: An Investigation of Concurrency in Eiffel
    • Compton, M.J.1
  • 9
    • 84892523170 scopus 로고    scopus 로고
    • JDK1.5documentation
    • Dynamic proxy classes, http://java.sun.eom/j2se/l.5.0/docs/guide/ reflection/proxy.html. JDK 1.5 documentation.
    • Dynamic Proxy Classes
  • 12
    • 84860092141 scopus 로고    scopus 로고
    • Executor examples. http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/ etc/notes/tim-execu%tor-examples. html?rev=1.5.
    • Executor Examples
  • 20
    • 12844273215 scopus 로고    scopus 로고
    • Claude Hussenet. Personal Communication. Describes the use of JSR 166 futures for an enterprise application
    • Claude Hussenet. Personal Communication. Describes the use of JSR 166 futures for an enterprise application.
  • 24
    • 84860087688 scopus 로고    scopus 로고
    • JSR 166
    • JSR 166: Concurrency utilities. http://www.jcp.org/en/jsr/detail?id-166.
    • Concurrency Utilities
  • 30
    • 84860074823 scopus 로고    scopus 로고
    • Mandala. http://sourceforge.net/projects/mandala/.
    • Mandala
  • 34
    • 12844287965 scopus 로고    scopus 로고
    • Transparent proxies for Java futures
    • Department of Computer Science, University of Maryland, College Park, March
    • Polyvios Pratikakis, Jaime Spacco, and Michael Hicks. Transparent proxies for Java futures. Technical Report CS-TR-4574, Department of Computer Science, University of Maryland, College Park, March 2004.
    • (2004) Technical Report , vol.CS-TR-4574
    • Pratikakis, P.1    Spacco, J.2    Hicks, M.3
  • 36
    • 0033225348 scopus 로고    scopus 로고
    • Tractable constraints in finite semilattices
    • Jakob Rehof arid Torben Mogensen. Tractable constraints in finite semilattices. Science of Computer Programming, 35(2-3):191-221, 1999.
    • (1999) Science of Computer Programming , vol.35 , Issue.2-3 , pp. 191-221
    • Rehof, J.1    Mogensen, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.