Theoretical Aspects of Computing: 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6255
Editat de Ana Cavalcanti, David Deharbe, Marie-Claude Gaudel, Jim Woodcocken Limba Engleză Paperback – 11 aug 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.37 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 390.69 lei - 20%
Preț: 527.36 lei - 15%
Preț: 388.50 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 389.72 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.14 lei - 20%
Preț: 391.20 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.77 lei - 20%
Preț: 392.64 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 639.72 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 5%
Preț: 516.27 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.77 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 326.55 lei
Preț vechi: 408.19 lei
-20% Nou
Puncte Express: 490
Preț estimativ în valută:
57.79€ • 67.54$ • 50.17£
57.79€ • 67.54$ • 50.17£
Carte disponibilă
Livrare economică 27 ianuarie-10 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642148071
ISBN-10: 3642148077
Pagini: 397
Ilustrații: XIII, 397 p. 60 illus.
Greutate: 0.61 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642148077
Pagini: 397
Ilustrații: XIII, 397 p. 60 illus.
Greutate: 0.61 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
Invited Papers and Abstract.- Invariants and Well-Foundedness in Program Algebra.- A Theory of Software Product Line Refinement.- The TLA?+? Proof System: Building a Heterogeneous Verification Platform.- Grammars.- Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules.- Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution.- Tracking Down the Origins of Ambiguity in Context-Free Grammars.- Semantics.- Prioritized slotted-Circus.- A Denotational Semantical Model for Orc Language.- An Extended cCSP with Stable Failures Semantics.- Preference and Non-deterministic Choice.- Modelling.- Material Flow Abstraction of Manufacturing Systems.- Specification and Verification of a MPI Implementation for a MP-SoC.- Special Track: Formal Aspects of Software Testing and Grand Challenge in Verified Software.- Testing of Abstract Components.- Scalable Distributed Concolic Testing: A Case Study on a Flash Storage Platform.- Analyzing a Formal Specification of Mondex Using Model Checking.- Formal Modelling of Separation Kernel Components.- Mechanized Verification with Sharing.- Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking.- Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software Requirements.- Logics.- Complete Calculi for Structured Specifications in Fork Algebra.- Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical Setting.- Characterizing Locality (Encapsulation) with Bisimulation.- Justification Logic and History Based Computation.- Algorithms and Types.- A Class of Greedy Algorithms and Its Relation to Greedoids.- On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types.- A Modality for Safe Resource Sharing andCode Reentrancy.
Caracteristici
Up to date results Fast conference prceedings State-of-the-art report