Cantitate/Preț
Produs

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 Woodcock
en Limba Engleză Paperback – 11 aug 2010

Din seria Lecture Notes in Computer Science

Preț: 32671 lei

Preț vechi: 40839 lei
-20% Nou

Puncte Express: 490

Preț estimativ în valută:
6253 6596$ 5211£

Carte disponibilă

Livrare economică 12-26 decembrie

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

Public țintă

Professional/practitioner

Cuprins

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