메뉴 건너뛰기




Volumn , Issue , 2001, Pages 172-176

Set-based access conflicts analysis of concurrent workflow definition

Author keywords

[No Author keywords available]

Indexed keywords

WORK SIMPLIFICATION;

EID: 62449138438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CODAS.2001.945164     Document Type: Conference Paper
Times cited : (5)

References (12)
  • 7
    • 22944476152 scopus 로고    scopus 로고
    • A Cost-effective Estimation of Uncaught Exceptions in SML Programs
    • K. Yi and S. Ryu, "A Cost-effective Estimation of Uncaught Exceptions in SML Programs," Theoretical Computer Science, Vol. 273, No. 1, 2000.
    • (2000) Theoretical Computer Science , vol.273 , Issue.1
    • Yi, K.1    Ryu, S.2
  • 8
    • 0003721364 scopus 로고
    • Ph.D.thesis, School of Computer Science, Carnegie Mellon University, October
    • N. Heintze, "Set Based Program Analysis," Ph.D.thesis, School of Computer Science, Carnegie Mellon University, October 1992.
    • (1992) Set Based Program Analysis
    • Heintze, N.1


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