| 000 | 05754nam a22005175i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-06773-0 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125506.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220519s2022 sz | s |||| 0|eng d | ||
| 020 |
_a9783031067730 _9978-3-031-06773-0 |
||
| 024 | 7 |
_a10.1007/978-3-031-06773-0 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 072 | 7 |
_aUMZ _2thema |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aNASA Formal Methods _h[electronic resource] : _b14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24–27, 2022, Proceedings / _cedited by Jyotirmoy V. Deshmukh, Klaus Havelund, Ivan Perez. |
| 250 | _a1st ed. 2022. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
| 300 |
_aXXII, 828 p. 219 illus., 168 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13260 |
|
| 505 | 0 | _aInvited Keynotes -- Formal Methods for Trusted Space Autonomy: Boon or Bane -- An Essence of Domain Engineering - A Basis for Trustworthy Aeronautics and Space Software -- Concept Design Moves -- Automating Program Transformation with Coccinelle -- The Prusti Project: Formal Verification for Rust -- Summers Reachability Analysis for Cyber-Physical Systems: Are we there yet -- Regular Submissions -- Towards Better Test Coverage: Merging Unit Tests for Autonomous Systems -- Quantification of Battery Depletion Risk Made Efficient -- Hierarchical Contract-based Synthesis for Assurance Cases -- Verified Probabilistic Policies for Deep Reinforcement Learning -- NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing -- The Black-Box Simplex Architecture for Runtime Assurance of Autonomous CPS -- Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning -- Towards Refactoring FRETish Requirements -- Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachability -- ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs -- Permutation Invariance of Deep Neural Networks with ReLUs -- Configurable Benchmarks for C Model Checkers -- AssumeGuarantee Reasoning with Scheduled Components -- Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning -- From Verified Scala to STIX File System Embedded Code using Stainless -- On the Termination of Borrow Checking in Featherweight Rust -- Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme -- Zone Extrapolations in Parametric Timed Automata -- Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior -- Timed Automata Learning via SMT Solving -- Asynchronous Composition of Local Interface LTL Properties -- Elucidation and Analysis of Specification Patterns in Aerospace System Telemetry -- Robust Computation TreeLogic -- On the-Fly Model Checking with Neural MCTS -- Checking and Test Generation for Comprehensive Verification -- Operational Annotations: a New Method for Sequential Program Verification -- Byzantine Fault Tolerant Consensus in Agda -- DSV: Disassembly Soundness Validation without Assuming a Ground Truth -- Probabilistic Hyperproperties with Rewards -- Hypercontracts -- Monitorability of Expressive Verdicts -- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees -- Approximate Translation from Floating-Point to Real-Interval Arithmetic -- Synthesis of Optimal Defenses for System Architecture Design Model in MaxSMT -- Certified Computation of Nondeterministic Limits -- The Power of Disjoint Support Decompositions in Decision Diagrams -- Incremental Transitive Closure for Zonal Abstract Domain -- Proof Mate: an Interactive Proof Helper for PVS -- Runtime Verification Triggers -- Real-time, Autonomous Fault Recovery on the CySat-I. | |
| 520 | _aThis book constitutes the proceedings of the 14th International Symposium on NASA Formal Methods, NFM 2022, held in Pasadena, USA, during May 24-27, 2022. The 33 full and 6 short papers presented in this volume were carefully reviewed and selected from 118submissions. The volume also contains 6 invited papers. The papers deal with advances in formal methods, formal methods techniques, and formal methods in practice. The focus on topics such as interactive and automated theorem proving; SMT and SAT solving; model checking; use of machine learning and probabilistic reasoning in formal methods; formal methods and graphical modeling languages such as SysML or UML; usability of formal method tools and application in industry, etc. . | ||
| 650 | 0 | _aSoftware engineering. | |
| 650 | 1 | 4 | _aSoftware Engineering. |
| 700 | 1 |
_aDeshmukh, Jyotirmoy V. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aHavelund, Klaus. _eeditor. _0(orcid) _10000-0001-7079-0472 _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aPerez, Ivan. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031067723 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031067747 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13260 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-06773-0 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c178530 _d178530 |
||