{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:09:42Z","timestamp":1725487782778},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678632"},{"type":"electronic","value":"9783540446590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44659-1_20","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T13:40:26Z","timestamp":1185025226000},"page":"320-337","source":"Crossref","is-referenced-by-count":3,"title":["Total-Correctness Refinement for Sequential Reactive Systems"],"prefix":"10.1007","author":[{"given":"Paul B.","family":"Jackson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Samson Abramsky. A note on reactive refinement. Personal Communication, May 19th 1999."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Rajeev Alur and Thomas Henzinger. Reactive modules. Formal methods in System Design, 15:7\u201348, 1999.","journal-title":"Formal methods in System Design"},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","volume-title":"CONCUR\u2019 98","author":"R. Alur","year":"1998","unstructured":"Rajeev Alur, Thomas A. Henzinger, Orna Kupfermann, and Moshe Y. Vardi. Alternating refinement relations. In CONCUR\u2019 98, LNCS. Springer Verlag, 1998."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Willem-Paul de Roever and Kai Engelhardt. Data Refinement: Model-oriented proof methods and their comparison. Number 47 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511663079"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"David L. Dill. Hierarchical Verification of Speed Independent Asynchonous Circuits. MIT, 1988.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"20_CR6","unstructured":"Matthew Hennessey. A theory of Testing. MIT, 1989."},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1093\/logcom\/9.4.463","volume":"9","author":"U. Hensel","year":"1999","unstructured":"Ulrich Hensel and Bart Jacobs. Coalgebraic theories of sequences in PVS. Journal of Logic and Computation, 9(4):463\u2013500, 1999.","journal-title":"Journal of Logic and Computation"},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BFb0055139","volume-title":"11th International Conference on Theorem Proving in Higher-Order Logics: TPHOLs\u201998","author":"P. B. Jackson","year":"1998","unstructured":"Paul B. Jackson. Verifying a garbage collection algorithm. In Jim Grundy and Malcolm Newey, editors, 11th International Conference on Theorem Proving in Higher-Order Logics: TPHOLs\u201998, volume 1479 of Lecture Notes in Computer Science, pages 225\u2013244. Springer-Verlag, September 1998."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of TAPSOFT\/FASE 1997","author":"B. Jacobs","year":"1997","unstructured":"Bart Jacobs. Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs. In Proceedings of TAPSOFT\/FASE 1997, LNCS. Springer Verlag, 1997."},{"key":"20_CR10","unstructured":"C. B. Jones. Program Specification and Verification in VDM. Prentice Hall, 2nd edition, 1990."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. Processes: a mathematical model of computing agents. In Logic colloquium\u2019 73, pages 157\u2013173. North Holland, 1975.","DOI":"10.1016\/S0049-237X(08)71948-7"},{"key":"20_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"S. Owre, J.M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748\u2013752. Springer-Verlag, 1992. See http:\/\/www.csl.sri.com\/pvs.html for up-to-date information on PVS.","DOI":"10.1007\/3-540-55602-8_217"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T07:33:00Z","timestamp":1556695980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44659-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678632","9783540446590"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44659-1_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}