Concurrency, Compositionality, and Correctness  Essays in Honor of Willem-Paul de Roever /  [electronic resource] : 
edited by Dennis Dams, Ulrich Hannemann, Martin Steffen. 
 - 1st ed. 2010. 
 - 377 p. 94 illus.  online resource. 
 - Theoretical Computer Science and General Issues,  5930  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  5930 .
<br/><br/>A Bibliography of Willem-Paul de Roever -- Playing Savitch and Cooking Games -- Compositionality: Ontology and Mereology of Domains -- Computer Science and State Machines -- A Small Step for Mankind -- On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention -- Explicit Fair Scheduling for Dynamic Control -- Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence -- Reasoning about Recursive Processes in Shared-Variable Concurrency -- Formal Semantics of a VDM Extension for Distributed Embedded Systems -- A Proof System for a PGAS Language -- Concurrent Objects à la Carte -- On the Power of Play-Out for Scenario-Based Programs -- Proving the Refuted: Symbolic Model Checkers as Proof Generators -- Meanings of Model Checking -- Smaller Abstractions for ?CTL* without Next -- Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experiment -- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules -- Automated Proofs for Asymmetric Encryption -- Counterexample Guided Path Reduction for Static Program Analysis. 
<br/><br/> 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. 
<br/><br/><label>ISBN: </label>9783642115127 
<br/><br/><label>Standard No.: </label>10.1007/978-3-642-11512-7  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Software engineering.<br/>Compilers (Computer programs).<br/>User interfaces (Computer systems).<br/>Human-computer interaction.<br/>Computer science.<br/>Machine theory.<br/>Software Engineering.<br/>Compilers and Interpreters.<br/>User Interfaces and Human Computer Interaction.<br/>Computer Science Logic and Foundations of Programming.<br/>Theory of Computation.<br/>Formal Languages and Automata Theory.
<br/><br/><label>LC Class. No.: </label>QA76.758 
<br/><br/><label>Dewey Class. No.: </label>005.1