메뉴 건너뛰기




Volumn , Issue , 2003, Pages

Certification support for automatically generated programs

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; CODES (SYMBOLS); NETWORK COMPONENTS; SOFTWARE DESIGN; TIME SERIES ANALYSIS;

EID: 84969579928     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2003.1174914     Document Type: Conference Paper
Times cited : (9)

References (26)
  • 1
  • 4
    • 0035250541 scopus 로고    scopus 로고
    • Dynamically discovering likely program invariants to support program evolution
    • Feb.
    • M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Trans. Software Engineering, 27(2):1-25, Feb. 2001.
    • (2001) IEEE Trans. Software Engineering , vol.27 , Issue.2 , pp. 1-25
    • Ernst, M.D.1    Cockrell, J.2    Griswold, W.G.3    Notkin, D.4
  • 6
    • 15844430401 scopus 로고    scopus 로고
    • AutoBayes: A system for generating data analysis programs from statistical models
    • B. Fischer and J. Schumann. AutoBayes: A system for generating data analysis programs from statistical models. J. Functional Programming, 2002. To appear. http://ase.arc.nasa.gov/people/fischer/.
    • (2002) J. Functional Programming
    • Fischer, B.1    Schumann, J.2
  • 7
    • 84881144443 scopus 로고    scopus 로고
    • Houdini, an annotation assistant for ESC/Java
    • J. Oliveira and P. Zave (eds.), Proc. Intl. Symp. Formal Methods Europe 2001: Formal Methods for Increasing Software Productivity, Springer
    • C. Flanagan and K. R. M. Leino. Houdini, an annotation assistant for ESC/Java. In J. Oliveira and P. Zave (eds.), Proc. Intl. Symp. Formal Methods Europe 2001: Formal Methods for Increasing Software Productivity, LNCS 2021, pp. 500-517, Springer, 2001.
    • (2001) LNCS , vol.2021 , pp. 500-517
    • Flanagan, C.1    Leino, K.R.M.2
  • 8
    • 84951193536 scopus 로고    scopus 로고
    • An automated approach for supporting software reuse via reverse engineering
    • D. F. Redmiles and B. Nuseibeh (eds.), IEEE Comp. Soc. Press
    • G. C. Gannod, Y. Chen, and B. H. C. Cheng. An automated approach for supporting software reuse via reverse engineering. In D. F. Redmiles and B. Nuseibeh (eds.), Proc. 13th Intl. Conf. Automated Software Engineering, pp. 79-86, IEEE Comp. Soc. Press, 1998.
    • (1998) Proc. 13th Intl. Conf. Automated Software Engineering , pp. 79-86
    • Gannod, G.C.1    Chen, Y.2    Cheng, B.H.C.3
  • 10
    • 0033337979 scopus 로고    scopus 로고
    • Certifying compilation and run-time code generation
    • L. Hornof and T. Jim. Certifying compilation and run-time code generation. Higher-Order and Symbolic Computation, 12(4):337-375, 1999.
    • (1999) Higher-Order and Symbolic Computation , vol.12 , Issue.4 , pp. 337-375
    • Hornof, L.1    Jim, T.2
  • 12
    • 0344195799 scopus 로고    scopus 로고
    • PhD thesis, University of Cambridge, Apr. Published as UCCL TR391
    • A: Kennedy. Programming Languages and Dimensions. PhD thesis, University of Cambridge, Apr. 1996. Published as UCCL TR391.
    • (1996) Programming Languages and Dimensions
    • Kennedy, A.1
  • 13
    • 8344287687 scopus 로고    scopus 로고
    • Program synthesis
    • W. Bibel and P. H. Schmitt (eds.), Kluwer
    • C. Kreitz. Program synthesis. In W. Bibel and P. H. Schmitt (eds.), Automated Deduction - A Basis for Applications, pp. 105-134. Kluwer, 1998.
    • (1998) Automated Deduction - A Basis for Applications , pp. 105-134
    • Kreitz, C.1
  • 15
    • 84976783546 scopus 로고
    • Verification of array, record, and pointer operations in Pascal
    • Oct.
    • D. C. Luckham and N. Suzuki. Verification of array, record, and pointer operations in Pascal. ACM Trans. Programming Languages and Systems, 1(2):226-244, Oct. 1979.
    • (1979) ACM Trans. Programming Languages and Systems , vol.1 , Issue.2 , pp. 226-244
    • Luckham, D.C.1    Suzuki, N.2
  • 16
    • 49249101269 scopus 로고    scopus 로고
    • Efficient representation and validation of logical proofs
    • IEEE Comp. Soc. Press
    • G. C. Necula and P. Lee. Efficient representation and validation of logical proofs. In Proc. 13th Annual IEEE Symp. Logic in Computer Science, pp. 93-104, IEEE Comp. Soc. Press, 1998.
    • (1998) Proc. 13th Annual IEEE Symp. Logic in Computer Science , pp. 93-104
    • Necula, G.C.1    Lee, P.2
  • 19
    • 0003970441 scopus 로고    scopus 로고
    • Enforceable security policies
    • Cornell University, September
    • F. B. Schneider. Enforceable security policies. Computer Science Technical Report TR98-1644, Cornell University, September 1998.
    • (1998) Computer Science Technical Report
    • Schneider, F.B.1
  • 21
    • 84948991364 scopus 로고    scopus 로고
    • AutoBayes/CC - Combining program synthesis with automatic code certification (system description)
    • A. Voronkov (ed.), Proc. 18th Intl. Conf. Automated Deduction, Springer
    • M. Whalen, J. Schumann, and B. Fischer. AutoBayes/CC - combining program synthesis with automatic code certification (system description). In A. Voronkov (ed.), Proc. 18th Intl. Conf. Automated Deduction, LNAI 2392, pp. 290-294. Springer, 2002.
    • (2002) LNAI , vol.2392 , pp. 290-294
    • Whalen, M.1    Schumann, J.2    Fischer, B.3
  • 22
    • 84937395892 scopus 로고    scopus 로고
    • Synthesizing certified code
    • L.-H. Eriksson and P. A. Lindsay (eds.), Proc. Intl. Symp. Formal Methods Europe 2002: Formal Methods - Getting IT Right, Springer
    • M. Whalen, J. Schumann, and B. Fischer. Synthesizing certified code. In L.-H. Eriksson and P. A. Lindsay (eds.), Proc. Intl. Symp. Formal Methods Europe 2002: Formal Methods - Getting IT Right, LNCS 2391, pp. 431-450. Springer, 2002.
    • (2002) LNCS , vol.2391 , pp. 431-450
    • Whalen, M.1    Schumann, J.2    Fischer, B.3
  • 26
    • 0347507512 scopus 로고    scopus 로고
    • Eliminating array bound checking through dependent types
    • Proc. ACM Conf. Programming Language Design and Implementation 1998, ACM Press, Published
    • H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In Proc. ACM Conf. Programming Language Design and Implementation 1998, pp. 249-257. ACM Press, 1998. Published as SIGPLAN Notices 33(5).
    • (1998) SIGPLAN Notices , vol.33 , Issue.5 , pp. 249-257
    • Xi, H.1    Pfenning, F.2


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