First-Order and Temporal Logics for Nested Words

Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML. We provide new temporal logics for finite and infinite nested words, which are natural extensions of LTL, and prove that these logics are first-order expressively-complete. One of them is based on adding a “within” modality, evaluating a formula on a subword, to a logic CaRet previously studied in the context of verifying properties of recursive state machines (RSMs). The other logic, NWTL, is based on the notion of a summary path that uses both the linear and nesting structures. For NWTL we show that satisfiability is EXPTIME-complete, and that model-checking can be done in time polynomial in the size of the RSM model and exponential in the size of the NWTL formula (and is also EXPTIME-complete). Finally, we prove that first-order logic over nested words has the three-variable property, and we present a temporal logic for nested words which is complete for the two-variable fragment of first-order.

💡 Research Summary

The paper investigates the logical foundations of nested words, a formal model that captures both the linear order of positions in a word and a matching relation that pairs call and return events, thereby reflecting the call‑stack behavior of procedural programs, the hierarchical structure of parse trees, and the nesting found in XML documents. The authors introduce two new families of temporal logics that extend Linear Temporal Logic (LTL) to this richer setting and prove that both families are expressively complete with respect to first‑order logic (FO) over nested words.

The first logic, called Nested Word Temporal Logic (NWTL), is built around the notion of a “summary path”. A summary path between two positions is the shortest directed walk that may follow ordinary successor edges as well as matching call‑return edges. NWTL equips LTL’s future and past operators with this summary‑path semantics, yielding operators such as “until along a summary path”. This design allows natural expression of stack‑related properties, for example “every lock acquired inside a procedure is released before the procedure returns”. The authors show that every FO formula can be translated into an equivalent NWTL formula, and conversely that any NWTL formula can be compiled into a Nested Word Automaton (NWA) via a tableau construction. Consequently, model checking of NWTL over Recursive State Machines (RSMs) is polynomial in the size of the RSM and exponential in the size of the formula, establishing EXPTIME‑completeness for both satisfiability and model checking.

The second family extends the previously studied CaRet logic by adding a “within” modality. The operator within(φ) evaluates φ on the sub‑word delimited by the matching call‑return pair that encloses the current position. This modality captures local, block‑scoped specifications such as “variable x is non‑negative throughout the execution of function f”. While the “within” extension yields a more succinct syntax for many program‑verification properties, the authors prove that both satisfiability and model checking become 2EXPTIME‑complete, indicating a steep increase in computational cost compared with NWTL.

Beyond the design of the logics, the paper makes several deep model‑theoretic contributions. Using Ehrenfeucht‑Fraïssé games the authors establish a three‑variable property for FO over nested words: any FO formula with at most two free variables can be expressed using only three variables overall. This mirrors known results for ordinary words and finite trees and shows that the added nesting does not increase the variable complexity. Moreover, they identify a unary temporal logic (essentially a single “next‑summary” operator) that is expressively complete for the two‑variable fragment FO² of nested words, thereby providing a tight correspondence between a very low‑arity temporal language and FO².

The paper also situates its contributions within the broader literature. Visibly Pushdown Languages (VPLs) and Nested Word Automata (NWAs) already provide automata‑theoretic tools for languages with call‑return structure, but prior work lacked temporal logics that could directly express and verify stack‑related temporal properties. The authors compare their logics to tree‑oriented logics used in the XML community, arguing that those logics either ignore the linear order or are designed for finite trees, whereas NWTL and the within‑extension handle both linear and hierarchical dimensions and support infinite words.

In the technical development, the paper proceeds as follows: Section 2 formalizes nested words, their first‑order structures, and the relevant game‑theoretic notions. Section 3 defines the temporal logics (NWTL, CaRet, and the within‑extensions) and gives their semantics. Section 4 proves FO‑expressive completeness for each logic, employing syntactic translations, composition arguments, and EF‑games for the infinite case. Section 5 presents the automata‑theoretic translation from NWTL to NWAs, establishes the EXPTIME upper bound for model checking, and shows the matching lower bound via reductions from known EXPTIME‑hard problems. Section 6 proves the three‑variable property and introduces the FO²‑complete unary temporal logic. The paper concludes with a discussion of related work, potential extensions (e.g., richer modalities, quantitative extensions), and open problems such as optimizing model‑checking algorithms for the within‑extension.

Overall, the work delivers a comprehensive logical framework for nested words, offering temporal logics that are both expressive enough to capture natural program‑verification specifications and amenable to algorithmic analysis with well‑characterized complexity bounds. This bridges a gap between automata‑theoretic approaches to visibly pushdown languages and temporal‑logic‑based verification techniques, and it opens avenues for applying these ideas to XML streaming, program analysis, and other domains where hierarchical nesting coexists with linear sequencing.