kth.sePublications
Change search
Refine search result
1 - 9 of 9
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Feng, Lei
    et al.
    KTH, School of Industrial Engineering and Management (ITM), Machine Design (Dept.), Mechatronics.
    Lundmark, Simon
    Meinke, Karl
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Niu, Fei
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Mudassar A.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Wong, Peter Y. H.
    Case studies in learning-based testing2013In: Testing Software and Systems: 25th IFIP WG 6.1 International Conference, ICTSS 2013, Istanbul, Turkey, November 13-15, 2013, Proceedings, Springer, 2013, p. 164-179Conference paper (Refereed)
    Abstract [en]

    We present case studies which show how the paradigm of learning-based testing (LBT) can be successfully applied to black-box requirements testing of industrial reactive systems. For this, we apply a new testing tool LBTest, which combines algorithms for incremental black-box learning of Kripke structures with model checking technology. We show how test requirements can be modeled in propositional linear temporal logic extended by finite data types.We then provide benchmark performance results for LBTest applied to three industrial case studies.

    Download full text (pdf)
    fulltext
  • 2.
    Feng, Lei
    et al.
    KTH, School of Industrial Engineering and Management (ITM), Machine Design (Dept.), Mechatronics.
    Meinke, Karl
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Niu, Fei
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Wong, Peter Y. H.
    SDL Fredhopper.
    Case Studies in Learning-based Testing2013Report (Other academic)
    Abstract [en]

    We present case studies which show how the paradigm of learning-based testing (LBT) can be successfully applied to black-box requirements testing of reactive systems. For this we apply a new testing tool LBTest, which combines algorithms for incremental black-box learning of Kripke structures with model checking technology. We show how test requirements can be modeled in propositional linear temporal logic extended by finite abstract data types. We provide benchmark performance results for LBTest applied to two industrial case studies. Finally we present a first coverage study for the tool.

  • 3.
    Meinke, Karl
    et al.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Niu, Fei
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Learning-based software testing: A tutorial2012In: Leveraging Applications of Formal Methods, Verification, and Validation: International Workshops, SARS 2011 and MLSC 2011, Held Under the Auspices of ISoLA 2011 in Vienna, Austria, October 17-18, 2011. Revised Selected Papers / [ed] Reiner Hähnle, Jens Knoop, Tiziana Margaria, Dietmar Schreiner, Bernhard Steffen, Springer, 2012, p. 200-219Conference paper (Refereed)
    Abstract [en]

    We present an overview of the paradigm of learning-based testing (LBT) for software systems. LBT is a fully automated method for specification-based black-box testing using computational learning principles. It applies the principle of tests as queries, where queries are either generated by a learning algorithm or by a model checker through use of a formal requirements specification. LBT can be applied to automate black-box testing of a variety of different software architectures including procedural and reactive systems. We describe some different testing platforms which have been designed using this paradigm and some representative evaluation results. We also compare LBT with related testing methods.

  • 4.
    Meinke, Karl
    et al.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    An Efficient Model Inference Algorithm for Learning-based Testing of Reactive Systems2012Report (Other academic)
    Abstract [en]

    Learning-based testing (LBT) is an emerging methodology to automate iterative black-box requirements testing of software systems. The methodology involves combining model inference with model checking techniques. However, a variety of optimisations on model inference are necessary in order to achieve scalable testing for large systems.

    In this paper we describe the IKL learning algorithm which is an active incremental learning algorithm for deterministic Kripke structures. We formally prove the correctness of IKL. We discuss the optimisations it incorporates to achieve scalability of testing. We also evaluate a black box heuristic for test termination based on convergence of IKL learning.

  • 5.
    Meinke, Karl
    et al.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Correctness and Performance of an Incremental Learning Algorithm for Finite Automata2011Conference paper (Other academic)
    Abstract [en]

    We present a new algorithm IDS for incremental learning of deterministic finite automata (DFA). This algorithm is based on the concept of distinguishing sequences introduced in (Angluin, 1981). We give a rigorous proof that two versions of this learning algorithm correctly learn in the limit. Finally we present an empirical performance analysis that compares these two algorithms, focussing on learning times and different types of learning queries. We conclude that IDS is an efficient algorithm for software engineering applications of automata learning, such as testing and model inference.

  • 6.
    Meinke, Karl
    et al.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Correctness and Performance of an Incremental Learning Algorithm for Finite Automata2010Report (Other academic)
    Abstract [en]

    We present a new algorithm IDSfor incremental learning of deterministic finite automata (DFA). This algorithm is based on the concept of distinguishing sequences introduced in [Angluin 1981]. We give a rigorous proof that two versions of this learning algorithm correctly learn in the limit. Finally we present an empirical performance analysis that compares these two algorithms, focussing on learning times and different types of learning queries. We conclude that IDSis an efficient algorithm for software engineering applications of automata learning, such as testing and model inference.

    Download full text (pdf)
    fulltext
  • 7.
    Meinke, Karl
    et al.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Incremental Learning based Testing for Reactive Systems2011In: / [ed] Martin Gogolla and Burkhart Wolff, 2011, p. 134-151Conference paper (Refereed)
    Abstract [en]

    We show how the paradigm of learning-based testing (LBT)can be applied to automate specification-based black-box testing of reactivesystems. Since reactive systems can be modeled as Kripke structures,we introduce an efficient incremental learning algorithm IKL forsuch structures. We show how an implementation of this algorithm combinedwith an efficient model checker such as NuSMV yields an effectivelearning-based testing architecture for automated test case generation(ATCG), execution and evaluation, starting from temporal logic requirements.

  • 8.
    Meinke, Karl
    et al.
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    LBTest: A Learning-based Testing Tool for Reactive Systems2013In: Proceedings - IEEE 6th International Conference on Software Testing, Verification and Validation, ICST 2013, IEEE Computer Society, 2013, p. 447-454Conference paper (Refereed)
    Abstract [en]

    We give an introduction to the LBTest tool which implements learning-based testing for reactive systems. It makes use of incremental learning and model checking algorithms to automate: i) test case generation, ii) test execution and iii) test verdict construction. The paper illustrates the tool by means of a pedagogical case study, to enable the user to setup and learn the tool quickly. We provide a usability exercise to support tool evaluation.

  • 9.
    Sindhu, Muddassar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Algorithms and Tools for Learning-based Testing of Reactive Systems2013Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    In this thesis we investigate the feasibility of learning-based testing (LBT) as a viable testing methodology for reactive systems. In LBT, a large number of test cases are automatically generated from black-box requirements for the system under test (SUT) by combining an incremental learning algorithm with a model checking algorithm. The integration of the SUT with these algorithms in a feedback loop optimizes test generation using the results from previous outcomes. The verdict for each test case is also created automatically in LBT.

    To realize LBT practically, existing algorithms in the literature both for complete and incremental learning of finite automata were studied. However, limitations in these algorithms led us to design, verify and implement new incremental learning algorithms for DFA and Kripke structures. On the basis of these algorithms we implemented an LBT architecture in a practical tool called LBTest which was evaluated on pedagogical and industrial case studies.

    The results obtained from both types of case studies show that LBT is an effective methodology which discovers errors in reactive SUTs quickly and can be scaled to test industrial applications. We believe that this technology is easily transferrable to industrial users because of its high degree of automation.

    Download full text (pdf)
    fulltext
1 - 9 of 9
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf