Finite State Testing and Syntax Testing

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2012, Vol 3, Issue 1

Abstract

This paper is concerned with the testing of the software which is being developed in a structured way. The advantages which accrue from a well-structured or modular organization of software depend upon an ability to independently test a module well before the full development of all the modules with which it communicates. This paper describes techniques (Finite State Testing & Syntax Testing) which effectively test various applications. With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This motivates the study of testing finite state machines to ensure the correct functioning of systems and to discover aspects of their behavior. Finite state machines are widely used to model systems in diverse areas, including sequential circuits, certain types of programs, and, more recently, communication protocols. In a testing problem we have a machine about which we lack some information; we would like to deduce this information by providing a sequence of inputs to the machine and observing the outputs produced. Because of its practical importance and theoretical interest, the problem of testing finite state machines have been studied in different areas and at various times. Some old problems which had been open for decades were resolved recently, new concepts and more intriguing problems from new applications emerge. This paper reviews the fundamental problems in testing finite state machines and techniques for solving these problems, tracing progress in the area from its inception to the present and the state of the art. In addition, this paper covers syntax testing which is also called grammar based testing technique for testing various applications where the input data can be described formally.

Authors and Affiliations

Amandeep Singh, Harmanjit Singh

Keywords

Related Articles

Review of Acknowledgment Based Techniques for Detection of Black Hole/Gray Hole Attacks in MANETs

In Mobile Ad hoc NETworks (MANETs) nodes communicate via wireless links, without any fixed infrastructure like base stations, central servers or mobile switching. Each node in MANET can act as a host or as a router. Due...

UNDERSTANDING THE DEVELOPER PARTICIPATION IN BUG FIX PROCESS

Prediction of the bug fix time in open source softwares is a challenging job. A software bug consists of many attributes that define the characteristics of the bug. Some of the attributes get filled at the time of report...

Role of Biometric security for The Enhancement of Data Security

In today's society, data security is the big problem for every business organization or an individual. Most found threat is theft of personal data and information. With time digital data become more prevalent, personnel...

CONTEXT AWARENESS FRAMEWORK FOR DEVELOPING MOBILE APPLICATIONS: A SURVEY OF SELECTED SMALL AND MEDIUM ENTERPRISES IN NAKURU TOWN, KENYA

Mobile applications act as valuable tools that can be used by entrepreneurs and small and medium enterprises (SMEs) alike to market their products/services and considerably reduce costs of doing business. The government...

Managing Infrastructure OF Water and Petroleum Demand in KSA

The purpose of this paper is showing, how Geographical Information Systems (GIS ) can be used to support infrastructure planners and analyst on water and petroleum demand of a local area in the Kingdom of Saudi Arabia (K...

Download PDF file
  • EP ID EP649820
  • DOI 10.24297/ijct.v3i1a.2725
  • Views 99
  • Downloads 0

How To Cite

Amandeep Singh, Harmanjit Singh (2012). Finite State Testing and Syntax Testing. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 3(1), 48-54. https://europub.co.uk./articles/-A-649820