{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:56Z","timestamp":1725456476304},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057235X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013164","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:23:18Z","timestamp":1132730598000},"page":"2-16","source":"Crossref","is-referenced-by-count":3,"title":["Proving the correctness of algebraic implementations by the ISAR system"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Hennicker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"An interactive system for algebraic implementation proofs: The ISAR system from the user's point of view. Universit\u00e4t M\u00fcnchen, Technical Report (to appear), 1993.","key":"2_CR1"},{"unstructured":"C. Beierle, A. Vo\\: Algebraic specification and implementation in an integrated software development and verification system. MEMO SEKI-12, FB Informatik, Universit\u00e4t Kaiserslautern, 1985.","key":"2_CR2"},{"unstructured":"How to prove observational theorems with LP. Proc. of the First International Workshop on Larch, July 1992, Boston, USA, Springer Verlag Workshop in Computing Series, 1993. Also in: Laboratoire d'Informatique de l' Ecole Normale Sup\u00e9rieure, Paris, LIENS-92-23, 1992.","key":"2_CR3"},{"key":"2_CR4","volume-title":"A computational logic handbook","author":"R. S. Boyer","year":"1988","unstructured":"R. S. Boyer, J. S. Moore: A computational logic handbook. Academic Press, New York, 1988."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"12","author":"R. M. Burstall","year":"1969","unstructured":"R. M. Burstall: Proving properties of programs by structural induction. Comp. Journal 12, 41\u201348, 1969.","journal-title":"Comp. Journal"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/ASR.1993.291713","volume-title":"Advances in Software Reuse","author":"P. S. Chen","year":"1993","unstructured":"P. S. Chen, R. Hennicker, M. Jarke: On the retrieval of reusable software components. In: R. Prieto-Diaz, W. B. Frakes (eds.): Advances in Software Reuse. Selected Papers from the Second International Workshop on Software Reusability. Lucca, Italy, 1993. IEEE Computer Society Press, Los Alamitos, California, Order Number 3130, 99\u2013108, 1993."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(82)80001-7","volume":"20","author":"H. Ehrig","year":"1982","unstructured":"H. Ehrig, H.-J. Kreowski, B. Mahr, P. Padawitz: Algebraic Imple-mentation of Abstract Data Types. Theoretical Computer Science 20, 209\u2013263, 1982.","journal-title":"Theoretical Computer Science"},{"key":"2_CR8","volume-title":"EATCS Monographs on Theoretical Computer Science 6","author":"H. Ehrig","year":"1985","unstructured":"H. Ehrig, B. Mahr: Fundamentals of algebraic specification 1, EATCS Monographs on Theoretical Computer Science 6, Springer, Berlin, 1985."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/3-540-53904-2_116","volume":"488","author":"U. Fraus","year":"1991","unstructured":"U. Fraus, H. Hu\\mann: A narrowing-based theorem prover. Extended Abstract. In: Proc. RTA '91, Rewriting Techniques and its Applications, Lecture Notes in Computer Science 488, 435\u2013436, 1991.","journal-title":"Lecture Notes in Computer Science"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-51081-8_105","volume":"355","author":"S. J. Garland","year":"1989","unstructured":"S. J. Garland, J. V. Guttag: An overview of LP, the Larch Prover. In: Proc. RTA '89, Rewriting Techniques and its Applications, Lecture Notes in Computer Science 355, 137\u2013151, 1989.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R. Hennicker: Context Induction: a proof principle for behavioural abstractions. In: A. Miola (ed.): Proc. DISCO '90, International Symposium on Design and Implementation of Symbolic Computation Systems, Capri, April 1990. Lecture Notes in Computer Science 429, 101\u2013110, 1990.","key":"2_CR11","DOI":"10.1007\/3-540-52531-9_129"},{"doi-asserted-by":"crossref","unstructured":"A semi-algorithm for algebraic implementation proofs. Theoretical Computer Science 104, Special Issue, 53\u201387, 1992.","key":"2_CR12","DOI":"10.1016\/0304-3975(92)90166-D"},{"unstructured":"M $$M^{\\underset{\\raise0.3em\\hbox{$\\smash{\\scriptscriptstyle-}$}}{a} }$$ P. Nivela, F. Orejas: Initial behaviour semantics for algebraic specifications. In: D. T. Sannella, A. Tarlecki (eds.): Proc. 5th Workshop on Algebraic Specifications of Abstract Data Types, Lecture Notes in Computer Science 332, 184\u2013207, 1988.","key":"2_CR13"},{"key":"2_CR14","volume-title":"EATCS Monographs on Theoretical Computer Science 16","author":"P. Padawitz","year":"1988","unstructured":"P. Padawitz: Computing in Horn clause theories. EATCS Monographs on Theoretical Computer Science 16, Springer, Berlin, 1988."},{"unstructured":"H. Reichel: Initial restrictions of behaviour. IFIP Working Conference, The Role of Abstract Models in Information Processing, 1985.","key":"2_CR15"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00283329","volume":"25","author":"D. T. Sannella","year":"1988","unstructured":"D. T. Sannella, A. Tarlecki: Toward formal development of programs from algebraic specifications: implementation revisited. Acta Informatica 25, 233\u2013281, 1988.","journal-title":"Acta Informatica"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(86)90051-4","volume":"42","author":"M. Wirsing","year":"1986","unstructured":"M. Wirsing: Structured algebraic specifications: a kernel language. Theoretical Computer Science 42, 123\u2013249, 1986.","journal-title":"Theoretical Computer Science"},{"unstructured":"Algebraic description of reusable software components. In: Proc. COMPEURO '88, Comp. Society Order Number 834, 300\u2013312, 1988.","key":"2_CR18"}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Symbolic Computation Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:31:58Z","timestamp":1586579518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057235X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0013164","relation":{},"subject":[]}}