Prasanna Thati, José Meseguer. Complete symbolic reachability analysis using back-and-forth narrowing. Theoretical Computer Science, 366(1-2):163-179, 2006. [doi]
@article{ThatiM06,
title = {Complete symbolic reachability analysis using back-and-forth narrowing},
author = {Prasanna Thati and José Meseguer},
year = {2006},
doi = {10.1016/j.tcs.2006.07.008},
url = {http://dx.doi.org/10.1016/j.tcs.2006.07.008},
tags = {completeness, analysis},
researchr = {https://researchr.org/publication/ThatiM06},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {366},
number = {1-2},
pages = {163-179},
}