메뉴 건너뛰기




Volumn 127, Issue 4, 2005, Pages 71-86

Termination of high-level replacement units with application to model transformation

Author keywords

Graph transformation; Refactoring; Termination; Transformation units

Indexed keywords

AUTOMATION; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; COMPUTER SOFTWARE; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

EID: 16244381462     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.08.048     Document Type: Conference Paper
Times cited : (8)

References (17)
  • 1
    • 0005255125 scopus 로고    scopus 로고
    • Graph rewrite systems for program optimization
    • U. Aßmann Graph rewrite systems for program optimization ACM TOPLAS 22 2000 583 637
    • (2000) ACM TOPLAS , vol.22 , pp. 583-637
    • Aßmann, U.1
  • 5
    • 0033680457 scopus 로고    scopus 로고
    • Efficient parsing of visual languages based on critical pair analysis (and contextual layered graph transformation)
    • Bottoni, P., G. Taentzer and A. Schürr, Efficient parsing of visual languages based on critical pair analysis (and contextual layered graph transformation), in: IEEE Symposium Visual Languages (2000), pp. 59-61
    • (2000) IEEE Symposium Visual Languages , pp. 59-61
    • Bottoni, P.1    Taentzer, G.2    Schürr, A.3
  • 6
    • 0018504528 scopus 로고
    • Proving termination with multiset orderings
    • N. Dershowitz, and Z. Manna Proving termination with multiset orderings Commun. ACM 22 1979 465 476
    • (1979) Commun. ACM , vol.22 , pp. 465-476
    • Dershowitz, N.1    Manna, Z.2
  • 8
    • 35048875012 scopus 로고    scopus 로고
    • Constraints and Application Conditions: From Graphs to High-Level Structures
    • H. Ehrig, and A. Habel Constraints and Application Conditions: From Graphs to High-Level Structures Proc. Int. Conf. on Graph Transformation 2004 2004 to appear
    • (2004) Proc. Int. Conf. on Graph Transformation 2004
    • Ehrig, H.1    Habel, A.2
  • 12
    • 0030172972 scopus 로고    scopus 로고
    • Graph Grammars with Negative Application Conditions
    • A. Habel, R. Heckel, and G. Taentzer Graph Grammars with Negative Application Conditions Fundamenta Informaticae 26 1996 287 313
    • (1996) Fundamenta Informaticae , vol.26 , pp. 287-313
    • Habel, A.1    Heckel, R.2    Taentzer, G.3
  • 14
    • 84878373579 scopus 로고    scopus 로고
    • Defining and Validating Transformations of UML Models
    • J.M. Küster, R. Heckel, and G. Engels Defining and Validating Transformations of UML Models Proc. HCC 2003 2003 145 152
    • (2003) Proc. HCC 2003 , pp. 145-152
    • Küster, J.M.1    Heckel, R.2    Engels, G.3
  • 15
    • 84937207194 scopus 로고    scopus 로고
    • Formalising behaviour preserving program transformations
    • A. Corradini H. Ehrig H.-J. Kreowski G. Rozenberg
    • T. Mens, S. Demeyer, and D. Janssens Formalising behaviour preserving program transformations A. Corradini H. Ehrig H.-J. Kreowski G. Rozenberg Proc. ICGT02 2002 286 301
    • (2002) Proc. ICGT02 , pp. 286-301
    • Mens, T.1    Demeyer, S.2    Janssens, D.3
  • 16
    • 0009399483 scopus 로고    scopus 로고
    • Termination of graph rewriting is undecidable
    • D. Plump Termination of graph rewriting is undecidable Fundamenta Informaticae 33 1998 201 209
    • (1998) Fundamenta Informaticae , vol.33 , pp. 201-209
    • Plump, D.1


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