Concurrency, Compositionality, and Correctness: Essays in Honor of Willem-Paul de Roever

Description

This Festschrift volume, published in honor of Willem-Paul de Roever, contains 19 detailed papers written by the friends and colleagues of the honoree, all eminent scientists in their own right. These are preceded by a detailed bibliography and rounded off, at the end of the book, with a gallery of photographs. The theme under which the papers have been collected is Concurrency, Compositionality, and Correctness, reflecting the focus of Willem-Paul de Roever's research career. Topics addressed include model checking, computer science and state machines, ontology and mereology of domains, game theory, compiler correctness, fair scheduling and encryption algorithms. Content: Front Matter....Pages - A Bibliography of Willem-Paul de Roever....Pages 1-9 Playing Savitch and Cooking Games....Pages 10-21 Compositionality: Ontology and Mereology of Domains....Pages 22-59 Computer Science and State Machines....Pages 60-65 A Small Step for Mankind....Pages 66-73 On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention....Pages 74-95 Explicit Fair Scheduling for Dynamic Control....Pages 96-117 Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence....Pages 118-126 Reasoning about Recursive Processes in Shared-Variable Concurrency....Pages 127-141 Formal Semantics of a VDM Extension for Distributed Embedded Systems....Pages 142-161 A Proof System for a PGAS Language....Pages 162-184 Concurrent Objects � la Carte....Pages 185-206 On the Power of Play-Out for Scenario-Based Programs....Pages 207-220 Proving the Refuted: Symbolic Model Checkers as Proof Generators....Pages 221-236 Meanings of Model Checking....Pages 237-249 Smaller Abstractions for ∀CTL* without Next....Pages 250-259 Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experiment....Pages 260-276 Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules....Pages 277-299 Automated Proofs for Asymmetric Encryption....Pages 300-321 Counterexample Guided Path Reduction for Static Program Analysis....Pages 322-341 Back Matter....Pages -