{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:24:01Z","timestamp":1725989041883},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319999326"},{"type":"electronic","value":"9783319999333"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99933-3_8","type":"book-chapter","created":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T08:33:39Z","timestamp":1535186019000},"page":"129-134","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improvement in JavaMOP by Simplifying B\u00fcchi Automaton"],"prefix":"10.1007","author":[{"given":"Junyan","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongyi","family":"Zhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingzhong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,26]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jlap.2008.08.004","volume":"78","author":"M Leucker","year":"2009","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Log. Algebr. Program. 78(5), 293\u2013303 (2009)","journal-title":"J. Log. Algebr. Program."},{"issue":"10","key":"8_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/1103845.1094839","volume":"40","author":"C Allan","year":"2005","unstructured":"Allan, C., Avgustinov, P., Christensen, A.S., et al.: Adding trace matching with free variables to AspectJ. ACM SIGPLAN Not. 40(10), 345\u2013364 (2005)","journal-title":"ACM SIGPLAN Not."},{"issue":"10","key":"8_CR3","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/1297105.1297070","volume":"42","author":"P Avgustinov","year":"2007","unstructured":"Avgustinov, P., Tibble, J., Moor, O.D.: Making trace monitors feasible. ACM SIGPLAN Not. 42(10), 589\u2013608 (2007)","journal-title":"ACM SIGPLAN Not."},{"issue":"10","key":"8_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/1103845.1094840","volume":"40","author":"M Martin","year":"2005","unstructured":"Martin, M., Livshits, B., Lam, M.S.: Finding application errors and security flaws using PQL: a program query language. ACM SIGPLAN Not. 40(10), 365\u2013383 (2005)","journal-title":"ACM SIGPLAN Not."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-31980-1_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Chen","year":"2005","unstructured":"Chen, F., Ro\u015fu, G.: Java-MOP: a monitoring oriented programming environment for Java. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 546\u2013550. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31980-1_36"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2006.02.002","volume":"144","author":"F Chen","year":"2006","unstructured":"Chen, F., D\u2019Amorim, M., Ro\u015fu, G.: Checking and correcting behaviors of Java programs at runtime with Java-MOP. Electron. Notes Theor. Comput. Sci. 144(4), 3\u201320 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-23820-3_24","volume-title":"Runtime Verification","author":"P Daian","year":"2015","unstructured":"Daian, P., et al.: RV-android: efficient parametric android runtime verification, a brief tutorial. In: Bartocci, E., Majumdar, R. (eds.) RV 2015. LNCS, vol. 9333, pp. 342\u2013357. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23820-3_24"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-319-46982-9_24","volume-title":"Runtime Verification","author":"Y Yamagata","year":"2016","unstructured":"Yamagata, Y., et al.: Runtime monitoring for concurrent systems. In: Falcone, Y., S\u00e1nchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 386\u2013403. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46982-9_24"},{"key":"8_CR9","unstructured":"Giannakopoulou, D., Havelund, K.: Runtime analysis of linear temporal logic specifications. In: IEEE International Conference on Automated Software Engineering 2001 (2001)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10009-011-0198-6","volume":"14","author":"D Jin","year":"2012","unstructured":"Jin, D., Griffith, D., Chen, F.: An overview of the MOP runtime verification framework. Int. J. Softw. Tools Technol. Transf. 14(3), 249\u2013289 (2012)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53\u201365. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44585-4_6"},{"key":"8_CR12","unstructured":"Tischner, D.: Minimization of B\u00fcchi Automata using Fair Simulation (2016)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal Logic of Programs. Weizmann Science Press of Israel, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-540-30482-1_31","volume-title":"Formal Methods and Software Engineering","author":"F Chen","year":"2004","unstructured":"Chen, F., D\u2019Amorim, M., Ro\u015fu, G.: A formal monitoring-based framework for software development and analysis. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 357\u2013372. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30482-1_31"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-31980-1_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Schwoon","year":"2005","unstructured":"Schwoon, S., Esparza, J.: A note on On-the-Fly verification algorithms. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 174\u2013190. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31980-1_12"},{"issue":"5","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S0097539703420675","volume":"34","author":"K Etessami","year":"2005","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for B\u00fcchi automaton. SIAM J. Comput. 34(5), 1159\u20131175 (2005)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"8_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1167515.1167488","volume":"41","author":"SM Blackburn","year":"2006","unstructured":"Blackburn, S.M., Garner, R., Hoffmann, C., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. ACM SIGPLAN Not. 41(10), 169\u2013190 (2006)","journal-title":"ACM SIGPLAN Not."}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99933-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T08:41:19Z","timestamp":1535186479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99933-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319999326","9783319999333"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99933-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}