메뉴 건너뛰기




Volumn , Issue , 2010, Pages 11-19

Angluin style finite state machine inference with nonoptimal counterexamples

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; DETERMINISTIC FINITE AUTOMATA; EQUIVALENCE QUERIES; FINITE STATE MACHINES; POLYNOMIAL-TIME; RANDOM WALK;

EID: 78649787266     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1868044.1868046     Document Type: Conference Paper
Times cited : (22)

References (15)
  • 1
    • 0023453626 scopus 로고
    • Learning regular sets from queries and counterexamples
    • D. Angluin. Learning regular sets from queries and counterexamples. Information and computation, 2:87-106, 1987.
    • (1987) Information and Computation , vol.2 , pp. 87-106
    • Angluin, D.1
  • 2
    • 77954511298 scopus 로고    scopus 로고
    • Angluin-style learning of NFA
    • AAAI Press
    • B. Bollig, P. Habermehl, C. Kern and M. Leucker. Angluin- Style Learning of NFA. In IJCAI'09, pages 1004-1009. AAAI Press, 2009.
    • (2009) IJCAI'09 , pp. 1004-1009
    • Bollig, B.1    Habermehl, P.2    Kern, C.3    Leucker, M.4
  • 4
    • 33750547975 scopus 로고    scopus 로고
    • Domain-specific optimization in automata learning
    • LNCS 2725, Springer
    • Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. CAV, LNCS 2725, Springer, pages 315-327, 2003.
    • (2003) CAV , pp. 315-327
    • Hungar, H.1    Niese, O.2    Steffen, B.3
  • 5
    • 77954528276 scopus 로고    scopus 로고
    • State machine inference in testing context with long counterexamples
    • Paris, France
    • M. N. Irfan. State Machine Inference in Testing Context with Long Counterexamples. In ICST 2010, Paris, France.
    • ICST 2010
    • Irfan, M.N.1
  • 6
    • 0035017220 scopus 로고    scopus 로고
    • MAS - an interactive synthesizer to support behavioral modelling in UML
    • IEEE Computer Society
    • Mäkinen, E., Systä, T.: MAS - an interactive synthesizer to support behavioral modelling in UML. In: ICSE'01, IEEE Computer Society, pages 15-24, 2001.
    • (2001) ICSE'01 , pp. 15-24
    • Mäkinen, E.1    Systä, T.2
  • 7
    • 33745765787 scopus 로고
    • On the learnability of infinitary regular sets
    • O. Maler and A. Pnueli. On the learnability of infinitary regular sets. Inf. Comput., 118(2):316-326, 1995.
    • (1995) Inf. Comput. , vol.118 , Issue.2 , pp. 316-326
    • Maler, O.1    Pnueli, A.2
  • 8
    • 19944391951 scopus 로고    scopus 로고
    • Efficient test-based model generation for legacy reactive systems
    • IEEE Computer Society
    • Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: HLDVT, IEEE Computer Society (2004) 95-100.
    • (2004) HLDVT , pp. 95-100
    • Margaria, T.1    Niese, O.2    Raffelt, H.3    Steffen, B.4
  • 9
    • 38149107538 scopus 로고    scopus 로고
    • Monitoring architectural properties in dynamic component-based systems
    • Muccini, H., Polini, A., Ricci, F., Bertolino, A.: Monitoring architectural properties in dynamic component-based systems. In: CBSE pages 124-139, 2007.
    • (2007) CBSE , pp. 124-139
    • Muccini, H.1    Polini, A.2    Ricci, F.3    Bertolino, A.4
  • 14
    • 34848922119 scopus 로고    scopus 로고
    • Testing security properties of protocol implementations- A machine learning based approach
    • IEEE Computer Society
    • Shu, G., Lee, D.: Testing security properties of protocol implementations-a machine learning based approach. In: ICDCS, IEEE Computer Society, 25, 2007.
    • (2007) ICDCS , vol.25
    • Shu, G.1    Lee, D.2


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