{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:48:33Z","timestamp":1725749313409},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405600"},{"type":"electronic","value":"9783642405617"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40561-7_7","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T13:10:29Z","timestamp":1379509829000},"page":"91-105","source":"Crossref","is-referenced-by-count":0,"title":["Lifting Verification Results for Preemption Statements"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Gesell","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Morgenstern","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Andr\u00e9, C.: SyncCharts: A visual representation of reactive behaviors. Research Report tr95-52, University of Nice, Sophia Antipolis, France (1995)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-36577-X_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Armoni","year":"2003","unstructured":"Armoni, R., Bustan, D., Kupferman, O., Vardi, M.Y.: Resets vs. Aborts in linear temporal logic. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 65\u201380. Springer, Heidelberg (2003)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/JPROC.2002.805826","volume":"91","author":"A. Benveniste","year":"2003","unstructured":"Benveniste, A., Caspi, P., Edwards, S., Halbwachs, N., Le Guernic, P., de Simone, R.: The synchronous languages twelve years later. Proceedings of the IEEE\u00a091(1), 64\u201383 (2003)","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G. Berry","year":"1992","unstructured":"Berry, G., Gonthier, G.: The Esterel synchronous programming language: Design, semantics, implementation. Science of Computer Programming\u00a019(2), 87\u2013152 (1992)","journal-title":"Science of Computer Programming"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Brandt, J., Schneider, K.: Separate compilation for synchronous programs. In: Falk, H. (ed.) Software and Compilers for Embedded Systems (SCOPES), Nice, France. ACM International Conference Proceeding Series, vol.\u00a0320, pp. 1\u201310. ACM (2009)","DOI":"10.1145\/1543820.1543822"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-49213-5_25","volume-title":"Compositionality: The Significant Difference","author":"F.S. Boer de","year":"1998","unstructured":"de Boer, F.S., de Roever, W.-P.: Compositional proof methods for concurrency: A semantic approach. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 632\u2013646. Springer, Heidelberg (1998)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49213-5_1","volume-title":"Compositionality: The Significant Difference","author":"W.-P. Roever de","year":"1998","unstructured":"de Roever, W.-P.: The need for compositional proof systems: A survey. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 1\u201322. Springer, Heidelberg (1998)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gesell, M., Schneider, K.: Modular verification of synchronous programs. In: Application of Concurrency to System Design (ACSD), Barcelona, Spain. IEEE Computer Society (2013)","DOI":"10.1109\/ACSD.2013.10"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Halbwachs, N.: Synchronous programming of reactive systems. Kluwer (1993)","DOI":"10.1007\/978-1-4757-2231-4"},{"key":"7_CR10","unstructured":"Halbwachs, N.: A synchronous language at work: the story of Lustre. In: Formal Methods and Models for Codesign (MEMOCODE), Verona, Italy, pp. 3\u201311. IEEE Computer Society (2005)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K. (ed.) Logic and Models of Concurrent Systems, pp. 477\u2013498. Springer (1985)","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-60218-6_31","volume-title":"CONCUR \u201995 Concurrency Theory","author":"O. Kupferman","year":"1995","unstructured":"Kupferman, O., Vardi, M.Y.: On the complexity of branching modular model checking (extended abstract). In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 408\u2013422. Springer, Heidelberg (1995)"},{"issue":"9","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/5.97301","volume":"79","author":"P. Guernic Le","year":"1991","unstructured":"Le Guernic, P., Gauthier, T., Le Borgne, M., Le Maire, C.: Programming real-time applications with SIGNAL. Proceedings of the IEEE\u00a079(9), 1321\u20131336 (1991)","journal-title":"Proceedings of the IEEE"},{"key":"7_CR14","unstructured":"Schneider, K.: Verification of Reactive Systems \u2013 Formal Methods and Algorithms. Texts in Theoretical Computer Science (EATCS Series). Springer (2003)"},{"key":"7_CR15","unstructured":"Schneider, K.: The synchronous programming language Quartz. Internal Report 375, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany (December 2009)"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40561-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:39:57Z","timestamp":1558093197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40561-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405600","9783642405617"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40561-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}