Learning regular sets from queries and counterexamples
Information and Computation
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
LearnLib: a library for automata learning and experimentation
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Model-Based Testing of Electronic Passports
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Model based testing with labelled transition systems
Formal methods and testing
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Generating models of infinite-state communication protocols using regular inference with abstraction
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
JTorX: a tool for on-line model-driven test derivation and execution
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
From ZULU to RERS: lessons learned in the ZULU challenge
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Automata learning with automated alphabet abstraction refinement
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Demonstrating learning of register automata
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A theory of history dependent abstractions for learning interface automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
LearnLib tutorial: from finite automata to register interface programs
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Automated learning setups in automata learning
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Active continuous quality control
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
| Hi-index | 0.00 |
Model-based testing is a promising software testing technique for the automation of test generation and test execution. One obstacle to its adoption is the difficulty of developing models. Learning techniques provide tools to automatically derive automata-based models. Automation is obtained at the cost of time and unreadability of the models. We propose an abstraction technique to reduce the alphabet and large data sets. Our idea is to extract a priori knowledge about the teacher and use this knowledge to define equivalence classes. The latter are then used to define a new and reduced alphabet. The a priori knowledge can be obtained from informal documentation or requirements. We formally prove soundness of our approach. We demonstrate the practical feasibility of our technique by learning a model of the new biometric passport. Our automatically learned model is of comparable size and complexity of a previous model manually developed in the context of testing a passport implementation. Our model can be learned within one hour and slightly refines the previous model.