Exact DFA identification using SAT solvers

Authors:
Marijn J. H. Heule;Sicco Verwer
Affiliations:
Delft University of Technology;Eindhoven University of Technology
Venue:
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Year:
2010

Citing 13
Cited 5

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
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Dynamic Symmetry Breaking by Simulating Zykov Contraction

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
On the Synthesis of Finite-State Machines from Samples of Their Behavior

IEEE Transactions on Computers
A bibliographical study of grammatical inference

Pattern Recognition
Inference of regular languages using state merging algorithms with search

Pattern Recognition
Inferring network invariants automatically

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Blocked clause elimination

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Regular inference as vertex coloring

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Learning minimal deterministic automata from inexperienced teachers

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference

Proceedings of the 2013 International Conference on Software Engineering
Software model synthesis using satisfiability solvers

Empirical Software Engineering
STAMINA: a competition to encourage the development and assessment of software model inference techniques

Empirical Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach is competitive with alternative techniques. Our contributions are fourfold: First, we propose a compact translation of DFA identification into SAT. Second, we reduce the SAT search space by adding lower bound information using a fast max-clique approximation algorithm. Third, we include many redundant clauses to provide the SAT solver with some additional knowledge about the problem. Fourth, we show how to use the flexibility of our translation in order to apply it to very hard problems. Experiments on a well-known suite of random DFA identification problems show that SAT solvers can efficiently tackle all instances. Moreover, our algorithm outperforms state-of-the-art techniques on several hard problems.