Concurrency, Compositionality, and Correctness

1. Front Matter

   PDF

2. A Bibliography of Willem-Paul de Roever

   • Dennis Dams, Ulrich Hannemann, Martin Steffen

   Pages 1-9

3. Playing Savitch and Cooking Games

   • Peter van Emde Boas

   Pages 10-21

4. Compositionality: Ontology and Mereology of Domains

   • Dines Bjørner, Asger Eir

   Pages 22-59

5. Computer Science and State Machines

   • Leslie Lamport

   Pages 60-65

6. A Small Step for Mankind

   • Cornelis Huizing, Ron Koymans, Ruurd Kuiper

   Pages 66-73

7. On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention

   • Hans Langmaack

   Pages 74-95

8. Explicit Fair Scheduling for Dynamic Control

   • Ernst-Rüdiger Olderog, Andreas Podelski

   Pages 96-117

9. Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence

   • Manfred Broy

   Pages 118-126

10. Reasoning about Recursive Processes in Shared-Variable Concurrency

    • F. S. de Boer

    Pages 127-141

11. Formal Semantics of a VDM Extension for Distributed Embedded Systems

    • Jozef Hooman, Marcel Verhoef

    Pages 142-161

12. A Proof System for a PGAS Language

    • Shivali Agarwal, R. K. Shyamasundar

    Pages 162-184

13. Concurrent Objects à la Carte

    • Dave Clarke, Einar Broch Johnsen, Olaf Owe

    Pages 185-206

14. On the Power of Play-Out for Scenario-Based Programs

    • David Harel, Amir Kantor, Shahar Maoz

    Pages 207-220

15. Proving the Refuted: Symbolic Model Checkers as Proof Generators

    • Ittai Balaban, Amir Pnueli, Lenore D. Zuck

    Pages 221-236

16. Meanings of Model Checking

    • E. Allen Emerson

    Pages 237-249

17. Smaller Abstractions for ∀CTL* without Next

    • Kai Engelhardt, Ralf Huuck

    Pages 250-259

18. Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experiment

    • Prasad Joshi, Peter A. Beerel, Marly Roncken, Ivan Sutherland

    Pages 260-276

19. Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules

    • Jan Peleska

    Pages 277-299

20. Automated Proofs for Asymmetric Encryption

    • Joudicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech

    Pages 300-321

Why would you read this preface? As we start thinking what to write here, we wonder who is going to read these words. Fromourperspective–thatofwritersaddressinganaudienceofreaders–you are most likely Willem-Paul de Roever. Willem: our main motivation in putting together this Festschrift is to honor you on the occasion of your retirement. In terms of scienti?c ancestry, you are a father to two of us, and a grandfather to 1 the third , and you have had a profound impact on our formation as computer scientists.Atthepersonallevel,weknowyouasakind-hearted,generousperson. We are grateful to know you in these ways, and hope to have encounters with you in many years to come. AnotherlikelypossibilityisthatyouareCorinneorJojanneke,wifeordau- ter of Willem; the two strong pillars on which so much in his life is founded. You share the honor,respect, and love that went into the writing, as will be ackno- edged by those contributing authors that know you – which are almost all. Also, we would like to thank you for your help in sending us photographs for inclusion in this book, and for your encouragement. The next option is that you are one of the contributing authors. In this case you may wonder why it took us so long to get this work published. After all, wasn’tit“almostdone”alreadyattheretirementeventinJuly2008?Theanswer is twofold: we gave everyone ample time to revise their submissions in line with the recommendations by the referees; and we ourselves took ample time to put everything together. Our hope is that this will be visible in the quality of the ?nal result.

• GasP circuits
• algorithms
• alternative definitions
• automated proofs
• bisimulation
• co-simulation
• complexity
• distributed systems
• embedded systems
• formal semantics
• model checking
• modeling
• parallelization
• proof systems
• scheduling

• Bell Laboratories, Murray Hill, USA

  Dennis Dams

• Computer Science Department, University of Bremen, Bremen, Germany

  Ulrich Hannemann

• Faculty of Mathematics and Natural Sciences, Department of Computer Science, University of Oslo, Blindern, Oslo, Norway

  Martin Steffen

Policies and ethics