{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:23Z","timestamp":1775053283281,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540784975","type":"print"},{"value":"9783540784999","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_34","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"490-504","source":"Crossref","is-referenced-by-count":13,"title":["Model Checking Freeze LTL over One-Counter Automata"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Demri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Sangnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"key":"34_CR2","first-page":"164","volume-title":"FOCS 1989","author":"R. Alur","year":"1989","unstructured":"Alur, R., Henzinger, T.: A really temporal logic. In: FOCS 1989, pp. 164\u2013169. IEEE, Los Alamitos (1989)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/3-540-58179-0_50","volume-title":"Computer Aided Verification","author":"O. Bernholtz","year":"1994","unstructured":"Bernholtz, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 142\u2013155. Springer, Heidelberg (1994)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS 2006, pp. 10\u201319 (2006)","DOI":"10.1145\/1142351.1142354"},{"key":"34_CR5","first-page":"7","volume-title":"LICS 2006","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS 2006, pp. 7\u201316. IEEE, Los Alamitos (2006)"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-540-71209-1_54","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Bouajjani","year":"2007","unstructured":"Bouajjani, A., Jurski, Y., Sighireanu, M.: A generic framework for reasoning about dynamic networks of infinite-state processes. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 690\u2013705. Springer, Heidelberg (2007)"},{"issue":"2","key":"34_CR7","first-page":"137","volume":"182","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic approach to data languages and timed languages. I & C\u00a0182(2), 137\u2013162 (2003)","journal-title":"I & C"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-45294-X_12","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"Z. Dang","year":"2001","unstructured":"Dang, Z., Ibarra, O., Pietro, P.S.: Liveness verification of reversal-bounded multicounter machines with a free counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 132\u2013143. Springer, Heidelberg (2001)"},{"key":"34_CR9","first-page":"17","volume-title":"LICS 2006","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. In: LICS 2006, pp. 17\u201326. IEEE, Los Alamitos (2006)"},{"issue":"1","key":"34_CR10","first-page":"2","volume":"205","author":"S. Demri","year":"2007","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint LTL: Decidability and complexity. I & C\u00a0205(1), 2\u201324 (2007)","journal-title":"I & C"},{"key":"34_CR11","unstructured":"Demri, S., Lazi\u0107, R., Sangnier, A.: Model checking freeze LTL over one-counter automata. Research report, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan (2008)"},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jal.2005.06.010","volume":"4","author":"M. Franceschet","year":"2006","unstructured":"Franceschet, M., de Rijke, M.: Model checking hybrid logics (with an application to semistructured data). Journal of Applied Logic\u00a04(3), 279\u2013304 (2006)","journal-title":"Journal of Applied Logic"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00215625","volume":"5","author":"V. Goranko","year":"1996","unstructured":"Goranko, V.: Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information\u00a05, 1\u201324 (1996)","journal-title":"Journal of Logic, Language, and Information"},{"issue":"1","key":"34_CR14","first-page":"1","volume":"188","author":"P. Jan\u010dar","year":"2004","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalence-checking and model-checking of one-counter automata. I & C\u00a0188(1), 1\u201319 (2004)","journal-title":"I & C"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternation-free modal mu-calculus for data trees. In: LICS 2007, pp. 131\u2013140 (2007)","DOI":"10.1109\/LICS.2007.11"},{"key":"34_CR16","first-page":"265","volume-title":"LICS 2006","author":"O. Kupferman","year":"2006","unstructured":"Kupferman, O., Vardi, M.: Memoryful Branching-Time Logic. In: LICS 2006, pp. 265\u2013274. IEEE, Los Alamitos (2006)"},{"issue":"2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. JACM\u00a047(2), 312\u2013360 (2000)","journal-title":"JACM"},{"key":"34_CR18","first-page":"383","volume-title":"LICS 2002","author":"F. Laroussinie","year":"2002","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: LICS 2002, pp. 383\u2013392. IEEE, Los Alamitos (2002)"},{"key":"34_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/11944836_35","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"R. Lazi\u0107","year":"2006","unstructured":"Lazi\u0107, R.: Safely freezing LTL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 381\u2013392. Springer, Heidelberg (2006)"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-540-45187-7_17","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N. Markey","year":"2003","unstructured":"Markey, N., Schnoebelen, P.: Model checking a path. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 251\u2013261. Springer, Heidelberg (2003)"},{"issue":"3","key":"34_CR21","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. TOCL\u00a05(3), 403\u2013435 (2004)","journal-title":"TOCL"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: On Metric Temporal Logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"issue":"1:8","key":"34_CR23","first-page":"1","volume":"3","author":"J. Ouaknine","year":"2007","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science\u00a03(1:8), 1\u201327 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-70918-3_48","volume-title":"STACS 2007","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T., Weber, V.: Bounded-variable fragments of hybrid logics. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 561\u2013572. Springer, Heidelberg (2007)"},{"key":"34_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"34_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11690634_23","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Serre","year":"2006","unstructured":"Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 337\u2013351. Springer, Heidelberg (2006)"},{"key":"34_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11538363_24","volume-title":"Computer Science Logic","author":"B. Cate ten","year":"2005","unstructured":"ten Cate, B., Franceschet, M.: On the complexity of hybrid logics with binders. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 339\u2013354. Springer, Heidelberg (2005)"},{"key":"34_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BFb0015261","volume-title":"Computer Science Today","author":"M. Vardi","year":"1995","unstructured":"Vardi, M.: Alternating automata and program verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol.\u00a01000, pp. 471\u2013485. Springer, Heidelberg (1995)"},{"key":"34_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-63104-6_19","volume-title":"Automated Deduction - CADE-14","author":"M. Vardi","year":"1997","unstructured":"Vardi, M.: Alternating automata: unifying truth and validity checking for temporal logics. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"key":"34_CR30","first-page":"183","volume":"32","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. JCSS\u00a032, 183\u2013221 (1986)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:36Z","timestamp":1619521896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_34","relation":{},"subject":[]}}