{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:01:15Z","timestamp":1742965275123,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631040"},{"type":"electronic","value":"9783540691402"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","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":[[1997]]},"DOI":"10.1007\/3-540-63104-6_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:04:03Z","timestamp":1330279443000},"page":"366-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Proof tactics for a theory of state machines in a graphical environment"],"prefix":"10.1007","author":[{"given":"K. A.","family":"Eastaughffe","sequence":"first","affiliation":[]},{"given":"M. A.","family":"Ozols","sequence":"additional","affiliation":[]},{"given":"A.","family":"Cant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"35_CR1","unstructured":"D. Basin, S. Matthews and L. Vigan\u00f3. A modular presentation of modal logics in a logical framework. In Proceedings of the Tbilisi Symposium on Language, Logic and Computation, October 1995."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"M. Bonsangue and J. N. Kok. Isomorphisms between predicate and state transfomers. In Mathematical Foundations of Computer Science, Volume 711 of LNCS. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57182-5_22"},{"key":"35_CR3","first-page":"16","volume-title":"A tool for practical reasoning about state machine designs","author":"A. Cant","year":"1996","unstructured":"A. Cant, K. A. Eastaughffe and M. A. Ozols. A tool for practical reasoning about state machine designs. In Proc. 1996 Australian Software Engineering Conference, pages 16\u201326, Melbourne, July 1996. IEEE Computer Society Press."},{"key":"35_CR4","unstructured":"A. Cant and M. A. Ozols. XIsabelle. Research Report RR-0008, Electronics and Surveillance Research Laboratory, DSTO, 1996."},{"key":"35_CR5","volume-title":"Conference Paper CP-91-5402-43","author":"D. Craigen","year":"1991","unstructured":"D. Craigen et al. EVES: An Overview. Conference Paper CP-91-5402-43, Odyssey Research Associates, 265 Carling Avenue, Suite 506, Ottawa, Ontario, March 1991."},{"key":"35_CR6","unstructured":"J. W. de Bakker. Recursive programs as predicate transformers. In Formal Description of Programming Concepts. North-Holland, 1978."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Kolyang, T. Santen and B. Wolff. A structure preserving encoding of Z in Isabelle\/HOL. In J. von Wright, J. Grundy and J. Harrison (editors), Proceedings of 9th International Conference on Theorem Proving in Higher-Order Logic, Volume 1125 of LNCS, pages 283\u2013298. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0105411"},{"key":"35_CR8","volume-title":"Isabelle Users Workshop","author":"C. Owens","year":"1995","unstructured":"C. Owens. Coding binding and and substitution explicitly in Isabelle. Isabelle Users Workshop, Cambridge University, U.K., 1995."},{"key":"35_CR9","first-page":"748","volume-title":"Volume 607 of Lecture Notes in Artificial Intelligence","author":"S. Owre","year":"1992","unstructured":"S. Owre, J. M. Rushby and N. Shankar. PVS: A prototype verification system. In Deepak Kapur (editor), 11th International Conference on Automated Deduction (CADE), Volume 607 of Lecture Notes in Artificial Intelligence, pages 748\u2013752, Saratoga, NY, June 1992. Springer-Verlag."},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"M. A. Ozols, A. Cant and K. A. Eastaughffe. Xisabelle: System description. In 14th International Conference on Automated Deduction (CADE). Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63104-6_38"},{"key":"35_CR11","unstructured":"L. C. Paulson and T. Nipkow. Isabelle: A Generic Theorem Prover, Volume 828 of LNCS. Springer Verlag, 1994."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"A. Trybulec and H. A. Blair. Computer aided reasoning. In R. Parikh (editor), Logics of Programs, Volume 193 of LNCS, pages 406\u2013412. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15648-8_30"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-14"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63104-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:45:14Z","timestamp":1558255514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63104-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631040","9783540691402"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63104-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}