NASA Formal Methods: Lecture Notes in Computer Science
Editat de Klaus Havelund, Gerard Holzmann, Rajeev Joshien Limba Engleză Paperback – 9 apr 2015
The 24 revised regular papers presented together with 9 short papers were carefully reviewed and selected from 108 submissions. The topics include model checking, theorem proving; SAT and SMT solving; symbolic execution; static analysis; runtime verification; systematic testing; program refinement; compositional verification; security and intrusion detection; modeling and specification formalisms; model-based development; model-based testing; requirement engineering; formal approaches to fault tolerance; and applications of formal methods.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 329.95 lei
Preț vechi: 412.43 lei
-20%
Puncte Express: 495
Preț estimativ în valută:
58.39€ • 68.24$ • 50.70£
58.39€ • 68.24$ • 50.70£
Carte tipărită la comandă
Livrare economică 20 februarie-06 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319175232
ISBN-10: 3319175238
Pagini: 472
Ilustrații: XIII, 458 p. 115 illus.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.71 kg
Ediția:2015
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3319175238
Pagini: 472
Ilustrații: XIII, 458 p. 115 illus.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.71 kg
Ediția:2015
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
Moving Fast with Software Verification.- Developing Verified Software Using Leon.- Timely Rollback: Specification and Verification.- Sum of Abstract Domains.- Reachability Preservation Based Parameter Synthesis for Timed Automata.- Compositional Verification of Parameterised Timed Systems.- Requirements Analysis of a Quad-Redundant Flight Control System.- Partial Order Reduction and Symmetry with Multiple Representatives.- Statistical Model Checking of Ad Hoc Routing Protocols in Lossy Grid Networks.- Efficient Guiding Strategies for Testing of Temporal Properties of Hybrid Systems.- First-Order Transitive Closure Axiomatization via Iterative Invariant Injections.- Reachability Analysis Using Extremal Rates.- Towards Realizability Checking of Contracts Using Theories.- Practical Partial Order Reduction for CSP.- A Little Language for Testing.- Detecting MPI Zero Buffer Incompatibility by SMT Encoding.- A Falsification View of Success Typing.- Verified ROS-Based Deployment of Platform-Independent Control Systems.- A Rigorous Approach to Combining Use Case Modelling and Accident Scenarios.- Are We There Yet? Determining the Adequacy of Formalized Requirements and Test Suites.- A Greedy Approach for the Efficient Repair of Stochastic Models.- Integrating SMT with Theorem Proving for Analog/Mixed-Signal Circuit Verification.- Conflict-Directed Graph Coverage.- Shape Analysis with Connectors.- Automated Conflict-Free Concurrent Implementation of Timed Component-Based Models.- Formal API Specification of the PikeOS Separation Kernel.- Data Model Bugs.- Predicting and Witnessing Data Races Using CSP.- A Benchmark Suite for Hybrid Systems Reachability Analysis.- Generalizing a Mathematical Analysis Library in Isabelle/HOL.- A Tool for Intersecting Context-Free Grammars and Its Applications.- UFIT: A Tool for Modeling Faults in UPPAAL Timed Automata.- Blocked Literals Are Universal.- Practical Formal Verification of Domain-Specific Language Applications.- Reporting Races in Dynamic Partial Order Reduction.