Skip to main content
Springer Nature Link
Log in

A Bibliography of Willem-Paul de Roever

  • Chapter
Concurrency, Compositionality, and Correctness

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5930))

  • 498 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge Tracts in Theoretical Computer Science, vol. 47. Cambridge University Press, Cambridge (1998); With the assistance of Jos Coenen, Karl-Heinz Buth, Paul Gardiner, Yassine Lakhnech, and Frank Stomp

    Book  MATH  Google Scholar 

  2. 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. 54. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  3. de Roever, W.-P., de Bakker, J.W.: A calculus for recursive program schemes. In: Automata, Languages and Programming (ICALP), pp. 167–196. North-Holland, Amsterdam (1972)

    Google Scholar 

  4. de Roever., W.-P.: A formalization of various parameter mechanisms as products of relations within a calculus of recursive program schemes. Séminaires IRIA, Théorie des algorithmes etc. (1972)

    Google Scholar 

  5. 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

    Google Scholar 

  6. de Roever, W.-P.: A correctness proof of the Schorr–Waite marking algorithm for binary trees. Mathematical Centre Syllabus 21 (1975)

    Google Scholar 

  7. 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

    Google Scholar 

  8. de Roever, W.-P.: Recursion and parameter mechanisms: An axiomatic approach. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14. Springer, Heidelberg (1974)

    Google Scholar 

  9. de Roever, W.-P.: Call–by–name versus call–by–value: A proof–theoretic comparison. In: Blikle, A. (ed.) MFCS 1974. LNCS, vol. 28, pp. 451–463. Springer, Heidelberg (1975)

    Chapter  Google Scholar 

  10. de Roever, W.-P.: First–order reduction of call–by–name to call–by–value. In: Becvar, J. (ed.) MFCS 1975. LNCS, vol. 32, pp. 377–398. Springer, Heidelberg (1975)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. de Roever, W.-P.: Dijkstra’s predicate transformer, non–determinism, recursion and termination. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 472–481. Springer, Heidelberg (1976)

    Chapter  Google Scholar 

  13. de Roever, W.-P.: On backtracking and greatest fixedpoints . In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 52, pp. 412–429. Springer, Heidelberg (1977)

    Chapter  Google Scholar 

  14. 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. 64, pp. 191–200. Springer, Heidelberg (1978)

    Chapter  Google Scholar 

  15. de Roever, W.-P., Francez, N., Hoare, C.A.R., Lehmann, D.: Semantics of nondeterminism, concurrency, and communication. Journal of Computer and System Sciences 19(3), 290–308 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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–67. ACM, New York (1979)

    Google Scholar 

  17. de Roever, W.-P., Apt, K.R., Francez, N.: A proof system for communicating sequential processes. ACM Transactions on Programming Languages and Systems 2, 359–385 (1980)

    Article  MATH  Google Scholar 

  18. de Roever, W.-P., Roncken, M., Gerth, R.: A proof system for Brinch Hansen’s distributed processes (extended abstract). In: Proceedings of the GI 1981, München, Informatik Fachberichte, pp. 88–95. Springer, Heidelberg (1981)

    Google Scholar 

  19. de Roever, W.-P.: A formalism for reasoning about fair termination. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 113–121. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  20. 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); In revised form in: Information and Control 66(1/2), 83–102 (1985)

    Google Scholar 

  21. de Roever, W.-P., Kuiper, R.: Fairness assumption for CSP in a temporal logic framework. In: Bjørner, D. (ed.) Proc. of the IFIP Working Conference on Formal Description of Programming Concepts II, Garmisch-Partenkirchen, June 1-4. North-Holland, Amsterdam (1982)

    Google Scholar 

  22. 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. 137, pp. 132–163. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  23. de Roever, W.-P., Pnueli, A.: Rendez-vous with ADA – a proof theoretic view. In: Proc. of ADA - TEC 1982 Conference on ADA (1982)

    Google Scholar 

  24. 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)

    Google Scholar 

  25. 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)

    Google Scholar 

  26. 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. 164, pp. 513–527. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  27. de Roever, W.-P., Gerth, R.: A proof system for concurrent ADA programs. Science of Computer Programming 4, 159–204 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  28. de Roever, W.-P.: The quest for compositionality – 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)

    Google Scholar 

  29. 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. 193, pp. 167–189. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  30. 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. 224, pp. 343–395. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  31. 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. 194, pp. 509–519. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  32. de Roever, W.-P.: The cooperation test: A syntax-directed verification method. In: Logic and Models of Concurrent Systems, NATO Summerschool, Marktoberdorf, pp. 213–257. NATO Advanced Study Institute (1984)

    Google Scholar 

  33. 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. 207, pp. 231–252. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  34. de Roever, W.-P., van Diepen, N.W.P.: Program derivation through transformations: The evolution of list-copying algorithms. Science of Computer Programming 6, 213–272 (1986)

    Article  MATH  Google Scholar 

  35. de Roever, W.-P.: Process constructors and interpretations – response. In: IFIP Congress, pp. 515–518 (1986)

    Google Scholar 

  36. de Roever, W.-P.: Questions to Robin Milner – A responder’s commentary. Information Processing, 515–518 (1986)

    Google Scholar 

  37. de Roever, W.-P., Gerth, R.: Proving monitors revisited: A first step towards verifying objectoriented systems. Fundamentae Informaticae IX, 371–400 (1986)

    Google Scholar 

  38. 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–237. ACM, New York (1987)

    Google Scholar 

  39. 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. 392, pp. 242–253. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  40. de Roever, W.-P., Stomp, F.A., Gerth, R.T.: The μ-calculus as an assertion-language for fairness arguments. Information and Computation 82(3), 278–322 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  41. de Roever, W.-P., Stomp, F.: A correctness proof of a distributed minimum weight spanning tree algorithm. In: Proceedings of the 7th ICDCS (1987)

    Google Scholar 

  42. 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. 299, pp. 271–294. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  43. de Roever, W.-P., Koymans, R., Shyamasundar, R.K., Gerth, R., Arun-Kumar, S.: Compositional semantics for real-time distributed computing. Information and Computation 79(3), 210–256 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  44. 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. 398, pp. 351–374. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  45. 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–56. North-Holland, Amsterdam (1990)

    Google Scholar 

  46. 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–279 (1989)

    Google Scholar 

  47. 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 – Basic Research Action 3096 “SPEC”: Formal methods and tools for the development of distributed and real-time systems. Bulletin of the EATCS 40 (February 1990)

    Google Scholar 

  48. 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–261. Springer, Heidelberg (1990)

    Google Scholar 

  49. de Roever, W.-P., Huizing, C.: Introduction to the design choices in the semantics of Statecharts. Information Processing Letters 37, 205–213 (1991)

    Article  MATH  Google Scholar 

  50. de Roever, W.-P.: Foundations of computer science: Leaving the ivory tower. EATCS Bulletin 44, 455–492 (1991)

    Google Scholar 

  51. 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–114. Springer, Heidelberg (1991)

    Google Scholar 

  52. 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ür verteilte Systeme, GI-Fachgespräch. Springer, Heidelberg (1992); Also in the Proceedings in Engineering Sciences of the Indian Academy of Sciences 17, part I, 29–74

    Google Scholar 

  53. de Roever, W.-P., Hooman, J., Ramesh, S.: A compositional axiomatization of Statecharts. Theoretical Computer Science 101(2), 289–335 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  54. de Roever, W.-P., Cau, A., Kuiper, R.: Formalising Dijkstra’s development strategy within Stark’s formalism. In: Jones, Shaw, Denvir (eds.) Proc. 5th Refinement Workshop. Workshops in Computing Series, Springer, Heidelberg (1992)

    Google Scholar 

  55. 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)

    Google Scholar 

  56. 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–144. IEEE, Los Alamitos (1992)

    Google Scholar 

  57. 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. 670. Springer, Heidelberg (1993)

    Google Scholar 

  58. de Roever, W.-P., Engelhardt, K.: Generalizing Abadi & Lamport’s method to solve a problem posed by A. Pnueli. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol. 670. Springer, Heidelberg (1993)

    Google Scholar 

  59. de Roever, W.-P., Cau, A.: Specifying fault tolerance within Stark’s formalism. In: Proc. 23rd Symposium on Fault-Tolerant Computing, pp. 392–401. IEEE Computer Society Press, Los Alamitos (1993)

    Google Scholar 

  60. de Roever, W.-P., Petersohn, C., Huizing, C., Peleska, J.: Formal semantics for Ward & Mellor’s transformation schemas and their comparison with Statecharts. In: Till, D. (ed.) 6th Refinement Workshop, Workshops in Computing. BCS-FACS, pp. 14–41. Springer, Heidelberg (1994)

    Google Scholar 

  61. de Roever, W.-P., Stomp, F.: A principle for sequentially phased reasoning about distributed algorithms. Formal Aspects of Computing 6(6), 716–737 (1994)

    Article  MATH  Google Scholar 

  62. de Roever, W.-P., Petersohn, C., Huizing, C., Peleska, J.: Formal semantics for Ward & Mellor’s transformation schemas and the specification of fault-tolerant systems. In: Echtle, K., Powell, D.R., Hammer, D. (eds.) EDCC 1994. LNCS, vol. 852, Springer, Heidelberg (1994)

    Google Scholar 

  63. de Roever, W.-P., Engelhardt, K.: Towards a practitioners’ approach to Abadi and Lamport’s method. Formal Aspects of Computing 7(5), 550–566 (1995)

    Article  Google Scholar 

  64. 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öteborg (1995)

    Google Scholar 

  65. 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. 1026, pp. 80–95. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  66. de Roever, W.-P., Engelhardt, K.: Simulation of specification statements in Hoare logic. In: Penczek, W., Szałas, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 324–335. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  67. 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. 1135, pp. 420–439. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  68. 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. 1051, pp. 595–608. Springer, Heidelberg (1996)

    Google Scholar 

  69. de Roever, W.-P., Cau, A.: A dense-time temporal logic with nice compositionality properties. In: Moreno-Díaz, R., Pichler, F. (eds.) EUROCAST 1997. LNCS, vol. 1333, pp. 123–145. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  70. de Roever, W.-P., Xu, Q., He, J.: Rely-guarantee methods for verifying shared variable concurrent programs. Formal Aspects of Computing 9(2), 149–174 (1995)

    MATH  Google Scholar 

  71. 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ányi 25 years @ CWI. November 1996, pp. 59–66. CWI, Amsterdam (1996)

    Google Scholar 

  72. 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. 1313, pp. 515–532. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  73. 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. 1346, p. 267. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  74. de Roever, W.-P., Kühne, 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–85 (1997)

    Google Scholar 

  75. 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)

    Google Scholar 

  76. de Roever, W.-P., Petersohn, C., Huizing, C., Peleska, J.: Formal semantics for Ward & Mellor’s transformation schemas and its application to fault-tolerant systems. International Journal of Computer Systems 13(2), 125–133 (1998)

    Google Scholar 

  77. 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. 1536, pp. 1–22. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  78. 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. 1536, pp. 632–647. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  79. de Boer, F., Hannemann, U., de Roever, W.-P.: The semantic foundations of a compositional proof method for synchronously communicating processes. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 343–353. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  80. 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. 1709, pp. 1245–1265. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  81. 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ür verteilte Systeme, 10. GI/ITG-Fachgespräch, Lübeck, June 2000, pp. 3–5. Verlag Shaker (2000)

    Google Scholar 

  82. Ábrahám-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. 2303, pp. 4–20. Springer, Heidelberg (2002); A longer version, including the proofs for soundness and completeness, appeared as Technical Report TR-ST-02-1 (March 2002)

    Google Scholar 

  83. Ábrahám, 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. 2772, pp. 290–303. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  84. Ábrahám, 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. 2852, pp. 1–32. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  85. Ábrahám, 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. 2884, pp. 155–169. Springer, Heidelberg (2003); A longer version appeared as technical report TR-ST-03-1 (April 2003)

    Google Scholar 

  86. de Roever, W.-P., Boiten, E.: Getting to the bottom of relational refinement: Relations and correctness, partial and total. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol. 3051. Springer, Heidelberg (2004)

    Google Scholar 

  87. de Roever, W.-P., Ábrahám, 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. 159, pp. 281–297. Elsevier Science Publishers, Amsterdam (2005)

    Google Scholar 

  88. de Roever, W.-P., Kyas, M., de Boer, F.S.: A compositional trace logic for behavioral interface specifications. Nordic Journal of Computing 12(2), 116–132 (2005)

    MathSciNet  MATH  Google Scholar 

  89. 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. 156, pp. 281–297. Elsevier Science Publishers, Amsterdam (2006)

    Google Scholar 

  90. de Roever, W.-P.: A perspective on program verification. In: Proceedings of the IFIP Working Conference on Verified Software: Tools, Techniques, and Experiments, Zürich, October 10-13 (2005)

    Google Scholar 

  91. de Roever, W.-P., Ábrahám, E., de Boer, F.S., Steffen, M.: An assertion-based proof system for multithreaded Java. Theoretical Computer Science 331, 251–290 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  92. Fecher, H., Schönborn, 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. 3785, pp. 52–65. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  93. 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–321 (2005)

    Google Scholar 

  94. de Roever, W.-P., Ábrahám, E., de Boer, F.S., Steffen, M.: A deductive proof system for multithreaded Java with exceptions. Fundamenta Informaticae 82(4), 391–463 (2008); 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

    Google Scholar 

  95. de Roever, W.-P.: A perspective on program verification. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol. 4171, pp. 470–477. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  96. Rozenberg, G., de Bakker, J.W., de Roever, W.-P. (eds.): Current Trends in Concurrency. LNCS, vol. 224. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  97. 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. 354. Springer, Heidelberg (1989)

    Google Scholar 

  98. de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): REX 1989. LNCS, vol. 430. Springer, Heidelberg (1990)

    Google Scholar 

  99. de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.): REX 1990. LNCS, vol. 489. Springer, Heidelberg (1991)

    Google Scholar 

  100. Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.): REX 1991. LNCS, vol. 600. Springer, Heidelberg (1992)

    Google Scholar 

  101. de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): REX 1992. LNCS, vol. 666. Springer, Heidelberg (1993)

    Google Scholar 

  102. de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): REX 1993. LNCS, vol. 803. Springer, Heidelberg (1994)

    Google Scholar 

  103. Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.): FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863. Springer, Heidelberg (1994)

    Google Scholar 

  104. de Roever, W.-P., Gries, D. (eds.): Programming Concepts and Methods (PROCOMET 1998). International Federation for Information Processing (IFIP). Chapman & Hall, Boca Raton (1998)

    Google Scholar 

  105. de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.): COMPOS 1997. LNCS, vol. 1536. Springer, Heidelberg (1998)

    Google Scholar 

  106. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2002. LNCS, vol. 2852. Springer, Heidelberg (2003)

    Google Scholar 

  107. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2003. LNCS, vol. 3188. Springer, Heidelberg (2004)

    Google Scholar 

  108. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2004. LNCS, vol. 3657. Springer, Heidelberg (2005)

    Google Scholar 

  109. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2005. LNCS, vol. 4111. Springer, Heidelberg (2006)

    Google Scholar 

  110. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2006. LNCS, vol. 4709. Springer, Heidelberg (2007)

    Google Scholar 

  111. de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2007. LNCS, vol. 5382. Springer, Heidelberg (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ, 07974, USA

    Dennis Dams

  2. Computer Science Department, University of Bremen, P.O. Box 330440, 28334, Bremen, Germany

    Ulrich Hannemann

  3. Faculty of Mathematics and Natural Sciences Department of Computer Science, University of Oslo, P.O. Box 1080, Blindern, Oslo, 0316, Norway

    Martin Steffen

Authors
  1. Dennis Dams
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulrich Hannemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Steffen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Bell Laboratories, 600 Mountain Ave., 07974, Murray Hill, NJ, USA

    Dennis Dams

  2. Computer Science Department, University of Bremen, P.O. Box 330440, 28334, Bremen, Germany

    Ulrich Hannemann

  3. Faculty of Mathematics and Natural Sciences, Department of Computer Science, University of Oslo, P.O. Box 1080, 0316, Blindern, Oslo, Norway

    Martin Steffen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dams, D., Hannemann, U., Steffen, M. (2010). A Bibliography of Willem-Paul de Roever. In: Dams, D., Hannemann, U., Steffen, M. (eds) Concurrency, Compositionality, and Correctness. Lecture Notes in Computer Science, vol 5930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11512-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11512-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11511-0

  • Online ISBN: 978-3-642-11512-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics