메뉴 건너뛰기




Volumn 11, Issue 3, 1979, Pages 211-221

The correctness of the Schorr-Waite list marking algorithm

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0018297445     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/BF00289067     Document Type: Article
Times cited : (11)

References (15)
  • 8
    • 0017934829 scopus 로고
    • Is “sometime” sometimes better than “always”? Intermittent assertions in proving program correctness
    • (1978) Comm. ACM , vol.21 , pp. 159-172
    • Manna, Z.1    Waldinger, R.2
  • 9
    • 84933254860 scopus 로고    scopus 로고
    • Milner, R.: An algebraic definition of simulation between programs. Report No. CS-205, Computer Science Department, Stanford University, 1971
  • 11
    • 84933254861 scopus 로고    scopus 로고
    • Poupon, J., Wegbreit, B.: Covering functions. Unpublished report, Centre for Research in Computing Technology, Harvard University, 1972
  • 13
    • 84933254862 scopus 로고    scopus 로고
    • Scott, D.: Outline of a mathematical theory of computation. Proc. 4th Annual Princeton Conference on Information Sciences and Systems, pp. 169–176, 1970
  • 14
    • 84933254883 scopus 로고    scopus 로고
    • Suzuki: Automatic verification of programs with complex data structures. Ph.D. thesis, Stanford University, 1976


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