Rigorous State-Based Methods: Lecture Notes in Computer Science, cartea 14010
Editat de Uwe Glässer, Jose Creissac Campos, Dominique Méry, Philippe Palanqueen Limba Engleză Paperback – 15 mai 2023
The 12 full and 7 short papers included in this volume were carefully reviewed and selected from 47 submissions. The proceedings also include 4 PhD symposium contributions. They deal with state-based and machine-based formal methods, mainly Abstract State Machines (ASM), Alloy, B, TLA+, VDM, and Z.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 491.66 lei
Preț vechi: 614.57 lei
-20%
Puncte Express: 737
Carte tipărită la comandă
Livrare economică 30 iulie-13 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783031331626
ISBN-10: 3031331621
Pagini: 396
Ilustrații: XIII, 380 p. 131 illus., 107 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031331621
Pagini: 396
Ilustrații: XIII, 380 p. 131 illus., 107 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Pattern-based Refinemnt Generation Through Domain Specifi Languages.- Inductive Construction in B with the Theory Plugin.- Validation of Formal Models by Interactive Simulation.- Thread-Local, Step-Local Proof Obligations for Refnement of State-Based Concurrent Systems.- Encoding TLA+ Proof Obligations Safely for SMT.- Compositional I/O Abstract State Machines.- Crucible Tools for Test Generation and Animation of Alloy Models.- Modelling an Automotive Software System with TASTD.- TASTD a real-time extension for ASTD.- Validation by Abstraction and Refiement.- Verifying Event-B Hybrid Models using Cyclone.- Exploration of Reflectie ASMs for Security.- Standalone Event-B models analysis relying on the EB4EB meta-theory.- Adding records to Alloy.- Designing Secure Systems using Hierarchical STPA and Event-B.- Behavioural Theory of Reflectie Algorithms.- Specification in the Event-B Institution.- Verifying temporal relational models with Pardinus.- AMAN Case Study.- Analysis of a Safety-critical Interactive System through VOs.- Task Model Design and Analysis with Alloy.- Modeling and Verifying an Arrival Manager using Event-B.- Formal MVC: a Pattern for the Integration of ASM Specification in UI Development.- Exploring a methodology for formal verificatio of safety-critical systems.- Extending Modelchecking with ProB to Floating-Point Numbers and Hybrid Systems.- A framework for formal verificatio and validation of railway systems.- Reconstruction of TLAPS proofs solved by veriT in Lambdapi.