메뉴 건너뛰기




Volumn 45, Issue 1, 2010, Pages 107-118

Verified just-in-time compiler on x86

Author keywords

Compiler verification; Just in time; Self modifying code

Indexed keywords

CODES (SYMBOLS); PROGRAM COMPILERS; SEMANTICS;

EID: 77149132479     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706313     Document Type: Conference Paper
Times cited : (23)

References (29)
  • 3
    • 0345565890 scopus 로고    scopus 로고
    • A brief history of just-in-time
    • John Aycock. A brief history of just-in-time. ACM Computing Surveys, 35:97-113, 2003.
    • (2003) ACM Computing Surveys , vol.35 , pp. 97-113
    • Aycock, J.1
  • 4
    • 0016437462 scopus 로고
    • Proving theorems about pure LISP functions
    • R. S. Boyer and J S. Moore. Proving theorems about pure LISP functions. JACM, 22(1):129-144, 1975.
    • (1975) JACM , vol.22 , Issue.1 , pp. 129-144
    • Boyer, R.S.1    Moore, S.2
  • 5
    • 0029694846 scopus 로고    scopus 로고
    • Automated proofs of object code for a widely used microprocessor
    • Robert S. Boyer and Yuan Yu. Automated proofs of object code for a widely used microprocessor. J. ACM, 43(1):166-192, 1996.
    • (1996) J. ACM , vol.43 , Issue.1 , pp. 166-192
    • Boyer, R.S.1    Yu, Y.2
  • 7
    • 33745191770 scopus 로고    scopus 로고
    • Compiler verification: A bibliography
    • Maulik A. Dave. Compiler verification: a bibliography. SIGSOFT Softw. Eng. Notes, 28(6):2-2, 2003.
    • (2003) SIGSOFT Softw. Eng. Notes , vol.28 , Issue.6 , pp. 2-2
    • Dave, M.A.1
  • 8
    • 77149175371 scopus 로고
    • Formal verification of self modifying code
    • International Academic Publishers, China
    • R. Gerth. Formal verification of self modifying code. In Int. Conf. for Young Computer Scientists, pages 305-313. International Academic Publishers, China, 1991.
    • (1991) In Int. Conf. for Young Computer Scientists , pp. 305-313
    • Gerth, R.1
  • 11
    • 84945708698 scopus 로고
    • An axiomatic basis for computer programming
    • C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
    • (1969) Communications of the ACM , vol.12 , Issue.10 , pp. 576-580
    • Hoare, C.A.R.1
  • 13
    • 33745802808 scopus 로고    scopus 로고
    • Formal certification of a compiler back-end, or: Programming a compiler with a proof assistant
    • ACM Press
    • Xavier Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In Principles of Programming Languages (POPL), pages 42-54. ACM Press, 2006.
    • (2006) In Principles of Programming Languages (POPL) , pp. 42-54
    • Leroy, X.1
  • 15
    • 84936896337 scopus 로고
    • Recursive functions of symbolic expressions and their computation by machine, part i
    • John McCarthy. Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM, 1960.
    • (1960) Communications of the ACM
    • McCarthy, J.1
  • 20
    • 77149168111 scopus 로고    scopus 로고
    • Verified LISP implementations on ARM, x86 and PowerPC
    • In Stefan Berghofer, Tobias Nipkow, Christian Urban, and MakariusWenzel, editors, LNCS. Springer
    • Magnus O. Myreen and Michael J.C. Gordon. Verified LISP implementations on ARM, x86 and PowerPC. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and MakariusWenzel, editors, Theorem Proving in Higher Order Logics (TPHOLs), LNCS. Springer, 2009.
    • (2009) Theorem Proving in Higher Order Logics (TPHOLs)
    • Myreen, M.O.1    Gordon, M.J.C.2
  • 21
    • 58049135249 scopus 로고    scopus 로고
    • Machine-code verification for multiple architectures - An application of decompilation into logic
    • In Alessandro Cimatti and Robert B. Jones, editors, IEEE
    • Magnus O. Myreen, Konrad Slind, and Michael J. C. Gordon. Machine-code verification for multiple architectures - An application of decompilation into logic. In Alessandro Cimatti and Robert B. Jones, editors, Formal Methods in Computer Aided Design (FMCAD). IEEE, 2008.
    • (2008) Formal Methods in Computer Aided Design (FMCAD
    • Myreen, M.O.1    Slind, K.2    Gordon, M.J.C.3
  • 22
    • 77149132406 scopus 로고    scopus 로고
    • Extensible proof-producing compilation
    • In Michael I. Schwartzbach Oege de Moor, editor, LNCS. Springer
    • Magnus O. Myreen, Konrad Slind, and Michael J.C. Gordon. Extensible proof-producing compilation. In Michael I. Schwartzbach Oege de Moor, editor, Compiler Construction (CC), LNCS. Springer, 2009.
    • (2009) Compiler Construction (CC)
    • Myreen, M.O.1    Slind, K.2    Gordon, M.J.C.3
  • 24
    • 0036051192 scopus 로고    scopus 로고
    • Separation logic: A logic for shared mutable data structures
    • IEEE Computer Society
    • John Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings of Logic in Computer Science (LICS). IEEE Computer Society, 2002.
    • (2002) In Proceedings of Logic in Computer Science (LICS)
    • Reynolds, J.1
  • 26
    • 57049085253 scopus 로고    scopus 로고
    • A brief overview of HOL4
    • In Otmane Aït Mohamed, Ćesar Muñoz, and Sofìene Tahar, editors, LNCS, Springer
    • Konrad Slind and Michael Norrish. A brief overview of HOL4. In Otmane Aït Mohamed, Ćesar Muñoz, and Sofìene Tahar, editors, Theorem Proving in Higher Order Logics (TPHOLs), LNCS, pages 28-32. Springer, 2008.
    • (2008) Theorem Proving in Higher Order Logics (TPHOLs) , pp. 28-32
    • Slind, K.1    Norrish, M.2
  • 28
    • 0003149702 scopus 로고    scopus 로고
    • Why are we using Java again?
    • Paul Tyma. Why are we using Java again? Commun. ACM, 41(6):38-42, 1998.
    • (1998) Commun. ACM , vol.41 , Issue.6 , pp. 38-42
    • Tyma, P.1
  • 29
    • 1442335816 scopus 로고    scopus 로고
    • Building certified libraries for PCC: Dynamic storage allocation
    • Dachuan Yu, Nadeem A. Hamid, and Zhong Shao. Building certified libraries for PCC: Dynamic storage allocation. Science of Computer Programming, 50(1-3):101-127, 2004.
    • (2004) Science of Computer Programming , vol.50 , Issue.1-3 , pp. 101-127
    • Yu, D.1    Hamid, N.A.2    Shao, Z.3


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