The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An introduction to computational learning theory
An introduction to computational learning theory
Learning non-deterministic finite automata from queries and counterexamples
Machine intelligence 13
Discovering models of software processes from event-based data
ACM Transactions on Software Engineering and Methodology (TOSEM)
A sampling-based heuristic for tree search applied to grammar induction
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Combinational equivalence checking using satisfiability and recursive learning
DATE '99 Proceedings of the conference on Design, automation and test in Europe
On a generalization of extended resolution
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Learning Regular Languages Using Non Deterministic Finite Automata
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Ensemble Methods in Machine Learning
MCS '00 Proceedings of the First International Workshop on Multiple Classifier Systems
Inference of W-languages from prefixes
Theoretical Computer Science - Special issue: Algorithmic learning theory
PAC-learnability of Probabilistic Deterministic Finite State Automata
The Journal of Machine Learning Research
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)
Mining object behavior with ADABU
Proceedings of the 2006 international workshop on Dynamic systems analysis
Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)
Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)
Reverse Engineering State Machines by Interactive Grammar Inference
WCRE '07 Proceedings of the 14th Working Conference on Reverse Engineering
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Discoverer: automatic protocol reverse engineering from network traces
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION
Applied Artificial Intelligence
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Automatic synthesis of behavior protocols for composable web-services
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
On the Synthesis of Finite-State Machines from Samples of Their Behavior
IEEE Transactions on Computers
LearnLib: a framework for extrapolating behavioral models
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on FMICS 05
Inference of regular languages using state merging algorithms with search
Pattern Recognition
Grammatical Inference: Learning Automata and Grammars
Grammatical Inference: Learning Automata and Grammars
A framework for the competitive evaluation of model inference techniques
Proceedings of the First International Workshop on Model Inference In Testing
Exact DFA identification using SAT solvers
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Process Mining: Discovery, Conformance and Enhancement of Business Processes
Process Mining: Discovery, Conformance and Enhancement of Business Processes
Dynamic Analysis for Diagnosing Integration Faults
IEEE Transactions on Software Engineering
Reverse Engineering of Protocols from Network Traces
WCRE '11 Proceedings of the 2011 18th Working Conference on Reverse Engineering
Inferring network invariants automatically
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Inference of event-recording automata using timed decision trees
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
We introduce a novel approach for synthesis of software models based on identifying deterministic finite state automata. Our approach consists of three important contributions. First, we argue that in order to model software, one should focus mainly on observed executions (positive data), and use the randomly generated failures (negative data) only for testing consistency. We present a new greedy heuristic for this purpose, and show how to integrate it in the state-of-the-art evidence-driven state-merging (EDSM) algorithm. Second, we apply the enhanced EDSM algorithm to iteratively reduce the size of the problem. Yet during each iteration, the evidence is divided over states and hence the effectiveness of this algorithm is decreased. We propose--when EDSM becomes too weak--to tackle the reduced identification problem using satisfiability solvers. Third, in case the amount of positive data is small, we solve the identification problem several times by randomizing the greedy heuristic and combine the solutions using a voting scheme. The interaction between these contributions appeared crucial to solve hard software models synthesis benchmarks. Our implementation, called DFASAT, won the StaMinA competition.