{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:41:46Z","timestamp":1725864106912},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534120"},{"type":"electronic","value":"9783662534137"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53413-7_17","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T07:57:11Z","timestamp":1472543831000},"page":"338-360","source":"Crossref","is-referenced-by-count":4,"title":["A Parametric Abstract Domain for Lattice-Valued Regular Expressions"],"prefix":"10.1007","author":[{"given":"Jan","family":"Midtgaard","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC 1993, pp. 592\u2013601 (1993)","DOI":"10.1145\/167088.167242"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Arden, D.N.: Delayed-logic and finite-state machines. In: 2nd Annual Symposium on Switching Circuit Theory and Logical Design, pp. 133\u2013151. IEEE Computer Society (1961)","DOI":"10.1109\/FOCS.1961.13"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: PLDI 1993, pp. 46\u201355 (1993)","DOI":"10.1145\/155090.155095"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite state machines. JACM 30, 323\u2013342 (1983)","journal-title":"JACM"},{"issue":"4","key":"17_CR6","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. JACM 11(4), 481\u2013494 (1964)","journal-title":"JACM"},{"key":"17_CR7","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: ISOP 1976, pp. 106\u2013130. Dunod, Paris (1976)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-10003-2_65","volume-title":"Automata, Languages and Programming","author":"P Cousot","year":"1980","unstructured":"Cousot, P., Cousot, R.: Semantic analysis of communicating sequential processes. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 119\u2013133. Springer, Heidelberg (1980)"},{"issue":"2\u20133","key":"17_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Logic Program. 13(2\u20133), 103\u2013179 (1992)","journal-title":"J. Logic Program."},{"key":"17_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/3-540-47764-0_24","volume-title":"Static Analysis","author":"J Feret","year":"2001","unstructured":"Feret, J.: Abstract interpretation-based static analysis of mobile ambients. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 412\u2013430. Springer, Heidelberg (2001)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-540-74061-2_4","volume-title":"Static Analysis","author":"T Gall Le","year":"2007","unstructured":"Le Gall, T., Jeannet, B.: Lattice automata: a representation for languages on infinite alphabets, and some applications to verification. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 52\u201368. Springer, Heidelberg (2007)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/11784180_17","volume-title":"Algebraic Methodology and Software Technology","author":"T Gall Le","year":"2006","unstructured":"Le Gall, T., Jeannet, B., J\u00e9ron, T.: Verification of communication protocols using abstract interpretation of FIFO queues. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 204\u2013219. Springer, Heidelberg (2006)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/11548133_12","volume-title":"Algebra and Coalgebra in Computer Science","author":"C Grabmayer","year":"2005","unstructured":"Grabmayer, C.: Using proofs by coinduction to find \u201cTraditional\u201d proofs. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 175\u2013193. Springer, Heidelberg (2005)"},{"key":"17_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-7633-9","volume-title":"General Lattice Theory","author":"G Gr\u00e4tzer","year":"1978","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Academic Press, New York (1978)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-48294-6_9","volume-title":"Static Analysis","author":"R Rydhof Hansen","year":"1999","unstructured":"Rydhof Hansen, R., Jensen, J.G., Nielson, F., Riis Nielson, H.: Abstract interpretation of mobile ambients. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 134\u2013148. Springer, Heidelberg (1999)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Henglein, F., Nielsen, L.: Regular expression containment: coinductive axiomatization and computational interpretation. In: POPL 2011, pp. 385\u2013398 (2011)","DOI":"10.1145\/1926385.1926429"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Relational and Algebraic Methods in Computer Science","author":"T Hoare","year":"2014","unstructured":"Hoare, T., van Staden, S., M\u00f6ller, B., Struth, G., Villard, J., Zhu, H., O\u2019Hearn, P.: Developments in concurrent Kleene Algebra. In: H\u00f6fner, P., Jipsen, P., Kahl, W., M\u00fcller, M.E. (eds.) RAMiCS 2014. LNCS, vol. 8428, pp. 1\u201318. Springer, Heidelberg (2014)"},{"issue":"2","key":"17_CR19","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Lesens, D., Halbwachs, N., Raymond, P.: Automatic verification of parameterized linear networks of processes. In: POPL 1997, pp. 346\u2013357 (1997)","DOI":"10.1145\/263699.263747"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-540-27815-3_27","volume-title":"Algebraic Methodology and Software Technology","author":"F Logozzo","year":"2004","unstructured":"Logozzo, F.: Separate compositional analysis of class-based object-oriented languages. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 334\u2013348. Springer, Heidelberg (2004)"},{"key":"17_CR22","volume-title":"Introduction to Languages and the Theory of Computation","author":"JC Martin","year":"1997","unstructured":"Martin, J.C.: Introduction to Languages and the Theory of Computation. McGraw-Hill, New York (1997)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-540-45099-3_16","volume-title":"Static Analysis","author":"L Mauborgne","year":"2000","unstructured":"Mauborgne, L.: Tree schemata and fair termination. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 302\u2013319. Springer, Heidelberg (2000)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Midtgaard, J., M\u00f8ller, A.: Quickchecking static analysis properties. In: ICST 2015, pp. 1\u201310. IEEE Computer Society (2015)","DOI":"10.1109\/ICST.2015.7102603"},{"issue":"2","key":"17_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S Owens","year":"2009","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program. 19(2), 173\u2013190 (2009)","journal-title":"J. Funct. Program."},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-44881-0_35","volume-title":"Rewriting Techniques and Applications","author":"G Rosu","year":"2003","unstructured":"Rosu, G., Viswanathan, M.: Testing extended regular language membership incrementally by rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 499\u2013514. Springer, Heidelberg (2003)"},{"issue":"1","key":"17_CR27","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. JACM 13(1), 158\u2013169 (1966)","journal-title":"JACM"},{"issue":"1\u20132","key":"17_CR28","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tcs.2006.06.028","volume":"368","author":"VT Vasconcelos","year":"2006","unstructured":"Vasconcelos, V.T., Gay, S., Ravara, A.: Typechecking a multithreaded functional language with session types. TCS 368(1\u20132), 64\u201387 (2006)","journal-title":"TCS"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-61739-6_53","volume-title":"Static Analysis","author":"A Venet","year":"1996","unstructured":"Venet, A.: Abstract cofibered domains: application to the alias analysis of untyped programs. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 366\u2013382. Springer, Heidelberg (1996)"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-49727-7_9","volume-title":"Static Analysis","author":"A Venet","year":"1998","unstructured":"Venet, A.: Automatic determination of communication topologies in mobile systems. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 152\u2013167. Springer, Heidelberg (1998)"},{"issue":"4","key":"17_CR31","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TCOM.1980.1094687","volume":"Com\u201328","author":"P Zafiropulo","year":"1980","unstructured":"Zafiropulo, P., West, C.H., Rudin, H., Cowan, D.D., Brand, D.: Towards analyzing and synthesizing protocols. IEEE Trans. Commun. Com\u201328(4), 651\u2013661 (1980)","journal-title":"IEEE Trans. Commun."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53413-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:34Z","timestamp":1498325914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53413-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534120","9783662534137"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53413-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}