메뉴 건너뛰기




Volumn 25, Issue 10, 1994, Pages 1-14

Detection of unfeasible paths with a path‐dependence flow graph

Author keywords

abstract interpretation; Computation path; data flow computation model; program analysis; symbolic execution

Indexed keywords

CODES (SYMBOLS); COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LOGIC PROGRAMMING; PROGRAM DIAGNOSTICS; SUBROUTINES;

EID: 0028515484     PISSN: 08821666     EISSN: 1520684X     Source Type: Journal    
DOI: 10.1002/scj.4690251001     Document Type: Article
Times cited : (1)

References (19)
  • 1
    • 0016971687 scopus 로고
    • Symbolic execution and Program testing
    • July
    • (1976) Commun. ACM , vol.19 , Issue.7 , pp. 385-394
    • King, J.C.1
  • 4
    • 84983954355 scopus 로고
    • Detecting an interference in modified programs with a semantic configuration manager, The 45th Annual Convention Information Processing Society of Japan, 6T‐1, Sept.
    • (1992)
    • Naoi, K.1    Takahashi, N.2
  • 6
    • 84984063333 scopus 로고
    • From Control Flow to Dataflow, Proceedings of the 1990 International Conferenceon Parallel Processing, pp., Aug
    • (1990) , pp. 1143-1152
    • Beck, M.1    Pingali, K.2
  • 9
    • 84984028053 scopus 로고
    • Abstract interpretation—its framework and examples, Functional Programming Research Group, Software Science Society, Jan.
    • (1992)
    • Ono, S.1
  • 14
    • 84984024803 scopus 로고
    • Detection of unfeasible paths with Presburger arithmetic, Tech. Report of I.E.I.C.E., KBSE92–38, Nov.
    • (1992)
    • Naoi, K.1    Takahashi, N.2
  • 17
    • 84984024789 scopus 로고
    • Generalized Algorithmic Debugging, PhD Thesis, Linköping University
    • (1991)
    • Shahmehri, N.1


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