Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Design and validation of computer protocols
Design and validation of computer protocols
Algorithms for approximate graph matching
Information Sciences—Informatics and Computer Science: An International Journal
On fault coverage of tests for finite state specifications
Computer Networks and ISDN Systems - Special issue on protocol testing
`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
Finding Patterns in Three-Dimensional Graphs: Algorithms and Applications to Scientific Data Mining
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Generating Tests for Control Portion of SDL Specifications
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Test Generation Driven by User-defined Fault Models
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Fault model-driven test derivation from finite state models: annotated bibliography
Modeling and verification of parallel processes
Graph isomorphism, general remarks
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Analyzing the impact of protocol changes on tests
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
A bounded incremental test generation algorithm for finite state machines
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 0.00 |
We study the problem of patching, i.e., modifying the behavior of an existing system. We consider systems modelled as finite state machines (FSMs), and define edit operators for them based on a traditional fault model. We argue that sequences of edit operations can be considered as models of patches defining modifications to an FSM system. We utilize recent results in graph matching theory as mathematical foundations. We introduce a new type of problem which we call the optimal patch or optimal update problem: Given an FSMM modeling the behavior of an existing system and an other machine M' modeling a new design, find an optimal patch, i.e., the edit operations changing M to M' that are minimal according to a given cost function associated with the edit operations. We analyze the complexity of the problem, and conclude that it is unlikely to have a polynomial time solution for it. We also show that the problem can be easily transformed to a state-space search problem, for which many heuristic approximation algorithms have been developed.