Learning regular sets from queries and counterexamples
Information and Computation
On the learnability of infinitary regular sets
Information and Computation
Discovering models of software processes from event-based data
ACM Transactions on Software Engineering and Methodology (TOSEM)
MAS — an interactive synthesizer to support behavioral modelling in UML
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
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)
Inference of Finite Automata Using Homing Sequences
Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT
Automated black-box testing of functional correctness using function approximation
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Inferring state-based behavior models
Proceedings of the 2006 international workshop on Dynamic systems analysis
Integration Testing of Components Guided by Incremental State Machine Learning
TAIC-PART '06 Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques
Practical Model-Based Testing: A Tools Approach
Practical Model-Based Testing: A Tools Approach
Efficient test-based model generation for legacy reactive systems
HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
The Daikon system for dynamic detection of likely invariants
Science of Computer Programming
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
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
FM '09 Proceedings of the 2nd World Congress on Formal Methods
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
Grammatical Inference: Learning Automata and Grammars
Grammatical Inference: Learning Automata and Grammars
Inference and analysis of formal models of botnet command and control protocols
Proceedings of the 17th ACM conference on Computer and communications security
Angluin style finite state machine inference with non-optimal counterexamples
Proceedings of the First International Workshop on Model Inference In Testing
CGE: a sequential learning algorithm for mealy automata
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
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
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
Data Mining: Practical Machine Learning Tools and Techniques
Data Mining: Practical Machine Learning Tools and Techniques
Learning-based testing for reactive systems using term rewriting technology
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
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
Regular inference for state machines with parameters
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Inferring canonical register automata
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
XSS Vulnerability Detection Using Model Inference Assisted Evolutionary Fuzzing
ICST '12 Proceedings of the 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation
Model-Based testing and model inference
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Guided GUI testing of android apps with minimal restart and approximate learning
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
| Hi-index | 0.00 |
Among the various techniques for mining models from software systems, regular inference of black-box systems has been a central technique in the last decade. In this paper, we present various directions we have investigated for improving the efficiency of algorithms based on L* in a software testing context where interactions with systems entail large and complex input domains. In particular we consider algorithmic optimizations for large input sets, for parameterized inputs, for processing counterexamples. We also present our current directions motivated by application to security testing: focusing on specific sequences, identifying randomly generated values, combining with other adaptive techniques.