Daniel Neider. Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers. In Supratik Chakraborty, Madhavan Mukund, editors, Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings. Volume 7561 of Lecture Notes in Computer Science, pages 354-369, Springer, 2012. [doi]
@inproceedings{Neider12, title = {Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers}, author = {Daniel Neider}, year = {2012}, doi = {10.1007/978-3-642-33386-6_28}, url = {http://dx.doi.org/10.1007/978-3-642-33386-6_28}, researchr = {https://researchr.org/publication/Neider12}, cites = {0}, citedby = {0}, pages = {354-369}, booktitle = {Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings}, editor = {Supratik Chakraborty and Madhavan Mukund}, volume = {7561}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-33385-9}, }