Annotated Stack Trees
Published in arXiv (Cornell University) • Feb 20, 2015
NobleIDNI6P05W20R02S44
Authors:,
Matthew Hague
Vincent Penelle
Abstract
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems -- a tree rewrite system where each node is labelled by the config...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!