Cantitate/Preț
Produs
Total produse
Vezi coșul
NASA Formal Methods de Klaus Havelund

NASA Formal Methods: Lecture Notes in Computer Science

Editat de Klaus Havelund, Gerard Holzmann, Rajeev Joshi
en Limba Engleză Paperback – 9 apr 2015
This book constitutes the refereed proceedings of the 7th International Symposium on NASA Formal Methods, NFM 2015, held in Pasadena, CA, USA, in April 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32995 lei

Preț vechi: 41243 lei
-20% Nou

Puncte Express: 495
Preț estimativ în valută:
5839€ • 6846$ • 5128£

Carte tipărită la comandă

Livrare economică 31 ianuarie-14 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
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

Public țintă

Research

Cuprins

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.