{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:23Z","timestamp":1742913083543,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":115,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642115110"},{"type":"electronic","value":"9783642115127"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11512-7_1","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T11:11:26Z","timestamp":1265886686000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["A Bibliography of Willem-Paul de Roever"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Dams","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Hannemann","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511663079","volume-title":"Data Refinement: Model-Oriented Proof Methods and their Comparison","author":"W.-P. de Roever","year":"1998","unstructured":"de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge Tracts in Theoretical Computer Science, vol.\u00a047. Cambridge University Press, Cambridge (1998); With the assistance of Jos Coenen, Karl-Heinz Buth, Paul Gardiner, Yassine Lakhnech, and Frank Stomp"},{"key":"1_CR2","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods","author":"W.-P. de Roever","year":"2001","unstructured":"de Roever, W.-P., de Boer, F.S., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Cambridge Tracts in Theoretical Computer Science, vol.\u00a054. Cambridge University Press, Cambridge (2001)"},{"key":"1_CR3","first-page":"167","volume-title":"Automata, Languages and Programming (ICALP)","author":"W.-P. de Roever","year":"1972","unstructured":"de Roever, W.-P., de Bakker, J.W.: A calculus for recursive program schemes. In: Automata, Languages and Programming (ICALP), pp. 167\u2013196. North-Holland, Amsterdam (1972)"},{"key":"1_CR4","unstructured":"de Roever., W.-P.: A formalization of various parameter mechanisms as products of relations within a calculus of recursive program schemes. S\u00e9minaires IRIA, Th\u00e9orie des algorithmes etc. (1972)"},{"key":"1_CR5","unstructured":"de Roever, W.-P.: Semantics for recursive polyadic program schemata. In: Proceeding of Mathematical Foundations of Computer Science (1973); Reprinted as report IW 6, 1973, Mathematisch Centrum"},{"key":"1_CR6","unstructured":"de Roever, W.-P.: A correctness proof of the Schorr\u2013Waite marking algorithm for binary trees. Mathematical Centre Syllabus\u00a021 (1975)"},{"key":"1_CR7","unstructured":"de Roever, W.-P.: Recursive Program Schemes: Semantics and Proof Theory. Dissertation, Free University, Amsterdam (1974); Also published as Mathematical Centre Tract 70, as a revised edition"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"W.-P. de Roever","year":"1974","unstructured":"de Roever, W.-P.: Recursion and parameter mechanisms: An axiomatic approach. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014. Springer, Heidelberg (1974)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-07162-8_703","volume-title":"Mathematical Foundations of Computer Science 1974","author":"W.-P. de Roever","year":"1975","unstructured":"de Roever, W.-P.: Call\u2013by\u2013name versus call\u2013by\u2013value: A proof\u2013theoretic comparison. In: Blikle, A. (ed.) MFCS 1974. LNCS, vol.\u00a028, pp. 451\u2013463. Springer, Heidelberg (1975)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-07389-2_223","volume-title":"Mathematical Foundations of Computer Science 1975","author":"W.-P. de Roever","year":"1975","unstructured":"de Roever, W.-P.: First\u2013order reduction of call\u2013by\u2013name to call\u2013by\u2013value. In: Becvar, J. (ed.) MFCS 1975. LNCS, vol.\u00a032, pp. 377\u2013398. Springer, Heidelberg (1975)"},{"key":"1_CR11","unstructured":"de Roever, W.-P.: Correctness proofs for search and marking algorithms of dyadic data structures. In: Mathematical Centre Syllabus 25, Colloquium Structuur van Programmeertalen (1976)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/3-540-07854-1_217","volume-title":"Mathematical Foundations of Computer Science 1976","author":"W.-P. de Roever","year":"1976","unstructured":"de Roever, W.-P.: Dijkstra\u2019s predicate transformer, non\u2013determinism, recursion and termination. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol.\u00a045, pp. 472\u2013481. Springer, Heidelberg (1976)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-08342-1_32","volume-title":"Automata, Languages and Programming","author":"W.-P. de Roever","year":"1977","unstructured":"de Roever, W.-P.: On backtracking and greatest fixedpoints . In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a052, pp. 412\u2013429. Springer, Heidelberg (1977)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-08921-7_67","volume-title":"Mathematical Foundations of Computer Science 1978","author":"W.-P. de Roever","year":"1978","unstructured":"de Roever, W.-P., Francez, N., Hoare, C.A.R.: Semantics of non-determinism, concurrency, and communication. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol.\u00a064, pp. 191\u2013200. Springer, Heidelberg (1978)"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(79)90006-0","volume":"19","author":"W.-P. de Roever","year":"1979","unstructured":"de Roever, W.-P., Francez, N., Hoare, C.A.R., Lehmann, D.: Semantics of nondeterminism, concurrency, and communication. Journal of Computer and System Sciences\u00a019(3), 290\u2013308 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR16","first-page":"53","volume-title":"Sixth Annual Symposium on Principles of Programming Languages (POPL)","author":"W.-P. de Roever","year":"1979","unstructured":"de Roever, W.-P., Lee, S., Gerhart, S.L.: The evolution of list copying algorithms or the need for structured program verification. In: Sixth Annual Symposium on Principles of Programming Languages (POPL), San Antonio, TX, pp. 53\u201367. ACM, New York (1979)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"W.-P. de Roever","year":"1980","unstructured":"de Roever, W.-P., Apt, K.R., Francez, N.: A proof system for communicating sequential processes. ACM Transactions on Programming Languages and Systems\u00a02, 359\u2013385 (1980)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR18","first-page":"88","volume-title":"Proceedings of the GI 1981","author":"W.-P. de Roever","year":"1981","unstructured":"de Roever, W.-P., Roncken, M., Gerth, R.: A proof system for Brinch Hansen\u2019s distributed processes (extended abstract). In: Proceedings of the GI 1981, M\u00fcnchen, Informatik Fachberichte, pp. 88\u201395. Springer, Heidelberg (1981)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BFb0025777","volume-title":"Logics of Programs","author":"W.-P. de Roever","year":"1982","unstructured":"de Roever, W.-P.: A formalism for reasoning about fair termination. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 113\u2013121. Springer, Heidelberg (1982)"},{"key":"#cr-split#-1_CR20.1","unstructured":"de Roever, W.-P., Grumberg, O., Francez, N., Makowski, J.A.: A proof rule for fair termination of guarded commands. In: de Bakker, J.W., van Vliet, H. (eds.) Proceedings of Symposium on Algorithmic Languages. North-Holland, Amsterdam (1981)"},{"key":"#cr-split#-1_CR20.2","doi-asserted-by":"crossref","unstructured":"In revised form in: Information and Control 66(1\/2), 83-102 (1985)","DOI":"10.1016\/S0019-9958(85)80014-0"},{"key":"1_CR21","volume-title":"Proc. of the IFIP Working Conference on Formal Description of Programming Concepts II, Garmisch-Partenkirchen","author":"W.-P. de Roever","year":"1982","unstructured":"de Roever, W.-P., Kuiper, R.: Fairness assumption for CSP in a temporal logic framework. In: Bj\u00f8rner, D. (ed.) Proc. of the IFIP Working Conference on Formal Description of Programming Concepts II, Garmisch-Partenkirchen, June 1-4. North-Holland, Amsterdam (1982)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-11494-7_11","volume-title":"International Symposium on Programming","author":"W.-P. de Roever","year":"1982","unstructured":"de Roever, W.-P., Gerth, R., Roncken, M.: Procedures and concurrency: A proof theoretical study. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 132\u2013163. Springer, Heidelberg (1982)"},{"key":"1_CR23","unstructured":"de Roever, W.-P., Pnueli, A.: Rendez-vous with ADA \u2013 a proof theoretic view. In: Proc. of ADA - TEC 1982 Conference on ADA (1982)"},{"key":"1_CR24","unstructured":"de Roever, W.-P., Gerth, R., Roncken, M.: A study in distributed systems and Dutch patriotism. In: Proceedings of the 2nd Conference on Foundations of Software Technology and Distributed Systems (December 1982)"},{"key":"1_CR25","unstructured":"de Roever, W.-P., Koymans, R., Vytopil, J.: A formal system for a telecommunication language: A case study in proofs about real-time programming and asynchronous message passing. In: Proceedings of the 2nd Conference on Principles of Distributed Computing (1983)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-12896-4_384","volume-title":"Logics of Programs","author":"W.-P. de Roever","year":"1984","unstructured":"de Roever, W.-P., Zwiers, J., de Bruin, A.: A proof system for partial correctness of dynamic networks of processes. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 513\u2013527. Springer, Heidelberg (1984)"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0167-6423(84)90018-2","volume":"4","author":"W.-P. de Roever","year":"1984","unstructured":"de Roever, W.-P., Gerth, R.: A proof system for concurrent ADA programs. Science of Computer Programming\u00a04, 159\u2013204 (1984)","journal-title":"Science of Computer Programming"},{"key":"1_CR28","volume-title":"Proceedings of the IFIP Working Conference on Role of Abstract Models in Computer Science","author":"W.-P. de Roever","year":"1985","unstructured":"de Roever, W.-P.: The quest for compositionality \u2013 a survey of assertionbased proof methods for concurrent programs, part 1: Concurrency based on shared variables. In: Neuhold, E.J. (ed.) Proceedings of the IFIP Working Conference on Role of Abstract Models in Computer Science. North-Holland, Amsterdam (1985)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-15648-8_14","volume-title":"Logics of Programs","author":"W.-P. de Roever","year":"1985","unstructured":"de Roever, W.-P., Koymans, R., Shyamasundar, R.K., Gerth, R., Arun-Kumar, S.: Compositional semantics for real-time distributed computing. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 167\u2013189. Springer, Heidelberg (1985)"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BFb0027044","volume-title":"Current Trends in Concurrency","author":"W.-P. de Roever","year":"1986","unstructured":"de Roever, W.-P., Hooman, J.: The quest goes on: a survey of proofsystems for partial correctness of CSP. In: Rozenberg, G., de Bakker, J.W., de Roever, W.-P. (eds.) Current Trends in Concurrency. LNCS, vol.\u00a0224, pp. 343\u2013395. Springer, Heidelberg (1986)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/BFb0015776","volume-title":"Automata, Languages and Programming","author":"W.-P. de Roever","year":"1985","unstructured":"de Roever, W.-P., Zwiers, J., van Emde Boas, P.: Compositionality and concurrent networks: Soundness and completeness of a proof system. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 509\u2013519. Springer, Heidelberg (1985)"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"de Roever, W.-P.: The cooperation test: A syntax-directed verification method. In: Logic and Models of Concurrent Systems, NATO Summerschool, Marktoberdorf, pp. 213\u2013257. NATO Advanced Study Institute (1984)","DOI":"10.1007\/978-3-642-82453-1_8"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-16047-7_50","volume-title":"The Analysis of Concurrent Systems","author":"W.-P. de Roever","year":"1985","unstructured":"de Roever, W.-P., Koymans, R.: Examples of a real-time temporal logic specification. In: Denvir, B.T., Jackson, M.I., Harwood, W.T., Wray, M.J. (eds.) The Analysis of Concurrent Systems. LNCS, vol.\u00a0207, pp. 231\u2013252. Springer, Heidelberg (1985)"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0167-6423(86)90026-2","volume":"6","author":"W.-P. de Roever","year":"1986","unstructured":"de Roever, W.-P., van Diepen, N.W.P.: Program derivation through transformations: The evolution of list-copying algorithms. Science of Computer Programming\u00a06, 213\u2013272 (1986)","journal-title":"Science of Computer Programming"},{"key":"1_CR35","unstructured":"de Roever, W.-P.: Process constructors and interpretations \u2013 response. In: IFIP Congress, pp. 515\u2013518 (1986)"},{"key":"1_CR36","unstructured":"de Roever, W.-P.: Questions to Robin Milner \u2013 A responder\u2019s commentary. Information Processing, 515\u2013518 (1986)"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"de Roever, W.-P., Gerth, R.: Proving monitors revisited: A first step towards verifying objectoriented systems. Fundamentae Informaticae IX, 371\u2013400 (1986)","DOI":"10.3233\/FI-1986-9402"},{"key":"1_CR38","first-page":"223","volume-title":"Fourteenth Annual Symposium on Principles of Programming Languages (POPL)","author":"W.-P. de Roever","year":"1987","unstructured":"de Roever, W.-P., Huizing, C., Gerth, R.: Full abstraction of a real-time denotational semantics for an OCCAM-like language. In: Fourteenth Annual Symposium on Principles of Programming Languages (POPL), Munich, Germany, pp. 223\u2013237. ACM, New York (1987)"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-51687-5_47","volume-title":"Distributed Algorithms","author":"W.-P. de Roever","year":"1989","unstructured":"de Roever, W.-P., Stomp, F.: Designing distributed algorithms by means of formal sequentially phased reasoning. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol.\u00a0392, pp. 242\u2013253. Springer, Heidelberg (1989)"},{"issue":"3","key":"1_CR40","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0890-5401(89)90004-7","volume":"82","author":"W.-P. de Roever","year":"1989","unstructured":"de Roever, W.-P., Stomp, F.A., Gerth, R.T.: The \u03bc-calculus as an assertion-language for fairness arguments. Information and Computation\u00a082(3), 278\u2013322 (1989)","journal-title":"Information and Computation"},{"key":"1_CR41","unstructured":"de Roever, W.-P., Stomp, F.: A correctness proof of a distributed minimum weight spanning tree algorithm. In: Proceedings of the 7th ICDCS (1987)"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BFb0026110","volume-title":"CAAP \u201988","author":"W.-P. de Roever","year":"1988","unstructured":"de Roever, W.-P., Huizing, C., Gerth, R.: Modeling statecharts behaviour in a fully abstract way. In: Dauchet, M., Nivat, M. (eds.) CAAP 1988. LNCS, vol.\u00a0299, pp. 271\u2013294. Springer, Heidelberg (1988)"},{"issue":"3","key":"1_CR43","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/0890-5401(88)90020-X","volume":"79","author":"W.-P. de Roever","year":"1988","unstructured":"de Roever, W.-P., Koymans, R., Shyamasundar, R.K., Gerth, R., Arun-Kumar, S.: Compositional semantics for real-time distributed computing. Information and Computation\u00a079(3), 210\u2013256 (1988)","journal-title":"Information and Computation"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-51803-7_34","volume-title":"Temporal Logic in Specification","author":"W.-P. de Roever","year":"1989","unstructured":"de Roever, W.-P., Zwiers, J.: Compositionality and modularity in process specification and design: A state based approach. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 351\u2013374. Springer, Heidelberg (1989)"},{"key":"1_CR45","first-page":"37","volume-title":"Protocol Specification, Testing and Verification, IX","author":"W.-P. de Roever","year":"1990","unstructured":"de Roever, W.-P., Hooman, J.: Design and verification in real-time distributed computing: An introduction to compositional methods. In: Protocol Specification, Testing and Verification, IX, pp. 37\u201356. North-Holland, Amsterdam (1990)"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"de Roever, W.-P., Zwiers, J.: Predicates are predicate transformers: Towards a uni ed theory of concurrency. In: Proc. of 8th Conference on Principles of Distributed Computing, pp. 265\u2013279 (1989)","DOI":"10.1145\/72981.73000"},{"key":"1_CR47","unstructured":"de Roever, W.-P., Barringer, H., Courcoubetis, C., Gabbay, D., Gerth, R., Jonsson, B., Pnueli, A., Reed, G.M., Sifakis, J., Vytopil, J., Wolper, P.: ESPRIT \u2013 Basic Research Action 3096 \u201cSPEC\u201d: Formal methods and tools for the development of distributed and real-time systems. Bulletin of the EATCS\u00a040 (February 1990)"},{"key":"1_CR48","first-page":"242","volume-title":"Semantics for Concurrency, Workshops in Computing","author":"W.-P. de Roever","year":"1990","unstructured":"de Roever, W.-P., Hooman, J., Ramesh, S.: A compositional axiomatisation of safety and liveness properties of Statecharts. In: Semantics for Concurrency, Workshops in Computing, Leicester, pp. 242\u2013261. Springer, Heidelberg (1990)"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(91)90190-S","volume":"37","author":"W.-P. de Roever","year":"1991","unstructured":"de Roever, W.-P., Huizing, C.: Introduction to the design choices in the semantics of Statecharts. Information Processing Letters\u00a037, 205\u2013213 (1991)","journal-title":"Information Processing Letters"},{"key":"1_CR50","first-page":"455","volume":"44","author":"W.-P. de Roever","year":"1991","unstructured":"de Roever, W.-P.: Foundations of computer science: Leaving the ivory tower. EATCS Bulletin\u00a044, 455\u2013492 (1991)","journal-title":"EATCS Bulletin"},{"key":"1_CR51","first-page":"91","volume-title":"Proceedings of the 4th Refinement Workshop, Workshops in Computing","author":"W.-P. de Roever","year":"1991","unstructured":"de Roever, W.-P., Coenen, J., Zwiers, J.: Assertional data reification proofs: Survey and perspective. In: Morris, J.M., Shaw, R.C. (eds.) Proceedings of the 4th Refinement Workshop, Workshops in Computing, pp. 91\u2013114. Springer, Heidelberg (1991)"},{"key":"1_CR52","unstructured":"de Roever, W.-P., Hooman, J.: An introduction to compositional methods for concurrency and their application to real-time. In: Hogrefe, D. (ed.) Formale Beschreibungstechniken f\u00fcr verteilte Systeme, GI-Fachgespr\u00e4ch. Springer, Heidelberg (1992); Also in the Proceedings in Engineering Sciences of the Indian Academy of Sciences 17, part I, 29\u201374"},{"issue":"2","key":"1_CR53","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(92)90053-I","volume":"101","author":"W.-P. de Roever","year":"1992","unstructured":"de Roever, W.-P., Hooman, J., Ramesh, S.: A compositional axiomatization of Statecharts. Theoretical Computer Science\u00a0101(2), 289\u2013335 (1992)","journal-title":"Theoretical Computer Science"},{"key":"1_CR54","series-title":"Workshops in Computing Series","volume-title":"Proc. 5th Refinement Workshop","author":"W.-P. de Roever","year":"1992","unstructured":"de Roever, W.-P., Cau, A., Kuiper, R.: Formalising Dijkstra\u2019s development strategy within Stark\u2019s formalism. In: Jones, Shaw, Denvir (eds.) Proc. 5th Refinement Workshop. Workshops in Computing Series, Springer, Heidelberg (1992)"},{"key":"1_CR55","unstructured":"de Roever, W.-P., Zwiers, J., Coenen, J.: A note on compositional refinement. In: Proceedings of the 5th Refinement Workshop, Workshops in Computing. Springer, Heidelberg (1992)"},{"key":"1_CR56","first-page":"134","volume-title":"Preprints Proceedings Symposium on Artificial intelligence in Real-Time Control","author":"W.-P. de Roever","year":"1992","unstructured":"de Roever, W.-P., Hooman, J.: The application of compositional proof methods to realtime. In: Preprints Proceedings Symposium on Artificial intelligence in Real-Time Control, pp. 134\u2013144. IEEE, Los Alamitos (1992)"},{"key":"1_CR57","series-title":"Lecture Notes in Computer Science","volume-title":"FME \u201993: Industrial-Strength Formal Methods","author":"W.-P. de Roever","year":"1993","unstructured":"de Roever, W.-P., Cau, A.: Using relative refinement for fault tolerance. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol.\u00a0670. Springer, Heidelberg (1993)"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","volume-title":"FME \u201993: Industrial-Strength Formal Methods","author":"W.-P. de Roever","year":"1993","unstructured":"de Roever, W.-P., Engelhardt, K.: Generalizing Abadi & Lamport\u2019s method to solve a problem posed by A. Pnueli. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol.\u00a0670. Springer, Heidelberg (1993)"},{"key":"1_CR59","first-page":"392","volume-title":"Proc. 23rd Symposium on Fault-Tolerant Computing","author":"W.-P. de Roever","year":"1993","unstructured":"de Roever, W.-P., Cau, A.: Specifying fault tolerance within Stark\u2019s formalism. In: Proc. 23rd Symposium on Fault-Tolerant Computing, pp. 392\u2013401. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"1_CR60","series-title":"BCS-FACS","first-page":"14","volume-title":"6th Refinement Workshop, Workshops in Computing","author":"W.-P. de Roever","year":"1994","unstructured":"de Roever, W.-P., Petersohn, C., Huizing, C., Peleska, J.: Formal semantics for Ward & Mellor\u2019s transformation schemas and their comparison with Statecharts. In: Till, D. (ed.) 6th Refinement Workshop, Workshops in Computing. BCS-FACS, pp. 14\u201341. Springer, Heidelberg (1994)"},{"issue":"6","key":"1_CR61","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/BF03259394","volume":"6","author":"W.-P. de Roever","year":"1994","unstructured":"de Roever, W.-P., Stomp, F.: A principle for sequentially phased reasoning about distributed algorithms. Formal Aspects of Computing\u00a06(6), 716\u2013737 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"1_CR62","series-title":"Lecture Notes in Computer Science","volume-title":"Dependable Computing - EDCC-1","author":"W.-P. de Roever","year":"1994","unstructured":"de Roever, W.-P., Petersohn, C., Huizing, C., Peleska, J.: Formal semantics for Ward & Mellor\u2019s transformation schemas and the specification of fault-tolerant systems. In: Echtle, K., Powell, D.R., Hammer, D. (eds.) EDCC 1994. LNCS, vol.\u00a0852, Springer, Heidelberg (1994)"},{"issue":"5","key":"1_CR63","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/BF01211632","volume":"7","author":"W.-P. de Roever","year":"1995","unstructured":"de Roever, W.-P., Engelhardt, K.: Towards a practitioners\u2019 approach to Abadi and Lamport\u2019s method. Formal Aspects of Computing\u00a07(5), 550\u2013566 (1995)","journal-title":"Formal Aspects of Computing"},{"key":"1_CR64","unstructured":"de Roever, W.-P., de Boer, F.S., Tej, H.: Compositionality in real-time shared variable concurrency (extended abstract). In: Proceedings of the 1995 Nordic Workshop on Programming Theory, G\u00f6teborg (1995)"},{"key":"1_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-60692-0_42","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"W.-P. de Roever","year":"1995","unstructured":"de Roever, W.-P., Zwiers, J., Hannemann, U., Lakhnech, Y.: Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 80\u201395. Springer, Heidelberg (1995)"},{"key":"1_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-61550-4_159","volume-title":"Mathematical Foundations of Computer Science 1996","author":"W.-P. de Roever","year":"1996","unstructured":"de Roever, W.-P., Engelhardt, K.: Simulation of specification statements in Hoare logic. In: Penczek, W., Sza\u0142as, A. (eds.) MFCS 1996. LNCS, vol.\u00a01113, pp. 324\u2013335. Springer, Heidelberg (1996)"},{"key":"1_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-61648-9_54","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"W.-P. de Roever","year":"1996","unstructured":"de Roever, W.-P., de Boer, F.S., Tej, H., van Hulst, M.: Compositionality in real-time shared variable concurrency. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol.\u00a01135, pp. 420\u2013439. Springer, Heidelberg (1996)"},{"key":"1_CR68","series-title":"Lecture Notes in Computer Science","first-page":"595","volume-title":"FME \u201996: Industrial Benefit and Advances in Formal Methods","author":"W.-P. de Roever","year":"1996","unstructured":"de Roever, W.-P., Zwiers, J., Hannemann, U., Lakhnech, Y., Stomp, F.: Modular completeness: Integrating the reuse of specified software in top-down program development . In: Gaudel, M.-C., Woodcock, J.C.P. (eds.) FME 1996. LNCS, vol.\u00a01051, pp. 595\u2013608. Springer, Heidelberg (1996)"},{"key":"1_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0025039","volume-title":"Computer Aided Systems Theory - EUROCAST \u201997","author":"W.-P. de Roever","year":"1997","unstructured":"de Roever, W.-P., Cau, A.: A dense-time temporal logic with nice compositionality properties. In: Moreno-D\u00edaz, R., Pichler, F. (eds.) EUROCAST 1997. LNCS, vol.\u00a01333, pp. 123\u2013145. Springer, Heidelberg (1997)"},{"issue":"2","key":"1_CR70","first-page":"149","volume":"9","author":"W.-P. de Roever","year":"1995","unstructured":"de Roever, W.-P., Xu, Q., He, J.: Rely-guarantee methods for verifying shared variable concurrent programs. Formal Aspects of Computing\u00a09(2), 149\u2013174 (1995)","journal-title":"Formal Aspects of Computing"},{"key":"1_CR71","first-page":"59","volume-title":"A dynamic and quick intellect, Paul Vit\u00e1nyi 25 years @ CWI","author":"W.-P. de Roever","year":"1996","unstructured":"de Roever, W.-P., Engelhardt, K.: New Wine $\\frac{e}{d}$ for old bags. In: Tromp, J. (ed.) A dynamic and quick intellect, Paul Vit\u00e1nyi 25 years @ CWI. November 1996, pp. 59\u201366. CWI, Amsterdam (1996)"},{"key":"1_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-63533-5_27","volume-title":"FME \u201997 Industrial Applications and Strengthened Foundations of Formal Methods","author":"W.-P. de Roever","year":"1997","unstructured":"de Roever, W.-P., de Boer, F.S., Hannemann, U.: A compositional proof system for shared-variable concurrency. In: Fitzgerald, J.S., Jones, C.B., Lucas, P. (eds.) FME 1997. LNCS, vol.\u00a01313, pp. 515\u2013532. Springer, Heidelberg (1997)"},{"key":"1_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0058036","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"W.-P. de Roever","year":"1997","unstructured":"de Roever, W.-P., de Boer, F.S., Hannemann, U.: Hoare-style compositional proof systems for reactive shared variable concurrency. In: Ramesh, S., Sivakumar, G. (eds.) FST TCS 1997. LNCS, vol.\u00a01346, p. 267. Springer, Heidelberg (1997)"},{"key":"1_CR74","unstructured":"de Roever, W.-P., K\u00fchne, L., Hooman, J.: Towards mechanical verification of parts of the IEEE P1394 serial bus. In: 2nd International Workshop on Applied Formal Methods in System Design, Zagreb, Croatia, June 1997, pp. 73\u201385 (1997)"},{"key":"1_CR75","unstructured":"de Roever, W.-P., Hannemann, U.: Concurrency verification: From non-compositional to compositional proof methods. In: Proc. of the 8th Nordic Workshop on Programming Theory 1996, Oslo (1997)"},{"issue":"2","key":"1_CR76","first-page":"125","volume":"13","author":"W.-P. de Roever","year":"1998","unstructured":"de Roever, W.-P., Petersohn, C., Huizing, C., Peleska, J.: Formal semantics for Ward & Mellor\u2019s transformation schemas and its application to fault-tolerant systems. International Journal of Computer Systems\u00a013(2), 125\u2013133 (1998)","journal-title":"International Journal of Computer Systems"},{"key":"1_CR77","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. de Roever","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":"1_CR78","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. de Boer","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\u2013647. Springer, Heidelberg (1998)"},{"key":"1_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-48340-3_31","volume-title":"Mathematical Foundations of Computer Science 1999","author":"F. de Boer","year":"1999","unstructured":"de Boer, F., Hannemann, U., de Roever, W.-P.: The semantic foundations of a compositional proof method for synchronously communicating processes. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 343\u2013353. Springer, Heidelberg (1999)"},{"key":"1_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/3-540-48118-4_16","volume-title":"FM\u201999 - Formal Methods","author":"F.S. de Boer","year":"1999","unstructured":"de Boer, F.S., Hannemann, U., de Roever, W.-P.: Formal justification of the rely-guarantee paradigm for shared-variable concurrency: A semantic approach. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol.\u00a01709, pp. 1245\u20131265. Springer, Heidelberg (1999)"},{"key":"1_CR81","unstructured":"de Roever, W.-P., de Boer, F.S., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Basic principles of a textbook on the compositional and noncompositional veri cation of concurrent programs. In: Grabowski, J., Heymer, S. (eds.) Formale Beschreibungstechniken f\u00fcr verteilte Systeme, 10. GI\/ITG-Fachgespr\u00e4ch, L\u00fcbeck, June 2000, pp. 3\u20135. Verlag Shaker (2000)"},{"key":"#cr-split#-1_CR82.1","doi-asserted-by":"crossref","unstructured":"\u00c1brah\u00e1m-Mumm, E., de Boer, F.S., de Roever, W.-P., Steffen, M.: Verification for java's reentrant multithreading concept. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 4-20. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45931-6_2"},{"key":"#cr-split#-1_CR82.2","unstructured":"A longer version, including the proofs for soundness and completeness, appeared as Technical Report TR-ST-02-1 (March 2002)"},{"key":"1_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-39910-0_13","volume-title":"Verification: Theory and Practice","author":"E. \u00c1brah\u00e1m","year":"2004","unstructured":"\u00c1brah\u00e1m, E., de Boer, F.S., de Roever, W.-P., Steffen, M.: A compositional operational semantics for Java MT . In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 290\u2013303. Springer, Heidelberg (2004)"},{"key":"1_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39656-7_1","volume-title":"Formal Methods for Components and Objects","author":"E. \u00c1brah\u00e1m","year":"2003","unstructured":"\u00c1brah\u00e1m, E., de Boer, F.S., de Roever, W.-P., Steffen, M.: A toolsupported proof system for monitors in Java. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 1\u201332. Springer, Heidelberg (2003)"},{"key":"#cr-split#-1_CR85.1","doi-asserted-by":"crossref","unstructured":"\u00c1brah\u00e1m, E., de Boer, F.S., de Roever, W.-P., Steffen, M.: Inductive proofoutlines for monitors in Java. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol.\u00a02884, pp. 155-169. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-39958-2_11"},{"key":"#cr-split#-1_CR85.2","unstructured":"A longer version appeared as technical report TR-ST-03-1 (April 2003)"},{"key":"1_CR86","series-title":"Lecture Notes in Computer Science","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"W.-P. de Roever","year":"2004","unstructured":"de Roever, W.-P., Boiten, E.: Getting to the bottom of relational refinement: Relations and correctness, partial and total. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051. Springer, Heidelberg (2004)"},{"key":"1_CR87","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"281","volume-title":"FSEN 2005: IPM International Workshop on Foundations of Software Engineering (Theory and Practice)","author":"W.-P. de Roever","year":"2005","unstructured":"de Roever, W.-P., \u00c1brah\u00e1m, E., de Boer, F.S., Steffen, M.: Inductive proof outlines for exceptions in multithreaded Java. In: Arbab, F., Sirjani, M. (eds.) FSEN 2005: IPM International Workshop on Foundations of Software Engineering (Theory and Practice). Electronic Notes in Theoretical Computer Science, vol.\u00a0159, pp. 281\u2013297. Elsevier Science Publishers, Amsterdam (2005)"},{"issue":"2","key":"1_CR88","first-page":"116","volume":"12","author":"W.-P. de Roever","year":"2005","unstructured":"de Roever, W.-P., Kyas, M., de Boer, F.S.: A compositional trace logic for behavioral interface specifications. Nordic Journal of Computing\u00a012(2), 116\u2013132 (2005)","journal-title":"Nordic Journal of Computing"},{"key":"1_CR89","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"281","volume-title":"SOS 2005","author":"W.-P. de Roever","year":"2006","unstructured":"de Roever, W.-P., Fecher, H., Kyas, M., de Boer, F.S.: Compositional operational semantics of a UML-kernel-model language. In: SOS 2005. Electronic Notes in Theoretical Computer Science, vol.\u00a0156, pp. 281\u2013297. Elsevier Science Publishers, Amsterdam (2006)"},{"key":"1_CR90","unstructured":"de Roever, W.-P.: A perspective on program verification. In: Proceedings of the IFIP Working Conference on Verified Software: Tools, Techniques, and Experiments, Z\u00fcrich, October 10-13 (2005)"},{"key":"1_CR91","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2004.09.019","volume":"331","author":"W.-P. de Roever","year":"2005","unstructured":"de Roever, W.-P., \u00c1brah\u00e1m, E., de Boer, F.S., Steffen, M.: An assertion-based proof system for multithreaded Java. Theoretical Computer Science\u00a0331, 251\u2013290 (2005)","journal-title":"Theoretical Computer Science"},{"key":"1_CR92","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11576280_5","volume-title":"Formal Methods and Software Engineering","author":"H. Fecher","year":"2005","unstructured":"Fecher, H., Sch\u00f6nborn, J., Kyas, M., de Roever, W.-P.: 29 new unclarities in the semantics of UML 2.0 state machines. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol.\u00a03785, pp. 52\u201365. Springer, Heidelberg (2005)"},{"key":"1_CR93","unstructured":"de Roever, W.-P., Sylla, M., Stomp, F.: Verifying parameterized refinement. In: Tenth IEEE International Conference on Engineering of Complex Computer Systems, Shanghai, China, June 16-20, pp. 313\u2013321 (2005)"},{"key":"#cr-split#-1_CR94.1","unstructured":"de Roever, W.-P., \u00c1brah\u00e1m, E., de Boer, F.S., Steffen, M.: A deductive proof system for multithreaded Java with exceptions. Fundamenta Informaticae\u00a082(4), 391-463 (2008)"},{"key":"#cr-split#-1_CR94.2","unstructured":"An extended version of the 2005 conference contribution to FSEN 2005 and a reworked and shortened version of the University of Kiel, Dept. of Computer Science technical report 0303"},{"key":"1_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-540-69149-5_50","volume-title":"Verified Software: Theories, Tools, Experiments","author":"W.-P. de Roever","year":"2008","unstructured":"de Roever, W.-P.: A perspective on program verification. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol.\u00a04171, pp. 470\u2013477. Springer, Heidelberg (2008)"},{"key":"1_CR96","series-title":"Lecture Notes in Computer Science","volume-title":"Current Trends in Concurrency","year":"1986","unstructured":"Rozenberg, G., de Bakker, J.W., de Roever, W.-P. (eds.): Current Trends in Concurrency. LNCS, vol.\u00a0224. Springer, Heidelberg (1986)"},{"key":"1_CR97","series-title":"Lecture Notes in Computer Science","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","year":"1989","unstructured":"de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354. Springer, Heidelberg (1989)"},{"key":"1_CR98","series-title":"Lecture Notes in Computer Science","volume-title":"Stepwise Refinement of Distributed Systems","year":"1990","unstructured":"de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): REX 1989. LNCS, vol.\u00a0430. Springer, Heidelberg (1990)"},{"key":"1_CR99","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Object-Oriented Languages","year":"1991","unstructured":"de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.): REX 1990. LNCS, vol.\u00a0489. Springer, Heidelberg (1991)"},{"key":"1_CR100","series-title":"Lecture Notes in Computer Science","volume-title":"Real-Time: Theory in Practice","year":"1992","unstructured":"Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.): REX 1991. LNCS, vol.\u00a0600. Springer, Heidelberg (1992)"},{"key":"1_CR101","series-title":"Lecture Notes in Computer Science","volume-title":"Semantics: Foundations and Applications","year":"1993","unstructured":"de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): REX 1992. LNCS, vol.\u00a0666. Springer, Heidelberg (1993)"},{"key":"1_CR102","series-title":"Lecture Notes in Computer Science","volume-title":"A Decade of Concurrency","year":"1994","unstructured":"de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): REX 1993. LNCS, vol.\u00a0803. Springer, Heidelberg (1994)"},{"key":"1_CR103","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","year":"1994","unstructured":"Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.): FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863. Springer, Heidelberg (1994)"},{"key":"1_CR104","series-title":"International Federation for Information Processing (IFIP)","volume-title":"Programming Concepts and Methods (PROCOMET 1998)","year":"1998","unstructured":"de Roever, W.-P., Gries, D. (eds.): Programming Concepts and Methods (PROCOMET 1998). International Federation for Information Processing (IFIP). Chapman & Hall, Boca Raton (1998)"},{"key":"1_CR105","series-title":"Lecture Notes in Computer Science","volume-title":"Compositionality: The Significant Difference","year":"1998","unstructured":"de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.): COMPOS 1997. LNCS, vol.\u00a01536. Springer, Heidelberg (1998)"},{"key":"1_CR106","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2003","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2002. LNCS, vol.\u00a02852. Springer, Heidelberg (2003)"},{"key":"1_CR107","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2004","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2003. LNCS, vol.\u00a03188. Springer, Heidelberg (2004)"},{"key":"1_CR108","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2005","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2004. LNCS, vol.\u00a03657. Springer, Heidelberg (2005)"},{"key":"1_CR109","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2006","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2005. LNCS, vol.\u00a04111. Springer, Heidelberg (2006)"},{"key":"1_CR110","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2007","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2006. LNCS, vol.\u00a04709. Springer, Heidelberg (2007)"},{"key":"1_CR111","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2008","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2007. LNCS, vol.\u00a05382. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Compositionality, and Correctness"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11512-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T09:23:18Z","timestamp":1739870598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11512-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642115110","9783642115127"],"references-count":115,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11512-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}