메뉴 건너뛰기




Volumn 48, Issue 1, 2013, Pages 371-383

Fully abstract compilation to JavaScript

Author keywords

Full abstraction; Program equivalence; Refinement types

Indexed keywords

APPLICATIVE BISIMILARITY; FULL ABSTRACTION; HIGHER-ORDER FUNCTIONS; JAVASCRIPT; ML-LIKE LANGUAGES; PROGRAM EQUIVALENCE; PROGRAM PROPERTIES; REFINEMENT TYPES;

EID: 84877897422     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2480359.2429114     Document Type: Conference Paper
Times cited : (29)

References (23)
  • 1
    • 84878558984 scopus 로고    scopus 로고
    • Protection in programming-language translations
    • M. Abadi. Protection in programming-language translations. In ICALP, volume 1443, pages 868-883, 1998.
    • (1998) ICALP , vol.1443 , pp. 868-883
    • Abadi, M.1
  • 2
    • 77957600240 scopus 로고    scopus 로고
    • On protection by layout randomization
    • M. Abadi and G. D. Plotkin. On protection by layout randomization. In IEEE CSF, pages 337-351, 2010.
    • (2010) IEEE CSF , pp. 337-351
    • Abadi, M.1    Plotkin, D.G.2
  • 3
    • 0037052276 scopus 로고    scopus 로고
    • Secure implementation of channel abstractions
    • Apr.
    • M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. Information and Computation, 174(1):37-83, Apr. 2002.
    • (2002) Information and Computation , vol.174 , Issue.1 , pp. 37-83
    • Abadi, M.1    Fournet, C.2    Gonthier, G.3
  • 4
  • 5
    • 59249097625 scopus 로고    scopus 로고
    • Typed closure conversion preserves observational equivalence
    • A. Ahmed and M. Blume. Typed closure conversion preserves observational equivalence. In ICFP, 2008.
    • (2008) ICFP
    • Ahmed, A.1    Blume, M.2
  • 8
    • 47249164288 scopus 로고    scopus 로고
    • Z3: An efficient SMT solver
    • L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS, 2008.
    • (2008) TACAS
    • De Moura, L.1    Bjørner, N.2
  • 10
    • 33749590020 scopus 로고    scopus 로고
    • Securing the .NET programming model
    • A. Kennedy. Securing the .NET programming model. TCS, 364(3), 2006.
    • (2006) TCS , vol.364 , Issue.3
    • Kennedy, A.1
  • 11
    • 26844560861 scopus 로고    scopus 로고
    • Eager normal form bisimulation
    • S. Lassen. Eager normal form bisimulation. LICS, 2005.
    • (2005) LICS
    • Lassen, S.1
  • 12
    • 84866049432 scopus 로고    scopus 로고
    • An operational semantics for JavaScript
    • S. Maffeis, J. C. Mitchell, and A. Taly. An operational semantics for JavaScript. In APLAS, 2008.
    • (2008) APLAS
    • Maffeis, S.1    Mitchell, J.C.2    Taly, A.3
  • 13
    • 0002891241 scopus 로고
    • Towards a mathematical science of computation
    • J. McCarthy. Towards a mathematical science of computation. In IFIP Congress, pages 21-28, 1962.
    • (1962) IFIP Congress , pp. 21-28
    • McCarthy, J.1
  • 14
    • 84874147849 scopus 로고    scopus 로고
    • Conscript: Specifying and enforcing fine-grained security policies for JavaScript in the browser
    • L. A. Meyerovich and V. B. Livshits. Conscript: Specifying and enforcing fine-grained security policies for JavaScript in the browser. In IEEE S&P, 2010.
    • (2010) IEEE S&P
    • Meyerovich, L.A.1    Livshits, V.B.2
  • 15
    • 0027684079 scopus 로고
    • On abstraction and the expressive power of programming languages
    • J. C. Mitchell. On abstraction and the expressive power of programming languages. Science of Computer Programming, 21(2):141-163, 1993.
    • (1993) Science of Computer Programming , vol.21 , Issue.2 , pp. 141-163
    • Mitchell, J.C.1
  • 16
    • 0015561577 scopus 로고
    • Protection in programming languages
    • J. H. Morris. Protection in programming languages. In CACM (16), 1973.
    • (1973) CACM (16)
    • Morris, J.H.1
  • 18
    • 84874124861 scopus 로고    scopus 로고
    • Verification condition generation with the dijkstra state monad
    • Mar.
    • C. Schlesinger and N. Swamy. Verification condition generation with the Dijkstra state monad. Technical Report MSR-TR-2012-45, Mar. 2012.
    • (2012) Technical Report MSR-TR-2012-45
    • Schlesinger, C.1    Swamy, N.2
  • 19
    • 34248365617 scopus 로고    scopus 로고
    • Hop: A language for programming the web 2.0
    • M. Serrano, E. Gallesio, and F. Loitsch. Hop: a language for programming the web 2.0. In OOPSLA Companion, pages 975-985, 2006.
    • (2006) OOPSLA Companion , pp. 975-985
    • Serrano, M.1    Gallesio, E.2    Loitsch, F.3
  • 20
    • 29144437303 scopus 로고    scopus 로고
    • A bisimulation for type abstraction and recursion
    • E. Sumii and B. C. Pierce. A bisimulation for type abstraction and recursion. In POPL, 2005.
    • (2005) POPL
    • Sumii, E.1    Pierce, B.C.2


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