Learning regular sets from queries and counterexamples
Information and Computation
Inference of finite automata using homing sequences
Information and Computation
An introduction to computational learning theory
An introduction to computational learning theory
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)
The SLAM project: debugging system software via static analysis
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model Generation by Moderated Regular Extrapolation
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Confirming Configurations in EFSM Testing
IEEE Transactions on Software Engineering
Finding Latent Code Errors via Machine Learning over Program Executions
Proceedings of the 26th International Conference on Software Engineering
LearnLib: a library for automata learning and experimentation
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)
Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Dynamic Detection of COTS Component Incompatibility
IEEE Software
Automatic generation of software behavioral models
Proceedings of the 30th international conference on Software engineering
Modular System Verification by Inference, Testing and Reachability Analysis
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Inference of Timed Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Regular inference for state machines using domains with equality tests
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Integration testing of distributed components based on learning parameterized i/o models
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Inference of event-recording automata using timed decision trees
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Implementing conformiq Qtronic
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
Learning and integration of parameterized components through testing
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
Inference and abstraction of the biometric passport
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
On handling data in automata learning: considerations from the CONNECT perspective
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Inferring canonical register automata
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A theory of history dependent abstractions for learning interface automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Automated inference of models for black box systems based on interface descriptions
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Symbolic learning of component interfaces
SAS'12 Proceedings of the 19th international conference on Static Analysis
Sigma*: symbolic learning of input-output specifications
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Active continuous quality control
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
Hybrid learning: interface generation through static, dynamic, and symbolic analysis
Proceedings of the 2013 International Symposium on Software Testing and Analysis
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In order to facilitate model-based verification and validation, effort is underway to develop techniques for generating models of communication system components from observations of their external behavior. Most previous such work has employed regular inference techniques which generate modest-size finite-state models. They typically suppress parameters of messages, although these have a significant impact on control flow in many communication protocols. We present a framework, which adapts regular inference to include data parameters in messages and states for generating components with large or infinite message alphabets. A main idea is to adapt the framework of predicate abstraction, successfully used in formal verification. Since we are in a black-box setting, the abstraction must be supplied externally, using information about how the component manages data parameters. We have implemented our techniques by connecting the LearnLib tool for regular inference with the protocol simulator ns-2, and generated a model of the SIP component as implemented in ns-2.