메뉴 건너뛰기




Volumn , Issue , 2006, Pages 320-333

Certified assembly programming with embedded code pointers

Author keywords

Embedded Code Pointers; Higher Order Functions; Hoare Logic; Proof Carrying Code

Indexed keywords

BINARY CODES; FORMAL LOGIC; PROBLEM SOLVING; PROGRAM ASSEMBLERS; SEMANTICS; SYNTACTICS;

EID: 33745858708     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1111037.1111066     Document Type: Conference Paper
Times cited : (67)

References (45)
  • 6
    • 0038559204 scopus 로고    scopus 로고
    • An indexed model of recursive types for foundational proof-carrying code
    • Sept.
    • A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems, 23(5):657-683, Sept. 2001.
    • (2001) ACM Transactions on Programming Languages and Systems , vol.23 , Issue.5 , pp. 657-683
    • Appel, A.W.1    McAllester, D.2
  • 8
    • 0029694846 scopus 로고    scopus 로고
    • Automated proofs of object code for a widely used microprocessor
    • R. S. Boyer and Y. 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
  • 14
    • 0013260541 scopus 로고
    • Lambda calculus notation with nameless dummies
    • N. G. de Bruijn. Lambda calculus notation with nameless dummies. Indagationes Mathematicae, 34:381-392, 1972.
    • (1972) Indagationes Mathematicae , vol.34 , pp. 381-392
    • De Bruijn, N.G.1
  • 15
    • 33745212020 scopus 로고    scopus 로고
    • Modular verification of concurrent assembly code with dynamic thread creation and termination
    • Sept.
    • X. Feng and Z. Shao. Modular verification of concurrent assembly code with dynamic thread creation and termination. In Proc. 2005 International Conference on Functional Programming, pages 254-267, Sept. 2005.
    • (2005) Proc. 2005 International Conference on Functional Programming , pp. 254-267
    • Feng, X.1    Shao, Z.2
  • 17
    • 1942481169 scopus 로고
    • A mechanized Hoare logic of state transitions
    • A. W. Roscoe, editor. Prentice Hall
    • M. Gordon. A mechanized Hoare logic of state transitions. In A. W. Roscoe, editor, A Classical Mind - Essays in Honour of C.A.R. Hoare, pages 143-160. Prentice Hall, 1994.
    • (1994) A Classical Mind - Essays in Honour of C.A.R. Hoare , pp. 143-160
    • Gordon, M.1
  • 19
    • 35048897411 scopus 로고    scopus 로고
    • Interfacing hoare logic and type systems for foundational proof-carrying code
    • volume 3223 of LNCS. Springer-Verlag, Sept.
    • N. A. Hamid and Z. Shao. Interfacing hoare logic and type systems for foundational proof-carrying code. In Proc. I7th International Conference on Theorem Proving in Higher Order Logics, volume 3223 of LNCS, pages 118-135. Springer-Verlag, Sept. 2004.
    • (2004) Proc. I7th International Conference on Theorem Proving in Higher Order Logics , pp. 118-135
    • Hamid, N.A.1    Shao, Z.2
  • 22
    • 84945708698 scopus 로고
    • An axiomatic basis for computer programming
    • Oct.
    • C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, Oct. 1969.
    • (1969) Communications of the ACM
    • Hoare, C.A.R.1
  • 28
    • 0035452474 scopus 로고    scopus 로고
    • Predicate transformer semantics of a higher-order imperative language with record subtyping
    • D. A. Naumann. Predicate transformer semantics of a higher-order imperative language with record subtyping. Science of Computer Programming, 41(1):1-51, 2001.
    • (2001) Science of Computer Programming , vol.41 , Issue.1 , pp. 1-51
    • Naumann, D.A.1
  • 30
    • 0004118855 scopus 로고    scopus 로고
    • PhD thesis, School of Computer Science, Carnegie Mellon Univ., Sept.
    • G. Necula. Compiling with Proofs. PhD thesis, School of Computer Science, Carnegie Mellon Univ., Sept. 1998.
    • (1998) Compiling with Proofs
    • Necula, G.1
  • 31
    • 0041967382 scopus 로고    scopus 로고
    • A sound framework for untrustred verification-condition generators
    • IEEE Computer Society, July
    • G. C. Necula and R. R. Schneck. A sound framework for untrustred verification-condition generators. In Proceedings of IEEE Symposium on Logic in Computer Science, pages 248-260. IEEE Computer Society, July 2003.
    • (2003) Proceedings of IEEE Symposium on Logic in Computer Science , pp. 248-260
    • Necula, G.C.1    Schneck, R.R.2
  • 34
    • 84947743461 scopus 로고
    • Inductive definitions in the system Coq - Rules and properties
    • M. Bezem and J. Groote, editors, Proc. TLCA, Springer-Verlag
    • C. Paulin-Mohring. Inductive definitions in the system Coq - rules and properties. In M. Bezem and J. Groote, editors, Proc. TLCA, volume 664 of LNCS, Springer-Verlag, 1993.
    • (1993) LNCS , vol.664
    • Paulin-Mohring, C.1
  • 40
    • 33745806760 scopus 로고    scopus 로고
    • The Coq proof assistant reference manual
    • Oct.
    • The Coq Development Team. The Coq proof assistant reference manual. The Coq release v8.0, Oct. 2005.
    • (2005) The Coq Release V8.0
  • 41
  • 43
    • 1442335816 scopus 로고    scopus 로고
    • Building certified libraries for PCC: Dynamic storage allocation
    • Mar.
    • D. Yu, N. A. Hamid, and Z. Shao. Building certified libraries for PCC: Dynamic storage allocation. Science of Computer Programming, 50(1-3):101-127, Mar. 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가 분석하여 추출한 것입니다.