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 - Tree model - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2010-11-22 00:52:19 Open Document File Size: 239,64 KB Share Result on Facebook

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, treeprocessinAdd to Reading List