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

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Dams, Dennis (Editor ), Hannemann, Ulrich (Editor ), Steffen, Martin (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Theoretical Computer Science and General Issues, 5930
Temas:
Software engineering.
Compilers (Computer programs).
User interfaces (Computer systems).
Human-computer interaction.
Computer science.
Machine theory.
Software Engineering.
Compilers and Interpreters.
User Interfaces and Human Computer Interaction.
Computer Science Logic and Foundations of Programming.
Theory of Computation.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares