“An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types” by Clark Barrett, Igor Shikanian, and Cesare Tinelli. In Combined Proceedings of the 4^th Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR '06) and the 1^st International Workshop on Probabilistic Automata and Logics (PaUL '06), (Byron Cook and Roberto Sebastiani, eds.), June 2007, pp. 23-37. Seattle, Washington.
BibTeX entry:
@inproceedings{BST07-PDPAR,
author = {Clark Barrett and Igor Shikanian and Cesare Tinelli},
editor = {Byron Cook and Roberto Sebastiani},
title = {An Abstract Decision Procedure for Satisfiability in the
Theory of Recursive Data Types},
booktitle = {Combined Proceedings of the {\it 4^{th}} Workshop on
Pragmatics of Decision Procedures in Automated Reasoning (PDPAR
'06) and the {\it 1^{st}} International Workshop on Probabilistic
Automata and Logics (PaUL '06)},
series = {Electronic Notes in Theoretical Computer Science},
volume = {174(8)},
pages = {23--37},
publisher = {Elsevier},
month = jun,
year = {2007},
note = {Seattle, Washington},
url = {http://theory.stanford.edu/~barrett/pubs/BST07-PDPAR.pdf}
}
(This webpage was created with bibtex2web.)