Tools and Algorithms for the Construction and Analysis of Systems: 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings: Lecture Notes in Computer Science, cartea 3920
Editat de Holger Hermanns, Jens Palsbergen Limba Engleză Paperback – 15 mar 2006
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 330.68 lei
Preț vechi: 413.35 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
58.51€ • 68.78$ • 51.24£
58.51€ • 68.78$ • 51.24£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540330561
ISBN-10: 3540330569
Pagini: 526
Ilustrații: XVI, 512 p.
Dimensiuni: 152 x 229 x 32 mm
Greutate: 0.73 kg
Ediția:2006
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: 3540330569
Pagini: 526
Ilustrații: XVI, 512 p.
Dimensiuni: 152 x 229 x 32 mm
Greutate: 0.73 kg
Ediția:2006
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ă
ResearchCuprins
Invited Contributions.- Weighted Pushdown Systems and Trust-Management Systems.- Parametrization and Slicing.- Automatic Verification of Parameterized Data Structures.- Parameterized Verification of ?-Calculus Systems.- Easy Parameterized Verification of Biphase Mark and 8N1 Protocols.- Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs.- Symbolic Techniques.- New Metrics for Static Variable Ordering in Decision Diagrams.- Widening ROBDDs with Prime Implicants.- Efficient Guided Symbolic Reachability Using Reachability Expressions.- Satisfiability.- SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver.- SAT-Based Software Certification.- Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants.- Exploration of the Capabilities of Constraint Programming for Software Verification.- Abstraction.- Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems.- Why Waste a Perfectly Good Abstraction?.- Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking.- Approximating Predicate Images for Bit-Vector Logic.- Model Checking Algorithms.- Finitary Winning in ?-Regular Games.- Efficient Model Checking for LTL with Partial Order Snapshots.- A Local Shape Analysis Based on Separation Logic.- Program Verification.- Compositional Model Extraction for Higher-Order Concurrent Programs.- A Region Graph Based Approach to Termination Proofs.- Verifying Concurrent Message-Passing C Programs with Recursive Calls.- Automata-Based Verification of Programs with Tree Updates.- Runtime Diagnostics.- An Experimental Comparison of the Effectiveness of Control Flow Based Testing Approaches onSeeded Faults.- Exploiting Traces in Program Analysis.- Quantitative Techniques.- Model-Checking Markov Chains in the Presence of Uncertainties.- Safety Metric Temporal Logic Is Fully Decidable.- Simulation-Based Graph Similarity.- Tool Demonstrations.- PRISM: A Tool for Automatic Verification of Probabilistic Systems.- DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation.- mcmas: A Model Checker for Multi-agent Systems.- MSCan – A Tool for Analyzing MSC Specifications.- Refinement.- A Practical and Complete Approach to Predicate Refinement.- Counterexample Driven Refinement for Abstract Interpretation.- Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.