{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:44:41Z","timestamp":1742939081203,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291893"},{"type":"electronic","value":"9783540320845"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11562436_23","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T09:40:51Z","timestamp":1129714851000},"page":"305-319","source":"Crossref","is-referenced-by-count":1,"title":["Structure Preserving Data Abstractions for Statecharts"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Helke","sequence":"first","affiliation":[]},{"given":"Florian","family":"Kamm\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BFb0054174","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"U. Brockmeyer","year":"1998","unstructured":"Brockmeyer, U., Wittich, G.: Tamagotchis need not die - verification of STATEMATE designs. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, p. 217. Springer, Heidelberg (1998)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximation of Fixed Points. In: Proceedings of the 4th ACM Symposium on Principles of Programming Languages. ACM, New York (1977)","DOI":"10.1145\/512950.512973"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Synthesis of synchronization skeletons for branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, Springer, Heidelberg (1982)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veit, H.: Counterexample-guided Abstraction Refinement. In: Sistla, A.P., Emerson, E.A. (eds.) CAV 2000. LNCS, vol.\u00a01855. Springer, Heidelberg (2000)","DOI":"10.1007\/10722167_15"},{"key":"23_CR5","unstructured":"Day, N.: A model checker for statecharts. Technical Report TR-93-35, Department of Computer Science, University of British Columbia (October 1993)"},{"key":"23_CR6","unstructured":"Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, Netherlands (July 1996)"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/235321.235322","volume":"5","author":"D. Harel","year":"1996","unstructured":"Harel, D., Naamad, D.: A STATEMATE semantics for statecharts. ACM Transactions on Software Engineering and Methodology\u00a05(4), 293\u2013333 (1996)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"23_CR8","unstructured":"Kamm\u00fcller, F., Helke, S.: Mechanical Analysis of UML State Machines and Class Diagrams. In: Defining Precise Semantics for UML, Satellite Workshop, ECOOP 2000, Sophia Antipolis, France (June 2000)"},{"key":"23_CR9","unstructured":"Helke, S., Kamm\u00fcller, F.: Verification of Statecharts Including Data Spaces. In: Basin, D., Wolff, B.(eds.) TPHOLs 2003: Emerging Trends Proceedings, Technical Report Albert-Ludwigs-Universitat Freiburg 189 (2003)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-44755-5_17","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Helke","year":"2001","unstructured":"Helke, S., Kamm\u00fcller, F.: Representing hierarchical automata in interactive theorem provers. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, p. 233. Springer, Heidelberg (2001)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45309-1_11","volume-title":"Programming Languages and Systems","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, p. 155. Springer, Heidelberg (2001)"},{"key":"23_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking: An Approach to the State Explosion Problem","author":"K. McMillan","year":"1993","unstructured":"McMillan, K.: Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"23_CR13","unstructured":"Mikk, E.: Semantics and Verification of Statecharts. PhD thesis, Christian Albrechts Universit\u00e4t Kiel (2000)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-60630-0_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O. M\u00fcller","year":"1995","unstructured":"M\u00fcller, O., Nipkow, T.: Combining Model Checking and Deduction for I\/O Automata. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, p. 116. Springer, Heidelberg (1995)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-17162-2_130","volume-title":"Category Theory and Computer Programming","author":"A. Melton","year":"1986","unstructured":"Melton, A., Schmidt, D.A., Strecker, G.: Galois connections and Computer Science applications. In: Poign\u00e9, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol.\u00a0240, pp. 299\u2013312. Springer, Heidelberg (1986)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Paulson, L.C.: A Generic Theorem Prover. In: Paulson, L.C. (ed.) Isabelle. LNCS, vol.\u00a0828. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0030541"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48683-6_38","volume-title":"Computer Aided Verification","author":"H. Sa\u00efdi","year":"1999","unstructured":"Sa\u00efdi, H., Shankar, N.: Abstract and model check while you prove. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 443\u2013454. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems - FORTE 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562436_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T04:20:00Z","timestamp":1683260400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562436_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291893","9783540320845"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11562436_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}