Browsing by Author Pham, Ngoc Hung

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 5 of 5
  • Prev
  • 1
  • Next
  • item.jpg
  • Conference Paper


  • Authors: Tran, Dinh Duong; Pham, Ngoc Hung; Nguyen, Duy Tung (2018)

  • This paper proposes a method for automated user interface testing of Windows-based applications to increase the accuracy in identifying the target widgets or executing several interactions. The key idea of this method is to generate new test scenarios from widgets and test specification where widgets are extracted during the execution of the application and test specification is generated by combining the interactions of widgets. Furthermore, the paper contributes some techniques to detect hidden widgets which considering as one of the most challenging problems in user interface testing. Currently, a supporting tool has been implemented and tested with several industrial projects. The...

  • A Framework for Modeling and Modular Verifying of Component-based System Designs.pdf.jpg
  • Article


  • Authors: Le, Chi Luan; Tran, Hoang Viet; Pham, Ngoc Hung (2016)

  • This paper introduces a framework for modeling and verifying safety properties of component-based systems (CBS) by extracting their models from designs in the form of UML 2.0 sequence diagrams. Given UML 2.0 sequence diagrams of a CBS, the framework extracts regular expressions exactly describing behaviors of the system. From these expressions, the proposed framework then generates accurate operation models represented by labeled transition systems (LTSs). After that, these models are used to modular check whether given designs satisfy required safety properties by using the assume-guarantee reasoning paradigm. This framework is not only useful for modeling and verifying designs at...

  • item.jpg
  • Conference Paper


  • Authors: Tran, Nguyen Huong; Do, Minh Kha; Hoang, Viet Tran; Pham, Ngoc Hung (2020)

  • This paper presents two test data automatic generation methods which are based on weighted control flow graph (named WCFT) and boundary values of input parameters (named BVTG). Firstly, WCFT method generates a CFG from a given unit function, updates weight for it, then generates test data from the greatest weight test paths. In the meantime, WCFT can And dead code that can be used for automatic source code errors fix. Secondly, BVTG method generates test data from boundary values of input parameters of the given unit function. The combination of the two generated test data sets from these two methods will improve the error detection ability while maintaining a high code coverage. An i...

  • A Method for Automated Test Cases Generation.pdf.jpg
  • Article


  • Authors: Vu, Thi Dao; Pham, Ngoc Hung; Nguyen, Viet Ha (2016)

  • This paper proposes an automated test cases generation method from sequence diagrams, class diagrams, and object constraint language in order to solve several steps of the model-based testing process. The method supports UML 2.0 sequence diagrams including eight kinds of combined fragments. Test cases are generated with respect to the given concurrency coverage criteria. With strong concurrency coverage, generating exhaustive test cases for all concurrent interleaving sequences is exponential in size. The key idea of this method is to create selections of possible test scenarios in special case of exploring the message sequences with their possible interleaving in parallel fragments o...

  • item.jpg
  • Conference Paper


  • Authors: Tran, Hoang-Viet; Nguyen, Quang-Trung; Pham, Ngoc Hung (2019)

  • The two-phase assume-guarantee verification method for timed systems using T L∗ algorithm implemented in the learner has been known as a potential method to solve the problem of state space explosion in model checking thanks to its divide and conquer strat-egy. This paper presents three improvements to the verification method. First, we remove the untimed verification phase from the verification process. This removal reduces the time complexity of the verification process because of the great time complexity of this phase. Second, we introduce a maxbound to the equivalence queries answering algorithm implemented in the teacher which acts as a method for the teacher to return “don’t kn...

Browsing by Author Pham, Ngoc Hung

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 5 of 5
  • item.jpg
  • Conference Paper


  • Authors: Tran, Dinh Duong; Pham, Ngoc Hung; Nguyen, Duy Tung (2018)

  • This paper proposes a method for automated user interface testing of Windows-based applications to increase the accuracy in identifying the target widgets or executing several interactions. The key idea of this method is to generate new test scenarios from widgets and test specification where widgets are extracted during the execution of the application and test specification is generated by combining the interactions of widgets. Furthermore, the paper contributes some techniques to detect hidden widgets which considering as one of the most challenging problems in user interface testing. Currently, a supporting tool has been implemented and tested with several industrial projects. The...

  • A Framework for Modeling and Modular Verifying of Component-based System Designs.pdf.jpg
  • Article


  • Authors: Le, Chi Luan; Tran, Hoang Viet; Pham, Ngoc Hung (2016)

  • This paper introduces a framework for modeling and verifying safety properties of component-based systems (CBS) by extracting their models from designs in the form of UML 2.0 sequence diagrams. Given UML 2.0 sequence diagrams of a CBS, the framework extracts regular expressions exactly describing behaviors of the system. From these expressions, the proposed framework then generates accurate operation models represented by labeled transition systems (LTSs). After that, these models are used to modular check whether given designs satisfy required safety properties by using the assume-guarantee reasoning paradigm. This framework is not only useful for modeling and verifying designs at...

  • item.jpg
  • Conference Paper


  • Authors: Tran, Nguyen Huong; Do, Minh Kha; Hoang, Viet Tran; Pham, Ngoc Hung (2020)

  • This paper presents two test data automatic generation methods which are based on weighted control flow graph (named WCFT) and boundary values of input parameters (named BVTG). Firstly, WCFT method generates a CFG from a given unit function, updates weight for it, then generates test data from the greatest weight test paths. In the meantime, WCFT can And dead code that can be used for automatic source code errors fix. Secondly, BVTG method generates test data from boundary values of input parameters of the given unit function. The combination of the two generated test data sets from these two methods will improve the error detection ability while maintaining a high code coverage. An i...

  • A Method for Automated Test Cases Generation.pdf.jpg
  • Article


  • Authors: Vu, Thi Dao; Pham, Ngoc Hung; Nguyen, Viet Ha (2016)

  • This paper proposes an automated test cases generation method from sequence diagrams, class diagrams, and object constraint language in order to solve several steps of the model-based testing process. The method supports UML 2.0 sequence diagrams including eight kinds of combined fragments. Test cases are generated with respect to the given concurrency coverage criteria. With strong concurrency coverage, generating exhaustive test cases for all concurrent interleaving sequences is exponential in size. The key idea of this method is to create selections of possible test scenarios in special case of exploring the message sequences with their possible interleaving in parallel fragments o...

  • item.jpg
  • Conference Paper


  • Authors: Tran, Hoang-Viet; Nguyen, Quang-Trung; Pham, Ngoc Hung (2019)

  • The two-phase assume-guarantee verification method for timed systems using T L∗ algorithm implemented in the learner has been known as a potential method to solve the problem of state space explosion in model checking thanks to its divide and conquer strat-egy. This paper presents three improvements to the verification method. First, we remove the untimed verification phase from the verification process. This removal reduces the time complexity of the verification process because of the great time complexity of this phase. Second, we introduce a maxbound to the equivalence queries answering algorithm implemented in the teacher which acts as a method for the teacher to return “don’t kn...