메뉴 건너뛰기




Volumn 4, Issue 1, 2005, Pages 73-111

Memory Safety Without Garbage Collection for Embedded Applications

Author keywords

automatic pool allocation; compilers; Embedded systems; Languages; programming languages; region management; Security; security; static analysis

Indexed keywords


EID: 42149150286     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/1053271.1053275     Document Type: Article
Times cited : (31)

References (47)
  • 5
    • 84975483388 scopus 로고    scopus 로고
    • Usingthe chains of recurrences algebra for data dependence testing and induction variable substitution
    • M.S. thesis, Computer Science Dept., Florida State University, Tallahassee, FL
    • Birch, J., 2002. Usingthe chains of recurrences algebra for data dependence testing and induction variable substitution. M.S. thesis, Computer Science Dept., Florida State University, Tallahassee, FL.
    • (2002)
    • Birch, J.1
  • 7
    • 0033729897 scopus 로고    scopus 로고
    • The real-time specification for Java
    • Bollella, G., Gosling, J., 2000. The real-time specification for Java. Computer 33, 6, 4754.
    • (2000) Computer , vol.33 , pp. 6-4754
    • Bollella, G.1    Gosling, J.2
  • 10
    • 4544324289 scopus 로고    scopus 로고
    • Region inference for an object-oriented language
    • Chin, W.-N., Craciun, F., Qin, S., Rinard, M., 2004. Region inference for an object-oriented language. SIGPLAN Not. 39, 6, 243-254.
    • (2004) SIGPLAN Not. , vol.39 , Issue.6 , pp. 243-254
    • Chin, W.-N.1    Craciun, F.2    Qin, S.3    Rinard, M.4
  • 19
    • 17644363045 scopus 로고    scopus 로고
    • Typing a multi-language intermediate code
    • Gordon, A. D., Syme, D., 2001. Typing a multi-language intermediate code. ACM SIGPLAN Notices. 36, 3, 248-260.
    • (2001) ACM SIGPLAN Notices. , vol.36 , Issue.3 , pp. 248-260
    • Gordon, A.D.1    Syme, D.2
  • 22
    • 0027568719 scopus 로고
    • Optimizing array bound checks using flow analysis
    • (Mar.-Dec.)
    • Gupta, R., 1993. Optimizing array bound checks using flow analysis. ACM Lett. Prog. Lang. Syst. 2, 1-4 (Mar.-Dec.), 135-150.
    • (1993) ACM Lett. Prog. Lang. Syst. , vol.2 , Issue.1-4 , pp. 135-150
    • Gupta, R.1
  • 27
    • 12544250338 scopus 로고    scopus 로고
    • Backwards-compatible bounds checking for arrays and pointers in C programs
    • Jones, R. W. M., Kelly, P. H. J., 1997. Backwards-compatible bounds checking for arrays and pointers in C programs. In Automated and Algorithmic Debugging. 13-26.
    • (1997) Automated and Algorithmic Debugging. , pp. 13-26
    • Jones, R.W.M.1    Kelly, P.H.J.2
  • 29
    • 0242444280 scopus 로고    scopus 로고
    • LLVM: An infrastructure for multi-stage optimization
    • M.S. thesis, Computer Science Dept., University of Illinois at Urbana-Champaign, Urbana, IL
    • Lattner, C., 2002. LLVM: An infrastructure for multi-stage optimization. M.S. thesis, Computer Science Dept., University of Illinois at Urbana-Champaign, Urbana, IL
    • (2002)
    • Lattner, C.1
  • 37
    • 0003547217 scopus 로고    scopus 로고
    • 2nd ed. O'Reilly. ISBN 0-596-00157-6
    • Oaks, S., 2001. Java Security, 2nd ed. O'Reilly. ISBN 0-596-00157-6.
    • (2001) Java Security
    • Oaks, S.1
  • 38
    • 0030836322 scopus 로고
    • Low-cost, concurrent checking of pointer and array accesses in C programs
    • Patil, H., Fischer, C., 1995. Low-cost, concurrent checking of pointer and array accesses in C programs. Software-Practice and Experience 27, 1, 87-110.
    • (1995) Software-Practice and Experience , vol.27 , Issue.1 , pp. 87-110
    • Patil, H.1    Fischer, C.2
  • 39
    • 84976676720 scopus 로고
    • A practical algorithm for exact array dependence analysis
    • Aug
    • Pugh, W., 1992. A practical algorithm for exact array dependence analysis. Commun. ACM 35, 8 (Aug.), 102-114.
    • (1992) Commun. ACM , vol.35 , Issue.8 , pp. 102-114
    • Pugh, W.1
  • 41
    • 0035394327 scopus 로고    scopus 로고
    • Using simplicity to control complexity
    • Sha, L., 2001. Using simplicity to control complexity. IEEE Software, 20-28.
    • (2001) IEEE Software , pp. 20-28
    • Sha, L.1
  • 43
    • 0002997049 scopus 로고    scopus 로고
    • Region-based memory management
    • Tofte, M., Talpin, J.-P., 1997. Region-based memory management. Inform. Comput. 132, 2, 109-176.
    • (1997) Inform. Comput. , vol.132 , Issue.2 , pp. 109-176
    • Tofte, M.1    Talpin, J.-P.2
  • 44
    • 0029190370 scopus 로고
    • Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
    • Tu, P., Padua, D. A., 1995. Gated SSA-based demand-driven symbolic analysis for parallelizing compilers. In International Conference on Supercomputing. 414-423.
    • (1995) International Conference on Supercomputing. , pp. 414-423
    • Tu, P.1    Padua, D.A.2


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