메뉴 건너뛰기




Volumn , Issue , 2009, Pages 430-440

Synthesizing intensional behavior models by graph transformation

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIOR MODEL; BLACK BOXES; DATA ABSTRACTION; FINITE STATE MACHINES; FORMAL SPECIFICATION; GRAPH TRANSFORMATION; GRAPH TRANSFORMATION RULES; INFINITE NUMBERS; RUNTIMES; SOFTWARE COMPONENT;

EID: 77949876750     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2009.5070542     Document Type: Conference Paper
Times cited : (62)

References (25)
  • 1
    • 77949887900 scopus 로고    scopus 로고
    • Amazon Simple Queue Service
    • Amazon Simple Queue Service. http://aws.amazon.com/sqs/.
  • 2
    • 77949892370 scopus 로고    scopus 로고
    • OpenJDK project
    • OpenJDK project. http://jdk7.dev.java.net/.
  • 3
    • 77949877888 scopus 로고    scopus 로고
    • Spy website. http://home.dei.polimi.it/mocci/spy/.
    • Spy website
  • 4
    • 85042866826 scopus 로고    scopus 로고
    • L. Baresi, C. Ghezzi, A. Mocci, and M. Monga. Using graph transformation systems to specify and verify data abstractions. In Proc. of GT-VMT'08, Electronic Communications of the EASST, X (2008), 2008.
    • L. Baresi, C. Ghezzi, A. Mocci, and M. Monga. Using graph transformation systems to specify and verify data abstractions. In Proc. of GT-VMT'08, Electronic Communications of the EASST, Volume X (2008), 2008.
  • 6
    • 34247334247 scopus 로고    scopus 로고
    • Object distance and its application to adaptive random testing of objectoriented programs
    • New York, NY, USA, ACM
    • I. Ciupa, A. Leitner, M. Oriol, and B. Meyer. Object distance and its application to adaptive random testing of objectoriented programs. In RT'06: Int. workshop on Random testing, pages 55-63, New York, NY, USA, 2006. ACM.
    • (2006) RT'06: Int. workshop on Random testing , pp. 55-63
    • Ciupa, I.1    Leitner, A.2    Oriol, M.3    Meyer, B.4
  • 7
    • 57349101753 scopus 로고    scopus 로고
    • DySy: Dynamic symbolic execution for invariant inference
    • New York, NY, USA, ACM
    • C. Csallner, N. Tillmann, and Y. Smaragdakis. DySy: dynamic symbolic execution for invariant inference. In Int. Conf. on Software engineering, pages 281-290, New York, NY, USA, 2008. ACM.
    • (2008) Int. Conf. on Software engineering , pp. 281-290
    • Csallner, C.1    Tillmann, N.2    Smaragdakis, Y.3
  • 9
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, pages 269-271, 1959.
    • (1959) Numerische Mathematik , pp. 269-271
    • Dijkstra, E.W.1
  • 12
    • 33846171541 scopus 로고    scopus 로고
    • Discovering Likely Program Invariants. Ph.D. thesis, University of Washington, Seattle, Washington, Aug
    • M. D. Ernst. Dynamically Discovering Likely Program Invariants. Ph.D. thesis, University of Washington, Seattle, Washington, Aug. 2000.
    • (2000) Dynamically
    • Ernst, M.D.1
  • 13
    • 77950536883 scopus 로고    scopus 로고
    • Efficient recovery of algebraic specifications for stateful components
    • Dubrovnik, Croatia, Sept
    • C. Ghezzi, A. Mocci, and M. Monga. Efficient recovery of algebraic specifications for stateful components. In Int. Wks. on Principles of Software Evolution, Dubrovnik, Croatia, Sept. 2007.
    • (2007) Int. Wks. on Principles of Software Evolution
    • Ghezzi, C.1    Mocci, A.2    Monga, M.3
  • 16
    • 34547106298 scopus 로고    scopus 로고
    • Discovering documentation for Java container classes
    • J. Henkel, C. Reichenbach, and A. Diwan. Discovering documentation for Java container classes. IEEE Trans. Software Eng., 33(8):526-543, 2007.
    • (2007) IEEE Trans. Software Eng , vol.33 , Issue.8 , pp. 526-543
    • Henkel, J.1    Reichenbach, C.2    Diwan, A.3
  • 17
    • 14844363625 scopus 로고    scopus 로고
    • Service-oriented computing: Key concepts and principles
    • M. N. Huhns and M. P. Singh. Service-oriented computing: Key concepts and principles. IEEE Internet Computing, 9(1):75-81, 2005.
    • (2005) IEEE Internet Computing , vol.9 , Issue.1 , pp. 75-81
    • Huhns, M.N.1    Singh, M.P.2
  • 19
    • 84976742884 scopus 로고
    • Limits of the "algebraic" specification of abstract data types
    • M. E. Majster. Limits of the "algebraic" specification of abstract data types. SIGPLAN Notices, 12(10):37-42, 1977.
    • (1977) SIGPLAN Notices , vol.12 , Issue.10 , pp. 37-42
    • Majster, M.E.1
  • 21
    • 0030615469 scopus 로고    scopus 로고
    • Lackwit: A program understanding tool based on type inference
    • R. O'Callahan and D. Jackson. Lackwit: A program understanding tool based on type inference. In Int. Conf. on Software Engineering, pages 338-348, 1996.
    • (1996) Int. Conf. on Software Engineering , pp. 338-348
    • O'Callahan, R.1    Jackson, D.2
  • 24
    • 34247342048 scopus 로고    scopus 로고
    • AGG: A graph transformation environment for modeling and validation of software
    • Application of Graph Transformations with Industrial Relevance, of, Springer
    • G. Taentzer. AGG: A graph transformation environment for modeling and validation of software. In Application of Graph Transformations with Industrial Relevance, volume 3062 of LNCS, pages 446-456. Springer, 2004.
    • (2004) LNCS , vol.3062 , pp. 446-456
    • Taentzer, G.1
  • 25
    • 34247117853 scopus 로고    scopus 로고
    • Automatic extraction of abstract-object-state machines from unit-test executions
    • May
    • T. Xie, E. Martin, and H. Yuan. Automatic extraction of abstract-object-state machines from unit-test executions. In Int. Conf. on Software Engineering, Research Demos, pages 835-838, May 2006.
    • (2006) Int. Conf. on Software Engineering, Research Demos , pp. 835-838
    • Xie, T.1    Martin, E.2    Yuan, H.3


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