Compositionality: The Significant Difference
Editat de Willem-Paul De Roever, Hans Langmaack, Amir Pnuelien Limba Engleză Paperback – 18 dec 1998
Preț: 640.54 lei
Preț vechi: 800.68 lei
-20% Nou
Puncte Express: 961
Preț estimativ în valută:
113.35€ • 132.91$ • 99.54£
113.35€ • 132.91$ • 99.54£
Carte tipărită la comandă
Livrare economică 04-18 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540654933
ISBN-10: 3540654933
Pagini: 664
Ilustrații: VIII, 647 p.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.99 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540654933
Pagini: 664
Ilustrații: VIII, 647 p.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.99 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
The Need for Compositional Proof Systems: A Survey.- Alternating-time Temporal Logic.- Compositionality in dataflow synchronous languages: specification & code generation.- Compositional Reasoning in Model Checking.- Modeling Urgency in Timed Systems.- Compositional Refinement of Interactive Systems Modelled by Relations.- Toward Parametric Verification of Open Distributed Systems.- A Compositional Real-time Semantics of STATEMATE Designs.- Deductive Verification of Modular Systems.- Compositional Verification of Real-Time Applications.- Compositional Proofs for Concurrent Objects.- An overview of compositional translations.- Compositional Verification of Multi-Agent Systems: a Formal Analysis of Pro-activeness and Reactiveness.- Modular Model Checking.- Composition: A Way to Make Proofs Harder.- Compositionality Criteria for Defining Mixed-Styles Synchronous Languages.- Compositional Reasoning using Interval Temporal Logic and Tempura.- Decomposing Real-Time Specifications.- On the Combination of Synchronous Languages.- Compositional Verification of Randomized Distributed Algorithms.- Lazy Compositional Verication.- Compositional Reasoning Using the Assumption-Commitment Paradigm.- An Adequate First Order Interval Logic.- Compositional Transformational Design for Concurrent Programs.- Compositional proof methods for concurrency: A semantic approach.
Caracteristici
Includes supplementary material: sn.pub/extras