001446896 000__ 06055cam\a2200601Ii\4500
001446896 001__ 1446896
001446896 003__ OCoLC
001446896 005__ 20230310004023.0
001446896 006__ m\\\\\o\\d\\\\\\\\
001446896 007__ cr\un\nnnunnun
001446896 008__ 220522s2022\\\\sz\a\\\\ob\\\\101\0\eng\d
001446896 019__ $$a1319427805
001446896 020__ $$a9783031067730$$q(electronic bk.)
001446896 020__ $$a3031067738$$q(electronic bk.)
001446896 020__ $$z9783031067723
001446896 020__ $$z303106772X
001446896 0247_ $$a10.1007/978-3-031-06773-0$$2doi
001446896 035__ $$aSP(OCoLC)1319343639
001446896 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCF$$dOCLCQ
001446896 049__ $$aISEA
001446896 050_4 $$aQA76.9.F67
001446896 08204 $$a004.01/51$$223/eng/20220526
001446896 1112_ $$aNFM (Symposium)$$n(14th :$$d2022 :$$cPasadena, Calif.).
001446896 24510 $$aNASA formal methods :$$b14th international symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /$$cJyotirmoy V. Deshmukh, Klaus Havelund, Ivan Perez (eds.).
001446896 24630 $$aNFM 2022
001446896 264_1 $$aCham :$$bSpringer,$$c[2022]
001446896 264_4 $$c©2022
001446896 300__ $$a1 online resource :$$billustrations (chiefly color).
001446896 336__ $$atext$$btxt$$2rdacontent
001446896 337__ $$acomputer$$bc$$2rdamedia
001446896 338__ $$aonline resource$$bcr$$2rdacarrier
001446896 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13260
001446896 500__ $$aInternational conference proceedings.
001446896 504__ $$aIncludes bibliographical references and author index.
001446896 5050_ $$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 Tree Logic -- 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.
001446896 506__ $$aAccess limited to authorized users.
001446896 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. .
001446896 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 26, 2022).
001446896 650_0 $$aFormal methods (Computer science)$$vCongresses.
001446896 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001446896 655_7 $$aConference papers and proceedings.$$2lcgft
001446896 655_0 $$aElectronic books.
001446896 7001_ $$aDeshmukh, Jyotirmoy,$$eeditor.
001446896 7001_ $$aHavelund, Klaus,$$d1955-$$eeditor.
001446896 7001_ $$aPerez, Ivan$$c(Research scientist),$$eeditor.
001446896 77608 $$iPrint version: $$z303106772X$$z9783031067723$$w(OCoLC)1312150177
001446896 830_0 $$aLecture notes in computer science ;$$v13260.$$x1611-3349
001446896 852__ $$bebk
001446896 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-06773-0$$zOnline Access$$91397441.1
001446896 909CO $$ooai:library.usi.edu:1446896$$pGLOBAL_SET
001446896 980__ $$aBIB
001446896 980__ $$aEBOOK
001446896 982__ $$aEbook
001446896 983__ $$aOnline
001446896 994__ $$a92$$bISE