메뉴 건너뛰기




Volumn 4171 LNCS, Issue , 2008, Pages 502-509

Programming with proofs: Language-based approaches to totally correct software

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL APPLICATIONS; DEDUCTIVE TECHNIQUES; EXISTING SYSTEMS; PROGRAM VERIFICATION; PROGRAMMING WITH PROOFS; RESEARCH COMMUNITIES; TYPE SYSTEMS; VERIFICATION TASK;

EID: 84885600664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69149-5_55     Document Type: Conference Paper
Times cited : (1)

References (22)
  • 2
    • 33745202157 scopus 로고    scopus 로고
    • Integrated verification in type theory
    • Prague (Available from the author's website)
    • Altenkirch, T.: Integrated verification in Type Theory. Lecture notes for a course at ESSLLI 96, Prague (1996) (Available from the author's website).
    • (1996) Lecture Notes for A Course at ESSLLI 96
    • Altenkirch, T.1
  • 8
  • 10
    • 26444435643 scopus 로고    scopus 로고
    • Data structure specifications via local equality axioms
    • Etessami, K. Rajamani, S. (eds.), Springer, Heidelberg
    • McPeak, S., Necula, G.: Data Structure Specifications via Local Equality Axioms. In: Etessami, K., Rajamani, S. (eds.) 17th International Conference on Computer- Aided Verification, pp. 476-490. Springer, Heidelberg (2005).
    • (2005) 17th International Conference on Computer- Aided Verification , pp. 476-490
    • McPeak, S.1    Necula, G.2
  • 11
    • 33747097418 scopus 로고    scopus 로고
    • A mechanically checked proof of the correctness of the kernel of the amd5k86 floating-point division program
    • Moore, J., Lynch, T., Kaufmann, M.: A Mechanically Checked Proof of the Correctness of the Kernel of the AMD5k86 Floating-Point Division Program. IEEE Transactions on Computers 47(9) (1998).
    • (1998) IEEE Transactions on Computers , vol.47 , Issue.9
    • Moore, J.1    Lynch, T.2    Kaufmann, M.3
  • 14
    • 0034864194 scopus 로고    scopus 로고
    • Intensionality, extensionality, and proof irrelevance in modal type theory
    • IEEE Computer Society Press, Los Alamitos
    • Pfenning, F.: Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory. In: 16th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (2001).
    • (2001) 16th IEEE Symposium on Logic in Computer Science
    • Pfenning, F.1
  • 15
    • 23944501589 scopus 로고    scopus 로고
    • Dependently typed records in type theory
    • Pollack, R.: Dependently Typed Records in Type Theory. Formal Aspects of Computing 13, 386-402 (2002).
    • (2002) Formal Aspects of Computing , vol.13 , pp. 386-402
    • Pollack, R.1
  • 18
    • 0037331793 scopus 로고    scopus 로고
    • Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw microprocessors
    • Velev, M., Bryant, R.: Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors. Journal of Symbolic Computation 35(2), 73-106 (2003).
    • (2003) Journal of Symbolic Computation , vol.35 , Issue.2 , pp. 73-106
    • Velev, M.1    Bryant, R.2


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