Verification of Tree-Processing Programs via Higher-Order Model Checking Hiroshi Unno, Naoshi Tabuchi, and Naoki Kobayashi Tohoku University Abstract. We propose a new method to verify that a higher-order, treeprocessin

First Page		Document Content
Date: 2010-11-22 00:52:19		Verification of Tree-Processing Programs via Higher-Order Model Checking Hiroshi Unno, Naoshi Tabuchi, and Naoki Kobayashi Tohoku University Abstract. We propose a new method to verify that a higher-order, treeprocessin Add to Reading List Source URL: www.cs.tsukuba.ac.jp Download Document from Source Website File Size: 239,64 KB Share Document on Facebook