Testing a Network by Inferring Representative State Machines from Network Traces

Griffeth,; Cantor,; Djouvas, Constantinos

doi:10.1109/icsea.2006.261287

Cited by 4 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our plan for the future is to use experimentation with more complex examples, such as SATS or the Dynamic Host Configuration Protocol DHCP (using models based on the work described in [14]), to explore extensions and improvements to our proof support. …”

Section: Resultsmentioning

confidence: 99%

Specifying and proving properties of timed I/O automata using Tempo

Archer

Lim

Lynch

et al. 2008

Des Autom Embed Syst

View full text Add to dashboard Cite

Timed I/O automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for example, to model a real-time software component controlling a physical process. The TIOA model is sufficiently general to subsume other models in use for timed systems. The Tempo Toolset, currently under development, is aimed at supporting system development based on TIOA specifications. The Tempo Toolset is an extension of the IOA toolkit, which provides a specification simulator, a code generator, and both model checking and theorem proving support for analyzing specifications. This paper focuses on the modeling of timed systems and their properties with TIOA and on the use of TAME4TIOA, the TAME 1 (Timed Automata Modeling Environment) based theorem proving support provided in Tempo, for proving system properties, including timing properties. Several examples are provided by way of illustration.

show abstract

Section: Resultsmentioning

confidence: 99%

Specifying and proving properties of timed I/O automata using Tempo

Archer

Lim

Lynch

et al. 2008

Des Autom Embed Syst

View full text Add to dashboard Cite

show abstract

“…The state transition diagram in paper [4,6] is based on the basic model. So, the flow for eliciting a state transition diagram as a service specification is as follows:…”

Section: Fig 2 Basic State Transition Diagrammentioning

confidence: 99%

Automatic Elicitation System of Network Service Specifications from a Set of Rules

Ohba

Ohta

2009

2009 Fifth Advanced International Conference on Telecommunications

View full text Add to dashboard Cite

Proposals have been made to describe services programs in a rule-based language, because it is easier to describe programs in a rule-based language than a procedural language. But, it is difficult to find bugs in programs described in a rule-based language. To solve the problem and to make it easier for service developers to find bugs in programs, service specifications can be elicited from programs described in a rule-based language. This paper proposes a system for automatically eliciting state transition diagrams based on an enhanced state transition model from a set of rules.

show abstract

“…Gri eth, Cantor, and Djouvas [GCD06] use learning techniques to generate an automaton to use in network testing. They de ne some a priori requirements for the network, which they state as trace properties.…”

Section: Machine Learning Approaches In Testingmentioning

confidence: 99%

Learning Finite State Machine Specifications from Test Cases

Werner¹

View full text Add to dashboard Cite

Up-to-date software systems are often modular and need to be changeable. While modularity is believed to reduce software production costs, it also leads to increased di culty in testing, as the future uses of a module are getting more varied and therefore harder to guess. Also, reused modules are often represented as black boxes, whose interior structure is hidden from the system. In consequence, on reusing a module, the testing focuses on integration testing and monitoring the interfaces of the module.In order to monitor a system, a model of the system is needed to compare the observed traces to. However, with the advent of agile development methods and decreasing time to market, formal models of a system are seldom available. While formal modeling has not been widely adopted in industry, the importance of testing has increased, in part thanks to the same agile development methods that obsolete explicit modeling. An example is the test rst paradigm of eXtreme Programming, which requires that the tests for any software have to be written before the software itself. Therefore, test cases are available even for systems without a formal model.In consequence, we propose to generate a system model suitable for monitoring from a test suite for the system. The approach is based on automata learning. Angluin's learning algorithm is used to generate an appropriate model, while state-merging methods are applied to represent the test cases in a format that can be processed by the learning algorithm.Both Angluin's algorithm and state-merging are tailored to the characteristics of testing. For Angluin's algorithm, this comprises a mapping of the query mechanisms onto a test suite. The state-merging is used to construct a generic representation of arbitrary test suites by exploiting the properties of a given test speci cation language for a better coverage. The approach is implemented in a prototypical tool and validated by a case study.Like Alice in Wonderland, the research for this thesis has taken me to various unknown shores and topics. Many friends and colleagues have accompanied me along the path of my scienti c journey, and to all of them I o er my thanks for their company.First and foremost, I want to give my thanks to my supervisor, Prof. Dr. Jens Grabowski. Without his patience and persistence, this thesis would never have been completed.I am also very grateful to all colleagues who o ered their advice on this thesis. Franz Schenk was the rst one to read my initial e orts, and his comments on structure have greatly eased my task. Ste en Herbold proved to be the person with the most insight on the mathematical foundations of my research topic; therefore he was the one to spot any theoretical inconsistencies. Philip Makedonski has helped to polish my English phrasing. Special thanks are due to Prof. Dr. Wolfgang May for his valuable comments on correctly formulating mathematical de nitions.Many grateful thoughts also go to all my friends and family, whose constant support and never ending inquiries as to the progress o...

show abstract

Testing a Network by Inferring Representative State Machines from Network Traces

Cited by 4 publications

References 22 publications

Specifying and proving properties of timed I/O automata using Tempo

Specifying and proving properties of timed I/O automata using Tempo

Automatic Elicitation System of Network Service Specifications from a Set of Rules

Learning Finite State Machine Specifications from Test Cases

Contact Info

Product

Resources

About