Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract elided by the publisher.
Related papers
- Efficient static analysis of XML paths and types PLDI 2007
- Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata CAV 2024
- Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism ESOP 1990
- Paths vs. Trees in Set-Based Program Analysis POPL 2000
- Deciding validity in a spatial logic for trees JFP 2005
- Sets and constraint logic programming TOPLAS 2000
- Software model checking using languages of nested trees TOPLAS 2011
- Finite Differencing of Logical Formulas for Static Analysis ESOP 2003