Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
From MaRDI portal
Publication:5389081
DOI10.4230/LIPIcs.RTA.2011.187zbMath1236.68134OpenAlexW1588009749MaRDI QIDQ5389081
No author found.
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_9bbe.html
reachabilityterm rewritingflow analysiscollecting semanticshigher-order programindexed linear tree grammar
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
Unnamed Item ⋮ Towards more precise rewriting approximations ⋮ On multi-language abstraction. Towards a static analysis of multi-language programs ⋮ Termination criteria for tree automata completion ⋮ Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems
This page was built for publication: Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
