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. The other logic is based on the notion of a summary path that combines the linear and nesting structures. For that logic, both model-checking and satisfiability are shown to be 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.

[1]  Thomas Schwentick,et al.  Expressive and efficient pattern languages for tree-structured data (extended abstract) , 2000, PODS '00.

[2]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[3]  Maarten Marx,et al.  Conditional XPath, the first order complete XPath dialect , 2004, PODS.

[4]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[5]  Victor Vianu,et al.  A Web Odyssey: from Codd to XML , 2001, PODS.

[6]  Rasmus Ejlers Møgelberg,et al.  Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science , 2007 .

[7]  Sriram K. Rajamani,et al.  Bebop: A Symbolic Model Checker for Boolean Programs , 2000, SPIN.

[8]  Javier Esparza,et al.  A BDD-Based Model Checker for Recursive Programs , 2001, CAV.

[9]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[10]  Georg Gottlob,et al.  Monadic datalog and the expressive power of languages for web information extraction , 2002, JACM.

[11]  Christof Löding,et al.  Regularity Problems for Visibly Pushdown Languages , 2006, STACS.

[12]  Holger Schlingloff.  Expressive completeness of temporal logic of trees , 1992, J. Appl. Non Class. Logics.

[13]  Leonid Libkin,et al.  Logics for Unranked Trees: An Overview , 2005, Log. Methods Comput. Sci..

[14]  Kousha Etessami,et al.  First-Order Logic with Two Variables and Unary Temporal Logic , 2002, Inf. Comput..

[15]  Thomas Schwentick,et al.  XML: Model, Schemas, Types, Logics, and Queries , 2003, Logics for Emerging Applications of Databases.

[16]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[17]  M. de Rijke,et al.  Semantic characterizations of navigational XPath , 2005, SGMD.

[18]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[19]  Victor Vianu,et al.  Validating streaming XML documents , 2002, PODS.

[20]  Thomas Schwentick,et al.  Query automata over finite trees , 2002, Theor. Comput. Sci..

[21]  Christof Löding,et al.  Visibly Pushdown Games , 2004, FSTTCS.

[22]  Philippe Schnoebelen,et al.  Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[23]  Maarten Marx,et al.  Conditional XPath , 2005, TODS.

[24]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[25]  Rajeev Alur,et al.  Analysis of recursive state machines , 2001, TOPL.

[26]  Luc Segoufin,et al.  Typing and querying XML documents: some complexity bounds , 2003, PODS.