메뉴 건너뛰기




Volumn 3, Issue 9 SPEC. ISS., 2004, Pages 29-52

The correctness of the definite assignment analysis in C#

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTATIONAL METHODS; DATA FLOW ANALYSIS; SET THEORY; THEOREM PROVING;

EID: 18144408623     PISSN: 16601769     EISSN: 16601769     Source Type: Journal    
DOI: 10.5381/jot.2004.3.9.a2     Document Type: Article
Times cited : (11)

References (13)
  • 4
    • 18444399996 scopus 로고    scopus 로고
    • The Mono project. Web pages at http://www.go-mono.com/.
  • 5
    • 18444396676 scopus 로고    scopus 로고
    • The correctness of the definite assignment analysis in C#
    • ETH Zürich
    • N. G. Fruja. The Correctness of the Definite Assignment Analysis in C#. Technical Report 435, ETH Zürich, 2004. http://www.inf.ethz.ch/~fruja.
    • (2004) Technical Report , vol.435
    • Fruja, N.G.1
  • 13
    • 84972541021 scopus 로고
    • A lattice-theoretical fix-point theorem and its applications
    • A. Tarski. A lattice-theoretical fix-point theorem and its applications. Pacific Journal of Mathematics 5, 1955.
    • (1955) Pacific Journal of Mathematics , vol.5
    • Tarski, A.1


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