Complete symbolic reachability analysis using back-and-forth narrowing

By Prasanna Thati and José Meseguer. In CALCO, volume 3629 of Lecture Notes in Computer Science, 379–394. Springer, 2005.

Publisher Link:

http://dx.doi.org/10.1007/11548133_24

BibTeX

@inproceedings{conf/calco/ThatiM05,
    author = "Thati, Prasanna and Meseguer, José",
    editor = "Fiadeiro, José Luiz and Harman, Neil and Roggenbach,
              Markus and Rutten, Jan J. M. M.",
    title = "Complete Symbolic Reachability Analysis Using Back-and-
             Forth Narrowing",
    booktitle = "CALCO",
    crossref = "conf/calco/2005",
    ee = "http://dx.doi.org/10.1007/11548133_24",
    keywords = "formal methods",
    pages = "379-394",
    year = "2005",
}

@proceedings{conf/calco/2005,
    editor = "Fiadeiro, José Luiz and Harman, Neil and Roggenbach,
              Markus and Rutten, Jan J. M. M.",
    title = "Algebra and Coalgebra in Computer Science: First
             International Conference, CALCO 2005, Swansea, UK, September 3-6,
             2005, Proceedings",
    isbn = "3-540-28620-9",
    publisher = "Springer",
    series = "Lecture Notes in Computer Science",
    volume = "3629",
    year = "2005",
}