46 citations · 112 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.FL2016★ 1 cited
Symmetry Breaking Predicates for SAT-based DFA Identification
Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers…
cs.SE2016★ 27 cited
Exact Finite-State Machine Identification from Scenarios and Temporal Properties
Vladimir Ulyantsev, Igor Buzhinsky, Anatoly Shalyto
Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software m…