Rigorous State-Based Methods: 9th International Conference, ABZ 2023, Nancy, France, May 30–June 2, 2023, Proceedings: 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ț: 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ț: 488.56 lei
Preț vechi: 610.69 lei
-20%
Puncte Express: 733
Preț estimativ în valută:
86.48€ • 100.89$ • 74.88£
86.48€ • 100.89$ • 74.88£
Carte tipărită la comandă
Livrare economică 26 februarie-12 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031331626
ISBN-10: 3031331621
Pagini: 380
Ilustrații: XIII, 380 p. 131 illus., 107 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.55 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031331621
Pagini: 380
Ilustrații: XIII, 380 p. 131 illus., 107 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.55 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
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.