메뉴 건너뛰기




Volumn , Issue , 2013, Pages 443-453

Mining branching-time scenarios

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIOR MODEL; DATA MINING ALGORITHM; EXECUTION TRACE; EXISTING SYSTEMS; LINEAR-TIME; LIVE SEQUENCE CHART; SCENARIO-BASED; SPECIFICATION MINING;

EID: 84893536557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2013.6693102     Document Type: Conference Paper
Times cited : (31)

References (42)
  • 1
    • 37849002654 scopus 로고    scopus 로고
    • Mining API patterns as partial orders from source code: From usage scenarios to specifications
    • M. Acharya, T. Xie, J. Pei, and J. Xu. Mining API patterns as partial orders from source code: from usage scenarios to specifications. In ESEC/SIGSOFT FSE, pages 25-34, 2007.
    • (2007) ESEC/SIGSOFT FSE , pp. 25-34
    • Acharya, M.1    Xie, T.2    Pei, J.3    Xu, J.4
  • 3
    • 84893633681 scopus 로고    scopus 로고
    • Columba, Java Email Client. http://sourceforge.net/projects/columba.
    • Java Email Client
  • 4
    • 78649778461 scopus 로고    scopus 로고
    • sourceforge.net/projects/crossftpserver/
    • CrossFTP Server. sourceforge.net/projects/crossftpserver/.
    • CrossFTP Server
  • 5
    • 0035393979 scopus 로고    scopus 로고
    • LSCs: Breathing life into message sequence charts
    • DOI 10.1023/A:1011227529550
    • W. Damm and D. Harel. LSCs: Breathing life into Message Sequence Charts. J. on Formal Methods in System Design, 19(1):45-80, 2001. (Pubitemid 32697643)
    • (2001) Formal Methods in System Design , vol.19 , Issue.1 , pp. 45-80
    • Damm, W.1    Harel, D.2
  • 6
    • 51149099774 scopus 로고    scopus 로고
    • Detecting implied scenarios from execution traces
    • F. C. de Sousa, N. C. Mendonça, S. Uchitel, and J. Kramer. Detecting implied scenarios from execution traces. In WCRE, pages 50-59, 2007.
    • (2007) WCRE , pp. 50-59
    • De Sousa, F.C.1    Mendonça, N.C.2    Uchitel, S.3    Kramer, J.4
  • 7
    • 0242456805 scopus 로고    scopus 로고
    • From run-time behavior to usage scenarios: An interaction-pattern mining approach
    • ACM
    • M. El-Ramly, E. Stroulia, and P. G. Sorenson. From run-time behavior to usage scenarios: an interaction-pattern mining approach. In KDD, pages 315-324. ACM, 2002.
    • (2002) KDD , pp. 315-324
    • El-Ramly, M.1    Stroulia, E.2    Sorenson, P.G.3
  • 8
    • 0022514018 scopus 로고
    • 'Sometimes' and 'not never' revisited: On branching versus linear time temporal logic
    • DOI 10.1145/4904.4999
    • E. A. Emerson and J. Y. Halpern. "sometimes" and "not never" revisited: on branching versus linear time temporal logic. J. ACM, 33(1):151-178, 1986. (Pubitemid 16461377)
    • (1986) Journal of the ACM , vol.33 , Issue.1 , pp. 151-178
    • Emerson, E.A.1    Halpern, J.Y.2
  • 9
    • 0036041420 scopus 로고    scopus 로고
    • Bugs as deviant behavior: A general approach to inferring errors in systems code
    • DOI 10.1145/502059.502041
    • D. R. Engler, D. Y. Chen, and A. Chou. Bugs as inconsistent behavior: A general approach to inferring errors in systems code. In SOSP, pages 57-72, 2001. (Pubitemid 33612605)
    • (2001) Operating Systems Review (ACM) , vol.35 , Issue.5 , pp. 57-72
    • Engler, D.1    Chen, D.Y.2    Hallem, S.3    Chou, A.4    Chelf, B.5
  • 11
    • 70350313032 scopus 로고    scopus 로고
    • Oclets - Scenario-based modeling with Petri nets
    • volume 5606 of LNCS, Springer
    • D. Fahland. Oclets - scenario-based modeling with Petri nets. In PetriNets 2009, volume 5606 of LNCS, pages 223-242. Springer, 2009.
    • (2009) PetriNets 2009 , pp. 223-242
    • Fahland, D.1
  • 12
  • 14
    • 84893589869 scopus 로고    scopus 로고
    • Mining branching LSCs: CrossFTP, Columba traces and results
    • doi:10.4121/uuid:aa7db920-aae6-4750-8975-cb739262f432
    • D. Fahland, D. Lo, and S. Maoz. Mining Branching LSCs: CrossFTP, Columba traces and results. 3TU.DataCentrum, 2013. doi:10.4121/uuid:aa7db920-aae6-4750- 8975-cb739262f432.
    • (2013) 3TU.DataCentrum
    • Fahland, D.1    Lo, D.2    Maoz, S.3
  • 15
    • 57349134461 scopus 로고    scopus 로고
    • Symbolic mining of temporal specifications
    • M. Gabel and Z. Su. Symbolic mining of temporal specifications. In ICSE, pages 51-60, 2008.
    • (2008) ICSE , pp. 51-60
    • Gabel, M.1    Su, Z.2
  • 16
    • 77954716357 scopus 로고    scopus 로고
    • Online inference and enforcement of temporal properties
    • M. Gabel and Z. Su. Online inference and enforcement of temporal properties. In ICSE, pages 15-24, 2010.
    • (2010) ICSE , pp. 15-24
    • Gabel, M.1    Su, Z.2
  • 17
    • 77955903017 scopus 로고    scopus 로고
    • Learning from 6, 000 projects: Lightweight cross-project anomaly detection
    • N. Gruska, A. Wasylkowski, and A. Zeller. Learning from 6, 000 projects: lightweight cross-project anomaly detection. In ISSTA, pages 119-130, 2010.
    • (2010) ISSTA , pp. 119-130
    • Gruska, N.1    Wasylkowski, A.2    Zeller, A.3
  • 18
    • 43449139187 scopus 로고    scopus 로고
    • Assert and negate revisited: Modal semantics for UML sequence diagrams
    • DOI 10.1007/s10270-007-0054-z
    • D. Harel and S. Maoz. Assert and negate revisited: Modal semantics for UML sequence diagrams. Software and Systems Modeling, 7(2):237-252, 2008. (Pubitemid 351663184)
    • (2008) Software and Systems Modeling , vol.7 , Issue.2 , pp. 237-252
    • Harel, D.1    Maoz, S.2
  • 20
    • 79959890862 scopus 로고    scopus 로고
    • Mining parametric specifications
    • C. Lee, F. Chen, and G. Rosu. Mining parametric specifications. In ICSE, pages 591-600, 2011.
    • (2011) ICSE , pp. 591-600
    • Lee, C.1    Chen, F.2    Rosu, G.3
  • 22
    • 34547367487 scopus 로고    scopus 로고
    • SMArTIC: Towards building an accurate, robust and scalable specification miner
    • DOI 10.1145/1181775.1181808, 1181808, Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering
    • D. Lo and S.-C. Khoo. SMArTIC: towards building an accurate, robust and scalable specification miner. In SIGSOFT FSE, pages 265-275, 2006. (Pubitemid 47129403)
    • (2006) Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering , pp. 265-275
    • Lo, D.1    Khoo, S.-C.2
  • 23
    • 56249136957 scopus 로고    scopus 로고
    • Mining scenario-based triggers and effects
    • D. Lo and S. Maoz. Mining scenario-based triggers and effects. In ASE, pages 109-118, 2008.
    • (2008) ASE , pp. 109-118
    • Lo, D.1    Maoz, S.2
  • 24
    • 77950586620 scopus 로고    scopus 로고
    • Specification mining of symbolic scenario-based models
    • S. Krishnamurthi and M. Young, editors, ACM
    • D. Lo and S. Maoz. Specification mining of symbolic scenario-based models. In S. Krishnamurthi and M. Young, editors, PASTE, pages 29- 35. ACM, 2008.
    • (2008) PASTE , pp. 29-35
    • Lo, D.1    Maoz, S.2
  • 25
    • 77952193641 scopus 로고    scopus 로고
    • Mining hierarchical scenario-based specifications
    • D. Lo and S. Maoz. Mining hierarchical scenario-based specifications. In ASE, pages 359-370, 2009.
    • (2009) ASE , pp. 359-370
    • Lo, D.1    Maoz, S.2
  • 26
    • 78649799481 scopus 로고    scopus 로고
    • Scenario-based and value-based specification mining: Better together
    • D. Lo and S. Maoz. Scenario-based and value-based specification mining: better together. In ASE, pages 387-396, 2010.
    • (2010) ASE , pp. 387-396
    • Lo, D.1    Maoz, S.2
  • 27
    • 79960551788 scopus 로고    scopus 로고
    • Towards succinctness in mining scenario-based specifications
    • D. Lo and S. Maoz. Towards succinctness in mining scenario-based specifications. In ICECCS, pages 231-240, 2011.
    • (2011) ICECCS , pp. 231-240
    • Lo, D.1    Maoz, S.2
  • 28
    • 49949117821 scopus 로고    scopus 로고
    • Mining modal scenario-based specifications from execution traces of reactive systems
    • R. E. K. Stirewalt, A. Egyed, and B. Fischer, editors. ACM
    • D. Lo, S. Maoz, and S.-C. Khoo. Mining modal scenario-based specifications from execution traces of reactive systems. In R. E. K. Stirewalt, A. Egyed, and B. Fischer, editors, ASE, pages 465-468. ACM, 2007.
    • (2007) ASE , pp. 465-468
    • Lo, D.1    Maoz, S.2    Khoo, S.-C.3
  • 29
    • 57349167281 scopus 로고    scopus 로고
    • Automatic generation of software behavioral models
    • W. Schäfer, M. B. Dwyer, and V. Gruhn, editors. ACM
    • D. Lorenzoli, L. Mariani, and M. Pezzè. Automatic generation of software behavioral models. In W. Schäfer, M. B. Dwyer, and V. Gruhn, editors, ICSE, pages 501-510. ACM, 2008.
    • (2008) ICSE , pp. 501-510
    • Lorenzoli, D.1    Mariani, L.2    Pezzè, M.3
  • 30
    • 34548747487 scopus 로고    scopus 로고
    • Compatibility and regression testing of COTS-component-based software
    • IEEE Computer Society
    • L. Mariani, S. Papagiannakis, and M. Pezzè. Compatibility and regression testing of COTS-component-based software. In ICSE, pages 85-95. IEEE Computer Society, 2007.
    • (2007) ICSE , pp. 85-95
    • Mariani, L.1    Papagiannakis, S.2    Pezzè, M.3
  • 33
    • 85034618417 scopus 로고
    • Linear and branching structures in the semantics and logics of reactive systems
    • volume 194 of LNCS. Springer
    • A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In ICALP, volume 194 of LNCS, pages 15-32. Springer, 1985.
    • (1985) ICALP , pp. 15-32
    • Pnueli, A.1
  • 34
    • 77952131540 scopus 로고    scopus 로고
    • Automatic generation of object usage specifications from large method traces
    • IEEE Computer Society
    • M. Pradel and T. R. Gross. Automatic generation of object usage specifications from large method traces. In ASE, pages 371-382. IEEE Computer Society, 2009.
    • (2009) ASE , pp. 371-382
    • Pradel, M.1    Gross, T.R.2
  • 35
    • 51149108945 scopus 로고    scopus 로고
    • Dynamic protocol recovery
    • J. Quante and R. Koschke. Dynamic protocol recovery. In WCRE, pages 219-228, 2007.
    • (2007) WCRE , pp. 219-228
    • Quante, J.1    Koschke, R.2
  • 37
    • 57349101759 scopus 로고    scopus 로고
    • Existential live sequence charts revisited
    • G. Sibay, S. Uchitel, and V. A. Braberman. Existential live sequence charts revisited. In ICSE, pages 41-50, 2008.
    • (2008) ICSE , pp. 41-50
    • Sibay, G.1    Uchitel, S.2    Braberman, V.A.3
  • 39
    • 84903203138 scopus 로고    scopus 로고
    • Branching vs. Linear Time: Final Showdown
    • Tools and Algorithms for the Construction and Analysis of Systems 7th International Conference, TACAS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001 Proceedings
    • M. Y. Vardi. Branching vs. linear time: Final showdown. In TACAS, volume 2031 of LNCS, pages 1-22. Springer, 2001. (Pubitemid 33254646)
    • (2001) Lecture Notes in Computer Science , Issue.2031 , pp. 1-22
    • Vardi, M.Y.1
  • 40
    • 56249102132 scopus 로고    scopus 로고
    • Inferring finite-state models with temporal constraints
    • N. Walkinshaw and K. Bogdanov. Inferring finite-state models with temporal constraints. In ASE, 2008.
    • (2008) ASE
    • Walkinshaw, N.1    Bogdanov, K.2
  • 41
    • 80052962441 scopus 로고    scopus 로고
    • Mining temporal specifications from object usage
    • A. Wasylkowski and A. Zeller. Mining temporal specifications from object usage. Autom. Softw. Eng., 18(3-4):263-292, 2011.
    • (2011) Autom. Softw. Eng. , vol.18 , Issue.3-4 , pp. 263-292
    • Wasylkowski, A.1    Zeller, A.2


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