{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:08:56Z","timestamp":1725516536081},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691471"},{"type":"electronic","value":"9783540691495"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-69149-5_57","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"518-527","source":"Crossref","is-referenced-by-count":2,"title":["Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification"],"prefix":"10.1007","author":[{"given":"Mitsuharu","family":"Yamamoto","sequence":"first","affiliation":[]},{"given":"Yoshinori","family":"Tanabe","sequence":"additional","affiliation":[]},{"given":"Koichi","family":"Takahashi","sequence":"additional","affiliation":[]},{"given":"Masami","family":"Hagiya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_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.L.: A Theory of Timed Automata. Theoretical Computer Science\u00a0126, 183\u2013236 (1994)","journal-title":"Theoretical Computer Science"},{"key":"57_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"57_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00008-5","volume":"216","author":"A. Cerone","year":"1999","unstructured":"Cerone, A., Maggiolo-Schettini, A.: Time-Based Expressivity of Time Petri Nets for System Specification. Theoretical Computer Science\u00a0216, 1\u201353 (1999)","journal-title":"Theoretical Computer Science"},{"key":"57_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36384-X_25","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Dams","year":"2002","unstructured":"Dams, D., Namjoshi, K.S.: Shape analysis through predicate abstraction and model checking. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 310\u2013323. Springer, Heidelberg (2002)"},{"key":"57_CR6","series-title":"Formal Models and Semantics","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and Modal Logic. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 995\u20131072. Elsevier, Amsterdam (1990)"},{"key":"57_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"57_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-24754-8_2","volume-title":"Functional and Logic Programming","author":"M. Hagiya","year":"2004","unstructured":"Hagiya, M., Takahashi, K., Yamamoto, M., Sato, T.: Analysis of Synchronous and Asynchronous Cellular Automata using Abstraction by Temporal Logic. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 7\u201321. Springer, Heidelberg (2004)"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Reps, T., Sagiv, M., Loginov, A.: Finite Differencing of Logical Formulas for Static Analysis. In: European Symposium on Programming, pp. 380\u2013398 (2003)","DOI":"10.1007\/3-540-36575-3_26"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation Logic: A Logic for Shared Mutable Data Structures. In: Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"57_CR11","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1997","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"issue":"3","key":"57_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems\u00a024(3), 217\u2013298 (2002)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"57_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45744-5_7","volume-title":"Automated Reasoning","author":"U. Sattler","year":"2001","unstructured":"Sattler, U., Vardi, M.Y.: The Hybrid \u03bc-Calculus. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 76\u201391. Springer, Heidelberg (2001)"},{"key":"57_CR14","unstructured":"Takahashi, K., Hagiya, M.: Abstraction of Link Structures by Regular Expressions and Abstract Model Checking of Concurrent Garbage Collection. In: First Asian Workshop on Programming Languages and Systems, pp. 1\u20138 (2000)"},{"key":"57_CR15","unstructured":"Takahashi, K., Hagiya, M.: Formal Proof of Abstract Model Checking of Concurrent Garbage Collection. In: Workshop on Thirty Five years of Automath, Informal Proceedings, Heriot-Watt University, Edinburgh, April, 2002, pp. 115\u2013126 (2002)"},{"key":"57_CR16","unstructured":"Takahashi, K., Hagiya, M.: Abstraction of Graph Transformation using Temporal Formulas. In: Supplemental Volume of the 2003 International Conference on Dependable Systems and Networks (DSN-2003), pp. W-65 \u2013 W-66 (2003)"},{"issue":"3","key":"57_CR17","first-page":"154","volume":"22","author":"Y. Tanabe","year":"2005","unstructured":"Tanabe, Y., Takahashi, K., Yamamoto, M., Sato, T., Hagiya, M.: An Implementation of a Decision Procedure for Satisfiability of Two-Way CTL Formulas Using BDD (in Japanese). Computer Software, Japan Society for Software Science and Technology\u00a022(3), 154\u2013166 (2005)","journal-title":"Computer Software, Japan Society for Software Science and Technology"},{"key":"57_CR18","unstructured":"Tanabe, Y., Takai, T., Sekizawa, T., Takahashi, K.: Preconditions of Properties Described in CTL for Statements Manipulating Pointers. In: Supplemental Volume of the 2005 International Conference on Dependable Systems and Networks, June 28 \u2013 July 1, 2005, pp. 228\u2013234 (2005)"},{"key":"57_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11554554_21","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"Y. Tanabe","year":"2005","unstructured":"Tanabe, Y., Takahashi, K., Yamamoto, M., Tozawa, A., Hagiya, M.: A Decision Procedure for the Alternation-Free Two-Way Modal \u03bc-Calculus. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol.\u00a03702, pp. 277\u2013291. Springer, Heidelberg (2005)"},{"key":"57_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the Past with Two-Way Automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"},{"key":"57_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-60275-5_77","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"M. Yamamoto","year":"1995","unstructured":"Yamamoto, M., Nishizaki, S., Hagiya, M., Toda, Y.: Formalization of Planar Graphs. In: Schubert, E.T., Alves-Foss, J., Windley, P. (eds.) HUG 1995. LNCS, vol.\u00a0971, pp. 369\u2013384. Springer, Heidelberg (1995)"},{"key":"57_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BFb0055153","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Yamamoto","year":"1998","unstructured":"Yamamoto, M., Takahashi, K., Hagiya, M., Nishizaki, S., Tamai, T.: Formalization of Graph Search Algorithms and Its Applications. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 479\u2013496. Springer, Heidelberg (1998)"},{"key":"57_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45739-9_12","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"M. Yamamoto","year":"2002","unstructured":"Yamamoto, M., Cottin, J.-M., Hagiya, M.: Decidability of Safety Properties of Timed Multiset Rewriting. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, pp. 165\u2013183. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Verified Software: Theories, Tools, Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69149-5_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T12:57:14Z","timestamp":1551531434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69149-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540691471","9783540691495"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69149-5_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}