Solving regular tree grammar based constraints

DOI10.1007/3-540-47764-0_13MaRDI QIDQ4778704zbMATH OpenFDO

Authors Yanhong A. Liu, Scott D. Stoller, Ning Li

Publication date 19 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2126/21260213

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• Eliminating dead code on recursive data.
• Solving regular path queries
• Grammar constraints
• Regular tree languages as an abstract domain in program specialisation
• The Theory of Grammar Constraints

Cited in

(2)

• Grammar flow analysis reduction to scheduling problem
• Eliminating dead code on recursive data.

This page was built for publication: Solving regular tree grammar based constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778704)