A new algorithm for the reduction of incompletely specified finite state machines
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
State Reduction in Incompletely Specified Finite-State Machines
IEEE Transactions on Computers
T(O)RMC: A Tool for (ω)-Regular Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Learning Minimal Separating DFA's for Compositional Verification
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
InvGen: An Efficient Invariant Generator
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
On the Synthesis of Finite-State Machines from Samples of Their Behavior
IEEE Transactions on Computers
Reachability games on automatic graphs
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Scalable analysis of linear systems using mathematical programming
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
LEVER: a tool for learning based verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A practical and complete approach to predicate refinement
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We develop a generic technique to compute minimal separating DFAs (deterministic finite automata) and regular invariants. Our technique works by expressing the desired properties of a solution in terms of logical formulae and using SAT or SMT solvers to find solutions. We apply our technique to three concrete problems: computing minimal separating DFAs (e.g., used in compositional verification), regular model checking, and synthesizing loop invariants of integer programs that are expressible in Presburger arithmetic.