Method and apparatus to generate test sequences for communication protocols
US7035747B2 · kind B2 · utility
Assignees
Inventors
Key dates
| Filing date | Oct 21, 2003 |
| Grant date | Apr 25, 2006 |
| Priority date | — |
| Expiry date | Aug 21, 2024 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L43/50
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method and apparatus for generating test sequences for communication protocols that inputs data of finite state machines (FSM) representing the specification of the communication protocols, converts the test sequence generation problem to the satisfiability problem (SAT problem), and generates test sequences for communication protocols by solving the SAT problem. The method converts the test sequence generation problem to the SAT problem by modifying the FSM and describing the test sequence generation problem using a conjunctive normal form formula based on the modified FSIM. By considering multiple input/output (UID) sequences and overlapping sequences, the method generates minimum length test sequence to check whether the states described in the specification of the protocol exist in the implementation of the FSM.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.