{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:12Z","timestamp":1725795012322},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_15","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"190-203","source":"Crossref","is-referenced-by-count":0,"title":["Model Checking for String Problems"],"prefix":"10.1007","author":[{"given":"Milka","family":"Hutagalung","sequence":"first","affiliation":[]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Andersen, H.R.: A polyadic modal \u03bc-calculus. Technical Report ID-TR: 1994-195, Dept. of Computer Science, Technical University of Denmark, Copenhagen (1994)"},{"key":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-75560-9_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Axelsson","year":"2007","unstructured":"Axelsson, R., Lange, M.: Model checking the first-order fragment of higher-order fixpoint logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 62\u201376. Springer, Heidelberg (2007)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bieganski, P., Riedl, J., Cartis, J.V., Retzel, E.F.: Generalized suffix trees for biological sequence data: applications and implementation. In: Proc. 27th Hawaii Int. Conf. on System Sciences, vol.\u00a05, pp. 35\u201344 (January 1994)","DOI":"10.1109\/HICSS.1994.323593"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bradfield, J., Stirling, C.: Modal mu-calculi. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic: Studies in Logic and Practical Reasoning, vol.\u00a03, pp. 721\u2013756. Elsevier (2007)","DOI":"10.1016\/S1570-2464(07)80015-2"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Campos, R.A.C., Mart\u00ednez, F.J.Z.: Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem. In: Proc. 9th Int. IEEE Conf. on Electrical Engineering, Computing Science and Automatic Control, CCE 2012, pp. 1\u20134. IEEE (2012)","DOI":"10.1109\/ICEEE.2012.6421180"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-10003-2_69","volume-title":"Automata, Languages and Programming","author":"E.A. Emerson","year":"1980","unstructured":"Emerson, E.A., Clarke, E.M.: Characterizing correctness properties of parallel programs as fixpoints. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 169\u2013181. Springer, Heidelberg (1980)"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E.A. Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming\u00a02(3), 241\u2013266 (1982)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time temporal logic. Journal of the ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"issue":"1-3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the \u03bc-calculus and its fragments. TCS\u00a0258(1-3), 491\u2013522 (2001)","journal-title":"TCS"},{"key":"15_CR10","first-page":"43","volume":"7","author":"R. Fagin","year":"1974","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. Complexity and Computation\u00a07, 43\u201373 (1974)","journal-title":"Complexity and Computation"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Gipp, B., Meuschke, N.: Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and longest common citation sequence. In: Proc. 2011 ACM Symp. on Document Engineering, pp. 249\u2013258. ACM (2011)","DOI":"10.1145\/2034691.2034741"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"6","key":"15_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D. Hirschberg","year":"1975","unstructured":"Hirschberg, D.: A linear space algorithm for computing maximal common subsequences. Commun. ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"key":"15_CR14","first-page":"133","volume":"6","author":"B. Knaster","year":"1928","unstructured":"Knaster, B.: Un th\u00e9or\u00e8m sur les fonctions d\u2019ensembles. Annals Soc. Pol. Math.\u00a06, 133\u2013134 (1928)","journal-title":"Annals Soc. Pol. Math."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. TCS\u00a027, 333\u2013354 (1983)","journal-title":"TCS"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Lange, M., Lozes, E.: Model checking the higher-dimensional modal \u03bc-calculus. In: Proc. 8th Workshop on Fixpoints in Comp. Science, FICS 2012. Electr. Proc. In: Theor. Comp. Sc., vol.\u00a077, pp. 39\u201346 (2012)","DOI":"10.4204\/EPTCS.77.6"},{"issue":"4-6","key":"15_CR17","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1017\/S1471068410000402","volume":"10","author":"J. Oetsch","year":"2010","unstructured":"Oetsch, J., P\u00fchrer, J., Schwengerer, M., Tompits, H.: The system Kato: Detecting cases of plagiarism for answer-set programs. Theory and Practice of Logic Programming\u00a010(4-6), 759\u2013775 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1\u20132","key":"15_CR18","first-page":"237","volume":"224","author":"M. Otto","year":"1999","unstructured":"Otto, M.: Bisimulation-invariant PTIME and higher-dimensional \u03bc-calculus. Theor.\u00a0Comput.\u00a0Sci.\u00a0224(1\u20132), 237\u2013265 (1999)","journal-title":"Theor.\u00a0Comput.\u00a0Sci."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th Symp. on Foundations of Comp. Science, FOCS 1977, Providence, RI, USA, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 337\u2013371. Springer, Heidelberg (1982)"},{"key":"15_CR21","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Comp. Sci. Press (1988)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Sung, W.-K.: Algorithms in Bioinformatics: A Practical Approach. CRC Press (2009)","DOI":"10.1201\/9781420070347"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"issue":"1","key":"15_CR24","first-page":"45","volume":"15","author":"Y. Xiao","year":"2010","unstructured":"Xiao, Y., Luk, R.W.P., Wong, K.F., Kwok, K.L.: Using longest common subsequence matching for chinese information retrieval. Journal of Chinese Language and Computing\u00a015(1), 45\u201351 (2010)","journal-title":"Journal of Chinese Language and Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T11:49:01Z","timestamp":1597924141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}