{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T04:59:14Z","timestamp":1790744354285,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678632","type":"print"},{"value":"9783540446590","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44659-1_25","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T13:40:26Z","timestamp":1185025226000},"page":"406-423","source":"Crossref","is-referenced-by-count":6,"title":["TAS \u2014 A Generic Window Inference System"],"prefix":"10.1007","author":[{"given":"Christoph","family":"L\u00fcth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Burkhart","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF01211456","volume":"9","author":"R. Back","year":"1997","unstructured":"R. Back, J. Grundy, and J. von Wright. Structured calculational proof. Formal Aspects of Computing, 9:467\u2013483, 1997.","journal-title":"Formal Aspects of Computing"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"R.-J. Back and J. von Wright. Refinement Calculus. Springer Verlag, 1998.","DOI":"10.1007\/978-1-4612-1674-2"},{"key":"25_CR3","series-title":"Lect Notes Comput Sci","volume-title":"The Munich Project CIP. The Wide Spectrum Language CIP-L","author":"F. L. Bauer","year":"1985","unstructured":"F. L. Bauer. The Munich Project CIP. The Wide Spectrum Language CIP-L. Number 183 in LNCS. Springer Verlag, 1985."},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0000463","volume-title":"Algebraic Methodology and Software Technology AMAST\u201997","author":"B. Buth","year":"1997","unstructured":"B. Buth, J. Peleska, and H. Shi. Combining methods for the deadlock analysis of a fault-tolerant system. In Algebraic Methodology and Software Technology AMAST\u201997, number 1349 in LNCS, pages 60\u201375. Springer Verlag, 1997."},{"key":"25_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-49253-4_11","volume-title":"Algebraic Methodology and Software Technology AMAST\u201998","author":"B. Buth","year":"1999","unstructured":"B. Buth, J. Peleska, and H. Shi. Combining methods for the livelock analysis of a fault-tolerant system. In Algebraic Methodology and Software Technology AMAST\u201998, number 1548 in LNCS, pages 124\u2013139. Springer Verlag, 1999."},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s001650050006","volume":"10","author":"D. Carrington","year":"1998","unstructured":"D. Carrington, I. Hayes, R. Nickson, G. Watson, and J. Welsh. A Program Refinement Tool. Formal Aspects of Computing, 10(2):97\u2013124, 1998.","journal-title":"Formal Aspects of Computing"},{"key":"25_CR7","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press and New York: McGraw-Hill, 1989."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer Verlag, 1990.","DOI":"10.1007\/978-1-4612-3228-5"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"D. Gries. A Science of Programming. Springer Verlag, 1981.","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/102868.102870","volume":"34","author":"D. Gries","year":"1991","unstructured":"D. Gries. Teaching calculation and discrimination: A more effecticulum. Communications of the ACM, 34:45\u201354, 1991.","journal-title":"Communications of the ACM"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1093\/comjnl\/39.4.291","volume":"39","author":"J. Grundy","year":"1996","unstructured":"J. Grundy. Transformational hierarchical reasoning. Computer Journal, 39:291\u2013302, 1996.","journal-title":"Computer Journal"},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56733-X","volume-title":"PROSPECTRA: Program Development by Specification and Transformation","author":"B. Hoffmann","year":"1993","unstructured":"B. Hoffmann and B. Krieg-Br\u00fcckner. PROSPECTRA: Program Development by Specification and Transformation. Number 690 in LNCS. Springer Verlag, 1993."},{"key":"25_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/3-540-60973-3_111","volume-title":"Formal Methods Europe FME\u201996","author":"T. S. Kolyang","year":"1996","unstructured":"Kolyang, T. Santen, and B. Wolff. Correct and user-friendly implementations of transformation systems. In M. C. Gaudel and J. Woodcock, editors, Formal Methods Europe FME\u201996, number 1051 in LNCS, pages 629\u2013648. Springer Verlag, 1996."},{"key":"25_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-60275-5_69","volume-title":"Proc. 8 th International Workshop on Higher Order Logic Theorem Proving and Its Applications","author":"T. L\u00e5ngbacka","year":"1995","unstructured":"T. L\u00e5ngbacka, R. Ruk\u0161ena, and J. von Wright. TkWinHOL: A tool for doing window inferencing in HOL. In Proc. 8 th International Workshop on Higher Order Logic Theorem Proving and Its Applications, number 971 in LNCS, pages 245\u2013260. Springer Verlag, 1995."},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0956796899003421","volume":"9","author":"C. L\u00fcth","year":"1999","unstructured":"C. L\u00fcth and B. Wolff. Functional design and implementation of graphical user interfaces for theorem provers. Journal of Functional Programming, 9(2):167\u2013189, March 1999.","journal-title":"Journal of Functional Programming"},{"key":"25_CR16","series-title":"Lect Notes Comput Sci","first-page":"333","volume-title":"Recent trends in algebraic development techniques. Proc 13thInternational Workshop","author":"T. M. Kolyang","year":"1998","unstructured":"T. Mossakowski, Kolyang, and B. Krieg-Br\u00fcckner. Static semantic analysis and theorem proving for CASL. In Recent trends in algebraic development techniques. Proc 13th International Workshop, number 1376 in LNCS, pages 333\u2013348. Springer Verlag, 1998."},{"key":"25_CR17","unstructured":"R. S. Lazi\u00e6. A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University, 1999."},{"issue":"1","key":"25_CR18","first-page":"43","volume":"14","author":"P. J. Robinson","year":"1993","unstructured":"P. J. Robinson and J. Staples. Formalizing a hierarchical structure of practical mathematical reasoning. Journal for Logic and Computation, 14(1):43\u201352, 1993.","journal-title":"Journal for Logic and Computation"},{"key":"25_CR19","unstructured":"A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0167-6423(85)90003-6","volume":"5","author":"D. Smith","year":"1985","unstructured":"D. Smith. The design of divide and conquer algorithms. Science of Computer Programming, 5:37\u201358, 1985.","journal-title":"Science of Computer Programming"},{"issue":"9","key":"25_CR21","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/32.58788","volume":"16","author":"D. R. Smith","year":"1991","unstructured":"D. R. Smith. KIDS \u2014 a semi-automatic program development system. IEEE Transactions on Software Engineering, 16(9):1024\u20131043, 1991.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0167-6423(90)90025-9","volume":"14","author":"D. R. Smith","year":"1990","unstructured":"D. R. Smith and M. R. Lowry. Algorithm theories and design tactics. Science of Computer Programming, 14:305\u2013321, 1990.","journal-title":"Science of Computer Programming"},{"key":"25_CR23","unstructured":"M. Staples. Window inference in Isabelle. In Proc. Isabelle Users Workshop. University of Cambridge Computer Laboratory, 1995."},{"key":"25_CR24","unstructured":"M. Staples. A Mechanised Theory of Refinement. PhD thesis, Computer Laboratory, University of Cambridge, 1998."},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"M. Staples. Representing wp semantics in isabelle\/zf. In G. Dowek, C. Paulin, and Y. Bertot, editors, TPHOLs: The 12th International Conference on Theorem Proving in Higher-Order Logics, number 1690 in lncs. springer, 1999.","DOI":"10.1007\/3-540-48256-3_16"},{"key":"25_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-63533-5_17","volume-title":"Formal Methods Europe FME\u2019 97","author":"H. Tej","year":"1997","unstructured":"H. Tej and B. Wolff. A corrected failure-divergence model for CSP in Isabelle\/HOL. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, Formal Methods Europe FME\u2019 97, number 1313 in LNCS, pages 318\u2013337. Springer Verlag, 1997."},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"D. van Dalen. Logic and Structure. Springer Verlag, 1994.","DOI":"10.1007\/978-3-662-02962-6"},{"key":"25_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0020908","volume-title":"Advances in Software Engineering and Knowledge Engineering","author":"A. J. M. Gasteren van","year":"1990","unstructured":"A. J. M. van Gasteren. On the shape of mathematical arguments. In Advances in Software Engineering and Knowledge Engineering, number 445 in LNCS, pages 1\u201339. Springer Verlag, 1990."},{"key":"25_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0055127","volume-title":"Proc. TPHOLs\u2019 98","author":"J. Wright von","year":"1998","unstructured":"J. von Wright. Extending window inference. In Proc. TPHOLs\u2019 98, number 1497 in LNCS, pages 17\u201332. Springer Verlag, 1998."}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44659-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T07:32:52Z","timestamp":1556695972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44659-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678632","9783540446590"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-44659-1_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}