{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:18Z","timestamp":1759638018722,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T00:00:00Z","timestamp":1227571200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Nested words are a structured model of execution paths in procedural\nprograms, reflecting their call and return nesting structure. Finite nested\nwords also capture the structure of parse trees and other tree-structured data,\nsuch as XML. We provide new temporal logics for finite and infinite nested\nwords, which are natural extensions of LTL, and prove that these logics are\nfirst-order expressively-complete. One of them is based on adding a \"within\"\nmodality, evaluating a formula on a subword, to a logic CaRet previously\nstudied in the context of verifying properties of recursive state machines\n(RSMs). The other logic, NWTL, is based on the notion of a summary path that\nuses both the linear and nesting structures. For NWTL we show that\nsatisfiability is EXPTIME-complete, and that model-checking can be done in time\npolynomial in the size of the RSM model and exponential in the size of the NWTL\nformula (and is also EXPTIME-complete). Finally, we prove that first-order\nlogic over nested words has the three-variable property, and we present a\ntemporal logic for nested words which is complete for the two-variable fragment\nof first-order.<\/jats:p>","DOI":"10.2168\/lmcs-4(4:11)2008","type":"journal-article","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T10:25:28Z","timestamp":1231496728000},"source":"Crossref","is-referenced-by-count":30,"title":["First-Order and Temporal Logics for Nested Words"],"prefix":"10.46298","volume":"Volume 4, Issue 4","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Marcelo","family":"Arenas","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Barcelo","sequence":"additional","affiliation":[]},{"given":"Kousha","family":"Etessami","sequence":"additional","affiliation":[]},{"given":"Neil","family":"Immerman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6698-2735","authenticated-orcid":false,"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2008,11,25]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/782\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/782\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:55:46Z","timestamp":1681242946000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,25]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-4(4:11)2008","relation":{"is-same-as":[{"id-type":"arxiv","id":"0811.0537","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0811.0537","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1408.5969","asserted-by":"subject"},{"id-type":"doi","id":"10.1016\/j.ic.2016.07.007","asserted-by":"subject"},{"id-type":"doi","id":"10.4204\/eptcs.161.22","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1408.5969","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2008,11,25]]},"article-number":"782"}}